|  | 
| void | initialize (index_t nb, std::function< void(BOX &, index_t)> get_bbox) | 
|  | Initializes this AABB. 
 | 
|  | 
| void | bbox_intersect_recursive (std::function< void(index_t)> action, const BOX &box, index_t node, index_t b, index_t e) const | 
|  | Computes all the elements that have a bbox that intersects a given bbox in a sub-tree of the AABB tree. 
 | 
|  | 
| void | self_intersect_recursive (std::function< void(index_t, index_t)> action, index_t node1, index_t b1, index_t e1, index_t node2, index_t b2, index_t e2) const | 
|  | Computes all the pairs of intersecting elements for two sub-trees of the AABB tree. 
 | 
|  | 
| void | other_intersect_recursive (std::function< void(index_t, index_t)> action, index_t node1, index_t b1, index_t e1, const AABB< BOX > *other, index_t node2, index_t b2, index_t e2) const | 
|  | Computes all the pairs of intersecting elements for two sub-trees of two AABB trees. 
 | 
|  | 
| void | init_bboxes_recursive (index_t node_index, index_t b, index_t e, std::function< void(BOX &, index_t)> get_bbox) | 
|  | Computes the hierarchy of bounding boxes recursively. 
 | 
|  | 
| bool | indirect () const | 
|  | Tests whether this AABB is indirect or in-place. 
 | 
|  | 
| index_t | element_in_leaf (index_t i) const | 
|  | Gets the element stored in a leaf node. 
 | 
|  | 
| static index_t | max_node_index (index_t node_index, index_t b, index_t e) | 
|  | Computes the maximum node index in a subtree. 
 | 
|  | 
Base class for Axis Aligned Bounding Box trees of mesh elements with 2d boxes. 
Definition at line 364 of file mesh_AABB.h.