CDT
1.4.1
C++ library for constrained Delaunay triangulation
|
Stores kd-tree node data. More...
#include <KDTree.h>
Public Member Functions | |
Node () | |
Create empty leaf. | |
void | setChildren (const node_index c1, const node_index c2) |
Children setter for convenience. | |
bool | isLeaf () const |
Check if node is a leaf (has no valid children) | |
Public Attributes | |
children_type | children |
two children if not leaf; {0,0} if leaf | |
point_data_vec | data |
points' data if leaf | |
Stores kd-tree node data.
|
inline |
|
inline |
|
inline |
children_type CDT::KDTree::KDTree< TCoordType, NumVerticesInLeaf, InitialStackDepth, StackDepthIncrement >::Node::children |
point_data_vec CDT::KDTree::KDTree< TCoordType, NumVerticesInLeaf, InitialStackDepth, StackDepthIncrement >::Node::data |