Go to the documentation of this file.
5 #ifndef LAS_VEGAS_DYNAMICKDTREE_HPP
6 #define LAS_VEGAS_DYNAMICKDTREE_HPP
10 template <
typename BaseVecT>
18 template <
typename BaseVecT>
37 return point1 == point2;
71 #include "DynamicKDTree.tcc"
73 #endif //LAS_VEGAS_DYNAMICKDTREE_HPP
void insert(BaseVecT point, VertexHandle vH)
void deleteNode(BaseVecT point)
std::pair< Index, float > findNearestRec(Node< BaseVecT > *node, BaseVecT point, int depth, Index minDist, float minDistSq, BaseVecT currentBest)
Node< BaseVecT > * deleteNodeRec(Node< BaseVecT > *node, BaseVecT point, int depth)
int sizeRec(Node< BaseVecT > *node)
bool arePointsSame(BaseVecT point1, BaseVecT point2)
void copyPoint(BaseVecT &p1, BaseVecT &p2)
Node< BaseVecT > * insertRec(Node< BaseVecT > *node, BaseVecT point, VertexHandle vH, unsigned int depth)
Handle to access vertices of the mesh.
Index findNearest(BaseVecT point)
Node< BaseVecT > * minNode(Node< BaseVecT > *x, Node< BaseVecT > *y, Node< BaseVecT > *z, int d)
struct Node< BaseVecT > * newNode(BaseVecT point, VertexHandle vH)
Node< BaseVecT > * findMin(Node< BaseVecT > *node, int d)
Node< BaseVecT > * findMinRec(Node< BaseVecT > *node, int d, unsigned depth)
uint32_t Index
Datatype used as index for each vertex, face and edge.
lvr2
Author(s): Thomas Wiemann
, Sebastian Pütz , Alexander Mock , Lars Kiesow , Lukas Kalbertodt , Tristan Igelbrink , Johan M. von Behren , Dominik Feldschnieders , Alexander Löhr
autogenerated on Wed Mar 2 2022 00:37:23