CDT  1.4.1
C++ library for constrained Delaunay triangulation
Loading...
Searching...
No Matches
CDT::KDTree::KDTree< TCoordType, NumVerticesInLeaf, InitialStackDepth, StackDepthIncrement >::Node Struct Reference

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
 

Detailed Description

template<typename TCoordType, size_t NumVerticesInLeaf, size_t InitialStackDepth, size_t StackDepthIncrement>
struct CDT::KDTree::KDTree< TCoordType, NumVerticesInLeaf, InitialStackDepth, StackDepthIncrement >::Node

Stores kd-tree node data.

Definition at line 58 of file KDTree.h.

Constructor & Destructor Documentation

◆ Node()

template<typename TCoordType , size_t NumVerticesInLeaf, size_t InitialStackDepth, size_t StackDepthIncrement>
CDT::KDTree::KDTree< TCoordType, NumVerticesInLeaf, InitialStackDepth, StackDepthIncrement >::Node::Node ( )
inline

Create empty leaf.

Definition at line 63 of file KDTree.h.

Member Function Documentation

◆ isLeaf()

template<typename TCoordType , size_t NumVerticesInLeaf, size_t InitialStackDepth, size_t StackDepthIncrement>
bool CDT::KDTree::KDTree< TCoordType, NumVerticesInLeaf, InitialStackDepth, StackDepthIncrement >::Node::isLeaf ( ) const
inline

Check if node is a leaf (has no valid children)

Definition at line 75 of file KDTree.h.

◆ setChildren()

template<typename TCoordType , size_t NumVerticesInLeaf, size_t InitialStackDepth, size_t StackDepthIncrement>
void CDT::KDTree::KDTree< TCoordType, NumVerticesInLeaf, InitialStackDepth, StackDepthIncrement >::Node::setChildren ( const node_index c1,
const node_index c2 )
inline

Children setter for convenience.

Definition at line 69 of file KDTree.h.

Member Data Documentation

◆ children

template<typename TCoordType , size_t NumVerticesInLeaf, size_t InitialStackDepth, size_t StackDepthIncrement>
children_type CDT::KDTree::KDTree< TCoordType, NumVerticesInLeaf, InitialStackDepth, StackDepthIncrement >::Node::children

two children if not leaf; {0,0} if leaf

Definition at line 60 of file KDTree.h.

◆ data

template<typename TCoordType , size_t NumVerticesInLeaf, size_t InitialStackDepth, size_t StackDepthIncrement>
point_data_vec CDT::KDTree::KDTree< TCoordType, NumVerticesInLeaf, InitialStackDepth, StackDepthIncrement >::Node::data

points' data if leaf

Definition at line 61 of file KDTree.h.


The documentation for this struct was generated from the following file: