#include <bvh.h>
◆ ~Bvh()
◆ Build()
void Util::Bvh::Build |
( |
Math::bbox * | bboxes, |
|
|
uint32_t | numBoxes ) |
|
inline |
◆ Clear()
void Util::Bvh::Clear |
( |
| ) |
|
|
inline |
◆ FindBestSplitPlane()
float Util::Bvh::FindBestSplitPlane |
( |
Bvh::Node * | node, |
|
|
Math::bbox * | bboxes, |
|
|
int & | axis, |
|
|
float & | splitPos ) |
|
inline |
◆ Intersect()
returns all intersected bboxes indices based on the order they were when passed to the Build method.
◆ Subdivide()
◆ UpdateNodeBounds()
◆ externalIndices
uint32_t* Util::Bvh::externalIndices = nullptr |
these map to where the original bbox was when passed to the build method.
◆ nodes
◆ nodesUsed
uint32_t Util::Bvh::nodesUsed = 0 |
◆ numNodes
uint32_t Util::Bvh::numNodes = 0 |
◆ rootNodeIndex
uint32_t Util::Bvh::rootNodeIndex = 0 |
The documentation for this class was generated from the following file:
- /github/workspace/code/foundation/util/bvh.h