#include <aaboxtree.h>
◆ Branch() [1/2]
Tree::AABoxTree::Branch::Branch |
( |
| ) |
|
◆ Branch() [2/2]
Tree::AABoxTree::Branch::Branch |
( |
const Primitive2D::AABoundingBox & | box, |
|
|
const Vertex2f & | center ) |
◆ ~Branch()
virtual Tree::AABoxTree::Branch::~Branch |
( |
| ) |
|
|
virtual |
◆ find()
virtual Leaf * Tree::AABoxTree::Branch::find |
( |
const Primitive2D::AABoundingBox & | box | ) |
|
|
virtual |
◆ getLeaves()
virtual HeapArray< Leaf * > Tree::AABoxTree::Branch::getLeaves |
( |
| ) |
|
|
virtual |
◆ getQuadrant()
- Parameters
-
The | center of the bounding-box or vertex to test. |
- Returns
- The Quadrant in which the given vertex is inside.
◆ insert()
virtual Leaf * Tree::AABoxTree::Branch::insert |
( |
const Primitive2D::AABoundingBox & | box | ) |
|
|
virtual |
◆ inside() [1/2]
virtual HeapArray< Leaf * > Tree::AABoxTree::Branch::inside |
( |
const Primitive2D::AABoundingBox & | box, |
|
|
float | precision = 0.0f ) |
|
virtual |
◆ inside() [2/2]
virtual HeapArray< Leaf * > Tree::AABoxTree::Branch::inside |
( |
const Vertex2f & | v, |
|
|
float | precision = 0.0f ) |
|
virtual |
◆ intersect()
virtual HeapArray< Leaf * > Tree::AABoxTree::Branch::intersect |
( |
const Primitive2D::AABoundingBox & | box | ) |
|
|
virtual |
◆ nearest()
virtual Leaf * Tree::AABoxTree::Branch::nearest |
( |
const Vertex2f & | vertex | ) |
|
|
virtual |
◆ within()
virtual HeapArray< Leaf * > Tree::AABoxTree::Branch::within |
( |
const Primitive2D::AABoundingBox & | box, |
|
|
float | precision = 0.0f ) |
|
virtual |
◆ center
const Vertex2f Tree::AABoxTree::Branch::center |
◆ pQuadrant
Node* Tree::AABoxTree::Branch::pQuadrant[4] |
The documentation for this class was generated from the following file: