#include <DynamicKDTree.hpp>
|
bool | arePointsSame (BaseVecT point1, BaseVecT point2) |
|
void | copyPoint (BaseVecT &p1, BaseVecT &p2) |
|
Node< BaseVecT > * | deleteNodeRec (Node< BaseVecT > *node, BaseVecT point, int depth) |
|
Node< BaseVecT > * | findMin (Node< BaseVecT > *node, int d) |
|
Node< BaseVecT > * | findMinRec (Node< BaseVecT > *node, int d, unsigned depth) |
|
std::pair< Index, float > | findNearestRec (Node< BaseVecT > *node, BaseVecT point, int depth, Index minDist, float minDistSq, BaseVecT currentBest) |
|
Node< BaseVecT > * | insertRec (Node< BaseVecT > *node, BaseVecT point, VertexHandle vH, unsigned int depth) |
|
Node< BaseVecT > * | minNode (Node< BaseVecT > *x, Node< BaseVecT > *y, Node< BaseVecT > *z, int d) |
|
struct Node< BaseVecT > * | newNode (BaseVecT point, VertexHandle vH) |
|
int | sizeRec (Node< BaseVecT > *node) |
|
template<typename BaseVecT>
class lvr2::DynamicKDTree< BaseVecT >
Definition at line 19 of file DynamicKDTree.hpp.
◆ DynamicKDTree()
template<typename BaseVecT >
◆ ~DynamicKDTree()
template<typename BaseVecT >
◆ arePointsSame()
template<typename BaseVecT >
◆ copyPoint()
template<typename BaseVecT >
◆ deleteNode()
template<typename BaseVecT >
◆ deleteNodeRec()
template<typename BaseVecT >
◆ findMin()
template<typename BaseVecT >
◆ findMinRec()
template<typename BaseVecT >
◆ findNearest()
template<typename BaseVecT >
◆ findNearestRec()
template<typename BaseVecT >
std::pair<Index, float> lvr2::DynamicKDTree< BaseVecT >::findNearestRec |
( |
Node< BaseVecT > * |
node, |
|
|
BaseVecT |
point, |
|
|
int |
depth, |
|
|
Index |
minDist, |
|
|
float |
minDistSq, |
|
|
BaseVecT |
currentBest |
|
) |
| |
|
private |
◆ insert()
template<typename BaseVecT >
◆ insertRec()
template<typename BaseVecT >
◆ minNode()
template<typename BaseVecT >
◆ newNode()
template<typename BaseVecT >
◆ size()
template<typename BaseVecT >
◆ sizeRec()
template<typename BaseVecT >
template<typename BaseVecT >
◆ root
template<typename BaseVecT >
The documentation for this class was generated from the following file: