|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Represents a spatial partition or leaf in the KD-tree. More...
#include <geom_algorithms.H>
Public Attributes | |
| Rectangle | region |
| Geometric region covered by this node. | |
| bool | split_on_x = true |
| True if split is vertical, false if horizontal. | |
| Geom_Number | split_value = 0 |
| The coordinate value of the split. | |
| size_t | depth = 0 |
| Depth of the node in the tree. | |
| bool | is_leaf = false |
| True if it's a leaf node. | |
| Point | representative = Point(0, 0) |
| Point stored in the leaf. | |
Represents a spatial partition or leaf in the KD-tree.
Definition at line 8135 of file geom_algorithms.H.
| size_t Aleph::KDTreePointSearch::DebugPartition::depth = 0 |
Depth of the node in the tree.
Definition at line 8140 of file geom_algorithms.H.
True if it's a leaf node.
Definition at line 8141 of file geom_algorithms.H.
| Rectangle Aleph::KDTreePointSearch::DebugPartition::region |
Geometric region covered by this node.
Definition at line 8137 of file geom_algorithms.H.
Referenced by Aleph::KDTreePointSearch::debug_snapshot().
Point stored in the leaf.
Definition at line 8142 of file geom_algorithms.H.
True if split is vertical, false if horizontal.
Definition at line 8138 of file geom_algorithms.H.
| Geom_Number Aleph::KDTreePointSearch::DebugPartition::split_value = 0 |
The coordinate value of the split.
Definition at line 8139 of file geom_algorithms.H.