| arePointsSame(BaseVecT point1, BaseVecT point2) | lvr2::DynamicKDTree< BaseVecT > | inlineprivate |
| copyPoint(BaseVecT &p1, BaseVecT &p2) | lvr2::DynamicKDTree< BaseVecT > | inlineprivate |
| deleteNode(BaseVecT point) | lvr2::DynamicKDTree< BaseVecT > | |
| deleteNodeRec(Node< BaseVecT > *node, BaseVecT point, int depth) | lvr2::DynamicKDTree< BaseVecT > | private |
| DynamicKDTree(int k) | lvr2::DynamicKDTree< BaseVecT > | inlineexplicit |
| findMin(Node< BaseVecT > *node, int d) | lvr2::DynamicKDTree< BaseVecT > | private |
| findMinRec(Node< BaseVecT > *node, int d, unsigned depth) | lvr2::DynamicKDTree< BaseVecT > | private |
| findNearest(BaseVecT point) | lvr2::DynamicKDTree< BaseVecT > | |
| findNearestRec(Node< BaseVecT > *node, BaseVecT point, int depth, Index minDist, float minDistSq, BaseVecT currentBest) | lvr2::DynamicKDTree< BaseVecT > | private |
| insert(BaseVecT point, VertexHandle vH) | lvr2::DynamicKDTree< BaseVecT > | |
| insertRec(Node< BaseVecT > *node, BaseVecT point, VertexHandle vH, unsigned int depth) | lvr2::DynamicKDTree< BaseVecT > | private |
| k | lvr2::DynamicKDTree< BaseVecT > | private |
| minNode(Node< BaseVecT > *x, Node< BaseVecT > *y, Node< BaseVecT > *z, int d) | lvr2::DynamicKDTree< BaseVecT > | private |
| newNode(BaseVecT point, VertexHandle vH) | lvr2::DynamicKDTree< BaseVecT > | private |
| root | lvr2::DynamicKDTree< BaseVecT > | private |
| size() | lvr2::DynamicKDTree< BaseVecT > | |
| sizeRec(Node< BaseVecT > *node) | lvr2::DynamicKDTree< BaseVecT > | private |
| ~DynamicKDTree()=default | lvr2::DynamicKDTree< BaseVecT > | |