ArborX::BVH¶
Defined in header <ArborX_LinearBVH.hpp>
template <typename MemorySpace>
class BoundingVolumeHierarchy;
The class template ArborX::BoundingVolumeHierarchy is a tree data structure that can be used to accelerate the search for geometrical objects in space.
ArborX defines the ArborX::BVH alias template for convenience.
template <typename MemorySpace>
using BVH = BoundingVolumeHierarchy<MemorySpace>;
Template parameter¶
MemorySpace: A valid Kokkos memory space.
Member types¶
Member type |
Definition |
|---|---|
|
|
|
|
|
|
Member functions¶
constructs the tree data structure |
|
returns the number of leaves stored in the tree |
|
checks whether the tree has no leaves |
|
returns a bounding volume able to contain all leaves stored in the tree |
|
finds all leaves that satisfy given predicates, e.g. nearest to a point or intersecting with a box or a sphere |