BVHTree.hpp File Reference

#include "axom/core/Macros.hpp"
#include "axom/core/Types.hpp"
#include "axom/primal/geometry/BoundingBox.hpp"
#include "axom/primal/geometry/Point.hpp"
#include "axom/primal/operators/squared_distance.hpp"
#include "axom/slic/interface/slic.hpp"
#include <fstream>
#include <queue>
#include <sstream>
#include <vector>

Classes
class	axom::spin::BVHTree< T, NDIMS >
	The BVHTree class provides functionality for generating a Bounding Volume Hierarchy (BVH) of axis-aligned bounding boxes, i.e., buckets that spatially partitions a set of objects. Each object is defined by its bounding box and user-supplied data-structure specified as a template argument. Once generated, the BVHTree can then be used as an acceleration structure to speed up the performance of point queries on the given objects, e.g., minimum distance, closest point, orientation, etc. More...

Namespaces
	axom
	axom::spin