Open CASCADE Technology
7.2.0
|
Data Structures | |
class | BVH_LinearBuilder< T, N > |
Performs fast BVH construction using LBVH building approach. Algorithm uses spatial Morton codes to reduce the BVH construction problem to a sorting problem (radix sort – O(N) complexity). This Linear Bounding Volume Hierarchy (LBVH) builder produces BVH trees of lower quality compared to SAH-based BVH builders but it is over an order of magnitude faster (up to 3M triangles per second). More... | |
Namespaces | |
BVH | |
Functions | |
template<class T , int N> | |
Standard_Integer | BVH::UpdateBounds (BVH_Set< T, N > *theSet, BVH_Tree< T, N > *theTree, const Standard_Integer theNode=0) |
Calculates bounding boxes (AABBs) for the given BVH tree. More... | |