BVH_LinearBuilder.hxx File Reference

#include <BVH_RadixSorter.hxx>
#include <BVH_LinearBuilder.lxx>

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...