CDT  1.4.1
C++ library for constrained Delaunay triangulation
Loading...
Searching...
No Matches
CDT::LocatorKDTree< TCoordType, NumVerticesInLeaf, InitialStackDepth, StackDepthIncrement > Class Template Reference

KD-tree holding points. More...

#include <LocatorKDTree.h>

Public Member Functions

void initialize (const std::vector< V2d< TCoordType > > &points)
 Initialize KD-tree with points.
 
void addPoint (const VertInd i, const std::vector< V2d< TCoordType > > &points)
 Add point to KD-tree.
 
VertInd nearPoint (const V2d< TCoordType > &pos, const std::vector< V2d< TCoordType > > &points) const
 Find nearest point using R-tree.
 
CDT::VertInd size () const
 
bool empty () const
 

Detailed Description

template<typename TCoordType, size_t NumVerticesInLeaf = 32, size_t InitialStackDepth = 32, size_t StackDepthIncrement = 32>
class CDT::LocatorKDTree< TCoordType, NumVerticesInLeaf, InitialStackDepth, StackDepthIncrement >

KD-tree holding points.

Definition at line 25 of file LocatorKDTree.h.

Member Function Documentation

◆ addPoint()

template<typename TCoordType , size_t NumVerticesInLeaf = 32, size_t InitialStackDepth = 32, size_t StackDepthIncrement = 32>
void CDT::LocatorKDTree< TCoordType, NumVerticesInLeaf, InitialStackDepth, StackDepthIncrement >::addPoint ( const VertInd i,
const std::vector< V2d< TCoordType > > & points )
inline

Add point to KD-tree.

Definition at line 47 of file LocatorKDTree.h.

◆ empty()

template<typename TCoordType , size_t NumVerticesInLeaf = 32, size_t InitialStackDepth = 32, size_t StackDepthIncrement = 32>
bool CDT::LocatorKDTree< TCoordType, NumVerticesInLeaf, InitialStackDepth, StackDepthIncrement >::empty ( ) const
inline

Definition at line 64 of file LocatorKDTree.h.

◆ initialize()

template<typename TCoordType , size_t NumVerticesInLeaf = 32, size_t InitialStackDepth = 32, size_t StackDepthIncrement = 32>
void CDT::LocatorKDTree< TCoordType, NumVerticesInLeaf, InitialStackDepth, StackDepthIncrement >::initialize ( const std::vector< V2d< TCoordType > > & points)
inline

Initialize KD-tree with points.

Definition at line 29 of file LocatorKDTree.h.

◆ nearPoint()

template<typename TCoordType , size_t NumVerticesInLeaf = 32, size_t InitialStackDepth = 32, size_t StackDepthIncrement = 32>
VertInd CDT::LocatorKDTree< TCoordType, NumVerticesInLeaf, InitialStackDepth, StackDepthIncrement >::nearPoint ( const V2d< TCoordType > & pos,
const std::vector< V2d< TCoordType > > & points ) const
inline

Find nearest point using R-tree.

Definition at line 52 of file LocatorKDTree.h.

◆ size()

template<typename TCoordType , size_t NumVerticesInLeaf = 32, size_t InitialStackDepth = 32, size_t StackDepthIncrement = 32>
CDT::VertInd CDT::LocatorKDTree< TCoordType, NumVerticesInLeaf, InitialStackDepth, StackDepthIncrement >::size ( ) const
inline

Definition at line 59 of file LocatorKDTree.h.


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