|
| void | addBox (node_type min, node_type max, size_type id=size_type(-1)) |
| | add a box in the region tree More...
|
| |
|
void | clear () |
| | clear the tree
|
| |
|
void | findIntersectingBoxes (const node_type &bmin, const node_type &bmax, pbox_set_type &boxlst) |
| |
|
void | findContainingBoxes (const node_type &bmin, const node_type &bmax, pbox_set_type &boxlst) |
| |
|
void | findContainedBoxes (const node_type &bmin, const node_type &bmax, pbox_set_type &boxlst) |
| |
|
void | findBoxesAtPoint (const node_type &P, pbox_set_type &boxlst) |
| |
|
void | findIntersectingBoxes (const node_type &bmin, const node_type &bmax, std::vector< size_type > &idvec) |
| |
|
void | findContainingBoxes (const node_type &bmin, const node_type &bmax, std::vector< size_type > &idvec) |
| |
|
void | findContainedBoxes (const node_type &bmin, const node_type &bmax, std::vector< size_type > &idvec) |
| |
|
void | findBoxesAtPoint (const node_type &P, std::vector< size_type > &idvec) |
| |
|
void | dump () |
| |
implements a region-tree for point search in a set of boxes
- Author
- Christophe Prud'homme