CDT
1.4.1
C++ library for constrained Delaunay triangulation
|
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 |
KD-tree holding points.
Definition at line 25 of file LocatorKDTree.h.
|
inline |
Add point to KD-tree.
Definition at line 47 of file LocatorKDTree.h.
|
inline |
Definition at line 64 of file LocatorKDTree.h.
|
inline |
Initialize KD-tree with points.
Definition at line 29 of file LocatorKDTree.h.
|
inline |
Find nearest point using R-tree.
Definition at line 52 of file LocatorKDTree.h.
|
inline |
Definition at line 59 of file LocatorKDTree.h.