#include <BBoxTree.h>
Inheritance diagram for geom::BBoxTreeBranch< N, T >:
Public Types | |
| typedef Types::Number | Number |
| The number type. | |
| typedef Types::Point | Point |
| The Cartesian point type. | |
| typedef Types::BBox | BBox |
| A bounding box. | |
| typedef Types::SizeType | SizeType |
| The size type. | |
Public Member Functions | |
Constructor and destructor. | |
| BBoxTreeBranch (const Point *base, const ads::FixedArray< N, std::vector< const Point * > > &sorted, SizeType leafSize) | |
| Construct from sorted midpoints of bounding boxes. | |
| virtual | ~BBoxTreeBranch () |
| Destructor. Delete this and the left and right branches. | |
Accessors. | |
| const BBox & | getDomain () const |
| Return the domain that contains all the bounding boxes in this branch. | |
Manipulators. | |
| void | computeDomain (const std::vector< BBox > &boxes) |
| Compute the domain for this branch. | |
Queries. | |
| void | computePointQuery (std::vector< const Leaf * > &leaves, const Point &x) const |
| Get the leaves containing bounding boxes that might contain the point. | |
| void | computeWindowQuery (std::vector< const Leaf * > &leaves, const BBox &window) const |
| Get the leaves containing bounding boxes that might overlap the window. | |
| void | computeMinimumDistanceQuery (std::vector< const Leaf * > &leaves, const Point &x, Number *upperBound) const |
| Get the indices of the bounding boxes that might contain objects of minimum distance. | |
Memory usage. | |
| SizeType | getMemoryUsage () const |
| Return the memory usage of this branch and its children. | |
Validity check. | |
| void | checkValidity (const std::vector< BBox > &boxes) const |
| Check for validity. | |
File I/O. | |
| void | printAscii (std::ostream &out) const |
| Print the node information. | |
1.4.7