DHART
Loading...
Searching...
No Matches
nanort::BVHAccel< T > Member List

This is the complete list of members for nanort::BVHAccel< T >, including all inherited members.

bboxes_nanort::BVHAccel< T >private
BoundingBox(T bmin[3], T bmax[3]) constnanort::BVHAccel< T >inline
Build(const unsigned int num_primitives, const Prim &p, const Pred &pred, const BVHBuildOptions< T > &options=BVHBuildOptions< T >())nanort::BVHAccel< T >
BuildTree(BVHBuildStatistics *out_stat, std::vector< BVHNode< T > > *out_nodes, unsigned int left_idx, unsigned int right_idx, unsigned int depth, const P &p, const Pred &pred)nanort::BVHAccel< T >private
BVHAccel()nanort::BVHAccel< T >inline
Debug()nanort::BVHAccel< T >
GetIndices() constnanort::BVHAccel< T >inline
GetNodes() constnanort::BVHAccel< T >inline
GetStatistics() constnanort::BVHAccel< T >inline
indices_nanort::BVHAccel< T >private
IsValid() constnanort::BVHAccel< T >inline
ListNodeIntersections(const Ray< T > &ray, int max_intersections, const I &intersector, StackVector< NodeHit< T >, 128 > *hits) constnanort::BVHAccel< T >
nodes_nanort::BVHAccel< T >private
options_nanort::BVHAccel< T >private
pad0_nanort::BVHAccel< T >private
stats_nanort::BVHAccel< T >private
TestLeafNode(const BVHNode< T > &node, const Ray< T > &ray, const I &intersector) constnanort::BVHAccel< T >inlineprivate
TestLeafNodeIntersections(const BVHNode< T > &node, const Ray< T > &ray, const int max_intersections, const I &intersector, std::priority_queue< NodeHit< T >, std::vector< NodeHit< T > >, NodeHitComparator< T > > *isect_pq) constnanort::BVHAccel< T >inlineprivate
Traverse(const Ray< T > &ray, const I &intersector, H *isect, const BVHTraceOptions &options=BVHTraceOptions()) constnanort::BVHAccel< T >
~BVHAccel()nanort::BVHAccel< T >inline