EBGeometry
1.0
|
This is the complete list of members for BVH::NodeT< T, P, BV, K >, including all inherited members.
bottomUpSortAndPartition() noexcept | BVH::NodeT< T, P, BV, K > | inline |
flattenTree() const noexcept | BVH::NodeT< T, P, BV, K > | inline |
flattenTree(std::vector< std::shared_ptr< LinearNodeT< T, P, BV, K >>> &a_linearNodes, std::vector< std::shared_ptr< const P >> &a_sortedPrimitives, size_t &a_offset) const noexcept | BVH::NodeT< T, P, BV, K > | inlineprotected |
getBoundingVolume() const noexcept | BVH::NodeT< T, P, BV, K > | inline |
getBoundingVolumes() const noexcept | BVH::NodeT< T, P, BV, K > | inline |
getBoundingVolumes() noexcept | BVH::NodeT< T, P, BV, K > | inlineprotected |
getChildren() const noexcept | BVH::NodeT< T, P, BV, K > | inline |
getDistanceToBoundingVolume(const Vec3 &a_point) const noexcept | BVH::NodeT< T, P, BV, K > | inline |
getPrimitives() const noexcept | BVH::NodeT< T, P, BV, K > | inline |
getPrimitives() noexcept | BVH::NodeT< T, P, BV, K > | inlineprotected |
isLeaf() const noexcept | BVH::NodeT< T, P, BV, K > | inline |
isPartitioned() const noexcept | BVH::NodeT< T, P, BV, K > | inline |
m_boundingVolume | BVH::NodeT< T, P, BV, K > | protected |
m_boundingVolumes | BVH::NodeT< T, P, BV, K > | protected |
m_children | BVH::NodeT< T, P, BV, K > | protected |
m_partitioned | BVH::NodeT< T, P, BV, K > | protected |
m_primitives | BVH::NodeT< T, P, BV, K > | protected |
Node typedef | BVH::NodeT< T, P, BV, K > | |
NodePtr typedef | BVH::NodeT< T, P, BV, K > | |
NodeT() noexcept | BVH::NodeT< T, P, BV, K > | |
NodeT(const std::vector< PrimAndBV< P, BV >> &a_primsAndBVs) noexcept | BVH::NodeT< T, P, BV, K > | |
Partitioner typedef | BVH::NodeT< T, P, BV, K > | |
PrimitiveList typedef | BVH::NodeT< T, P, BV, K > | |
setChildren(const std::array< std::shared_ptr< NodeT< T, P, BV, K >>, K > &a_children) noexcept | BVH::NodeT< T, P, BV, K > | inlineprotected |
StopFunction typedef | BVH::NodeT< T, P, BV, K > | |
topDownSortAndPartition(const Partitioner &a_partitioner=BVCentroidPartitioner< T, P, BV, K >, const StopFunction &a_stopCrit=DefaultStopFunction< T, P, BV, K >) noexcept | BVH::NodeT< T, P, BV, K > | inline |
traverse(const BVH::Updater< P > &a_updater, const BVH::Visiter< Node, Meta > &a_visiter, const BVH::Sorter< Node, Meta, K > &a_sorter, const BVH::MetaUpdater< Node, Meta > &a_metaUpdater) const noexcept | BVH::NodeT< T, P, BV, K > | inline |
Vec3 typedef | BVH::NodeT< T, P, BV, K > | |
~NodeT() noexcept | BVH::NodeT< T, P, BV, K > | virtual |