#include <aacubetree.h>
◆ Leaf()
Tree::AACubeTree::Leaf::Leaf |
( |
Branch * | pParent, |
|
|
const Primitive3D::AABoundingBox & | Cube ) |
◆ ~Leaf()
virtual Tree::AACubeTree::Leaf::~Leaf |
( |
| ) |
|
|
virtual |
◆ find()
virtual Leaf * Tree::AACubeTree::Leaf::find |
( |
const Primitive3D::AABoundingBox & | box | ) |
|
|
virtual |
◆ getBaseIndex()
Handle Tree::AACubeTree::Leaf::getBaseIndex |
( |
| ) |
const |
|
inline |
- Returns
- The index in the super-class AACubeTree:pNode.
◆ getDuplicateVertexIndex()
const List< Handle > & Tree::AACubeTree::Leaf::getDuplicateVertexIndex |
( |
| ) |
|
|
inline |
◆ getInnerNode()
Node * Tree::AACubeTree::Leaf::getInnerNode |
( |
| ) |
|
|
inline |
◆ getLeaves()
virtual HeapArray< Leaf * > Tree::AACubeTree::Leaf::getLeaves |
( |
| ) |
|
|
virtual |
◆ hasDuplicates()
bool Tree::AACubeTree::Leaf::hasDuplicates |
( |
| ) |
const |
|
inline |
◆ insert()
virtual Leaf * Tree::AACubeTree::Leaf::insert |
( |
const Primitive3D::AABoundingBox & | Cube | ) |
|
|
virtual |
◆ inside() [1/2]
virtual HeapArray< Leaf * > Tree::AACubeTree::Leaf::inside |
( |
const Primitive3D::AABoundingBox & | Cube, |
|
|
float | precision = 0.0f ) |
|
virtual |
◆ inside() [2/2]
virtual HeapArray< Leaf * > Tree::AACubeTree::Leaf::inside |
( |
const Vertex3f & | v, |
|
|
float | precision = 0.0f ) |
|
virtual |
◆ intersect() [1/2]
HeapArray< Leaf * > Tree::AACubeTree::Leaf::intersect |
( |
| ) |
|
- Returns
- An array of all the neighboring-leaves that intersect this Leaf.
◆ intersect() [2/2]
virtual HeapArray< Leaf * > Tree::AACubeTree::Leaf::intersect |
( |
const Primitive3D::AABoundingBox & | Cube | ) |
|
|
virtual |
◆ within()
virtual HeapArray< Leaf * > Tree::AACubeTree::Leaf::within |
( |
const Primitive3D::AABoundingBox & | Cube, |
|
|
float | precision = 0.0f ) |
|
virtual |
◆ AACubeTree
The documentation for this class was generated from the following file: