|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Internal tree node structure. More...
Public Member Functions | |
| bool | is_leaf () const |
| Checks if this node is a leaf. | |
Public Attributes | |
| Rectangle | bbox |
| Bounding box enclosing all descendants. | |
| size_t | left = ~static_cast<size_t>(0) |
| Left child index. | |
| size_t | right = ~static_cast<size_t>(0) |
| Right child index. | |
| size_t | entry_idx = ~static_cast<size_t>(0) |
| Index in entries_ (leaf only). | |
Internal tree node structure.
Definition at line 12103 of file geom_algorithms.H.
|
inline |
Checks if this node is a leaf.
Definition at line 12113 of file geom_algorithms.H.
References Aleph::divide_and_conquer_partition_dp(), and entry_idx.
Referenced by Aleph::AABBTree::debug_snapshot(), Aleph::AABBTree::query_impl(), and Aleph::AABBTree::query_point_impl().
| Rectangle Aleph::AABBTree::Node::bbox |
Bounding box enclosing all descendants.
Definition at line 12105 of file geom_algorithms.H.
Referenced by Aleph::AABBTree::build(), Aleph::AABBTree::debug_snapshot(), Aleph::AABBTree::query_impl(), and Aleph::AABBTree::query_point_impl().
| size_t Aleph::AABBTree::Node::entry_idx = ~static_cast<size_t>(0) |
Index in entries_ (leaf only).
Definition at line 12108 of file geom_algorithms.H.
Referenced by Aleph::AABBTree::build(), Aleph::AABBTree::debug_snapshot(), is_leaf(), Aleph::AABBTree::query_impl(), and Aleph::AABBTree::query_point_impl().
| size_t Aleph::AABBTree::Node::left = ~static_cast<size_t>(0) |
Left child index.
Definition at line 12106 of file geom_algorithms.H.
Referenced by Aleph::AABBTree::build(), Aleph::AABBTree::debug_snapshot(), Aleph::AABBTree::query_impl(), and Aleph::AABBTree::query_point_impl().
| size_t Aleph::AABBTree::Node::right = ~static_cast<size_t>(0) |
Right child index.
Definition at line 12107 of file geom_algorithms.H.
Referenced by Aleph::AABBTree::build(), Aleph::AABBTree::debug_snapshot(), Aleph::AABBTree::query_impl(), and Aleph::AABBTree::query_point_impl().