#include <nabo_experimental.h>

Classes | |
| struct | BuildPoint |
| struct | CompareDim |
| struct | Node |
Public Types | |
| typedef NearestNeighbourSearch < T, CloudType >::Index | Index |
| an index to a Vector or a Matrix, for refering to data points | |
| typedef NearestNeighbourSearch < T, CloudType >::IndexMatrix | IndexMatrix |
| a matrix of indices to data points | |
| typedef NearestNeighbourSearch < T, CloudType >::IndexVector | IndexVector |
| a vector of indices to data points | |
| typedef NearestNeighbourSearch < T, CloudType >::Matrix | Matrix |
| a column-major Eigen matrix in which each column is a point; this matrix has dim rows | |
| typedef NearestNeighbourSearch < T, CloudType >::Vector | Vector |
| an Eigen vector of type T, to hold the coordinates of a point | |
Public Member Functions | |
| KDTreeUnbalancedPtInLeavesImplicitBoundsStack (const CloudType &cloud) | |
| virtual IndexVector | knn (const Vector &query, const Index k, const T epsilon, const unsigned optionFlags) |
| virtual IndexMatrix | knnM (const Matrix &query, const Index k, const T epsilon, const unsigned optionFlags) |
Protected Types | |
| typedef std::vector< BuildPoint > | BuildPoints |
| typedef BuildPoints::const_iterator | BuildPointsCstIt |
| typedef BuildPoints::iterator | BuildPointsIt |
| typedef std::vector< Node > | Nodes |
Protected Member Functions | |
| unsigned | buildNodes (const BuildPointsIt first, const BuildPointsIt last, const Vector minValues, const Vector maxValues) |
| void | recurseKnn (const Vector &query, const unsigned n, T rd, Heap &heap, Vector &off, const T maxError, const bool allowSelfMatch) |
Protected Attributes | |
| Nodes | nodes |
Definition at line 208 of file nabo_experimental.h.
typedef std::vector<BuildPoint> Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::BuildPoints [protected] |
Definition at line 228 of file nabo_experimental.h.
typedef BuildPoints::const_iterator Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::BuildPointsCstIt [protected] |
Definition at line 230 of file nabo_experimental.h.
typedef BuildPoints::iterator Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::BuildPointsIt [protected] |
Definition at line 229 of file nabo_experimental.h.
| typedef NearestNeighbourSearch<T, CloudType>::Index Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::Index |
an index to a Vector or a Matrix, for refering to data points
Reimplemented from Nabo::NearestNeighbourSearch< T, CloudType >.
Definition at line 212 of file nabo_experimental.h.
| typedef NearestNeighbourSearch<T, CloudType>::IndexMatrix Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::IndexMatrix |
a matrix of indices to data points
Reimplemented from Nabo::NearestNeighbourSearch< T, CloudType >.
Definition at line 214 of file nabo_experimental.h.
| typedef NearestNeighbourSearch<T, CloudType>::IndexVector Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::IndexVector |
a vector of indices to data points
Reimplemented from Nabo::NearestNeighbourSearch< T, CloudType >.
Definition at line 213 of file nabo_experimental.h.
| typedef NearestNeighbourSearch<T, CloudType>::Matrix Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::Matrix |
a column-major Eigen matrix in which each column is a point; this matrix has dim rows
Reimplemented from Nabo::NearestNeighbourSearch< T, CloudType >.
Definition at line 211 of file nabo_experimental.h.
typedef std::vector<Node> Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::Nodes [protected] |
Definition at line 259 of file nabo_experimental.h.
| typedef NearestNeighbourSearch<T, CloudType>::Vector Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::Vector |
an Eigen vector of type T, to hold the coordinates of a point
Reimplemented from Nabo::NearestNeighbourSearch< T, CloudType >.
Definition at line 210 of file nabo_experimental.h.
| Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::KDTreeUnbalancedPtInLeavesImplicitBoundsStack | ( | const CloudType & | cloud | ) |
Definition at line 614 of file experimental/kdtree_cpu.cpp.
| unsigned Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::buildNodes | ( | const BuildPointsIt | first, |
| const BuildPointsIt | last, | ||
| const Vector | minValues, | ||
| const Vector | maxValues | ||
| ) | [protected] |
Definition at line 552 of file experimental/kdtree_cpu.cpp.
| KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::IndexVector Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::knn | ( | const Vector & | query, |
| const Index | k, | ||
| const T | epsilon, | ||
| const unsigned | optionFlags | ||
| ) | [virtual] |
Definition at line 636 of file experimental/kdtree_cpu.cpp.
| KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::IndexMatrix Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::knnM | ( | const Matrix & | query, |
| const Index | k, | ||
| const T | epsilon, | ||
| const unsigned | optionFlags | ||
| ) | [virtual] |
Definition at line 657 of file experimental/kdtree_cpu.cpp.
| void Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::recurseKnn | ( | const Vector & | query, |
| const unsigned | n, | ||
| T | rd, | ||
| Heap & | heap, | ||
| Vector & | off, | ||
| const T | maxError, | ||
| const bool | allowSelfMatch | ||
| ) | [protected] |
Definition at line 692 of file experimental/kdtree_cpu.cpp.
Nodes Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::nodes [protected] |
Definition at line 261 of file nabo_experimental.h.