#include <aaboxtree.h>
◆ Node()
Tree::AABoxTree::Node::Node |
( |
const Primitive2D::AABoundingBox & | box, |
|
|
Branch * | pParent = nullptr ) |
◆ ~Node()
virtual Tree::AABoxTree::Node::~Node |
( |
| ) |
|
|
virtual |
◆ find()
virtual Leaf * Tree::AABoxTree::Node::find |
( |
const Primitive2D::AABoundingBox & | box | ) |
|
|
pure virtual |
◆ getLeaves()
virtual HeapArray< Leaf * > Tree::AABoxTree::Node::getLeaves |
( |
| ) |
|
|
pure virtual |
◆ getParent()
const Branch * Tree::AABoxTree::Node::getParent |
( |
| ) |
const |
|
inline |
◆ inside() [1/2]
virtual HeapArray< Leaf * > Tree::AABoxTree::Node::inside |
( |
const Primitive2D::AABoundingBox & | box, |
|
|
float | precision = 0.0f ) |
|
pure virtual |
◆ inside() [2/2]
virtual HeapArray< Leaf * > Tree::AABoxTree::Node::inside |
( |
const Vertex2f & | v, |
|
|
float | precision = 0.0f ) |
|
pure virtual |
◆ intersect()
virtual HeapArray< Leaf * > Tree::AABoxTree::Node::intersect |
( |
const Primitive2D::AABoundingBox & | box | ) |
|
|
pure virtual |
◆ nearest()
virtual Leaf * Tree::AABoxTree::Node::nearest |
( |
const Vertex2f & | vertex | ) |
|
|
pure virtual |
◆ within()
virtual HeapArray< Leaf * > Tree::AABoxTree::Node::within |
( |
const Primitive2D::AABoundingBox & | box, |
|
|
float | precision = 0.0f ) |
|
pure virtual |
◆ AABoxTree
The documentation for this class was generated from the following file: