Classes | Public Types | Public Member Functions | Protected Types | Protected Member Functions | Protected Attributes | List of all members
Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType > Struct Template Reference

#include <nabo_experimental.h>

Inheritance diagram for Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >:
Inheritance graph
[legend]

Classes

struct  BuildPoint
 
struct  CompareDim
 
struct  Node
 

Public Types

typedef NearestNeighbourSearch< T, CloudType >::Index Index
 
typedef NearestNeighbourSearch< T, CloudType >::IndexMatrix IndexMatrix
 
typedef NearestNeighbourSearch< T, CloudType >::IndexVector IndexVector
 
typedef NearestNeighbourSearch< T, CloudType >::Matrix Matrix
 
typedef NearestNeighbourSearch< T, CloudType >::Vector Vector
 
- Public Types inherited from Nabo::NearestNeighbourSearch< T, CloudType >
typedef CloudType CloudType
 a column-major Eigen matrix in which each column is a point; this matrix has dim rows More...
 
enum  CreationOptionFlags
 creation option More...
 
typedef int Index
 an index to a Vector or a Matrix, for refering to data points More...
 
typedef Eigen::Matrix< Index, Eigen::Dynamic, Eigen::Dynamic > IndexMatrix
 a matrix of indices to data points More...
 
typedef Eigen::Matrix< Index, Eigen::Dynamic, 1 > IndexVector
 a vector of indices to data points More...
 
typedef Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > Matrix
 a column-major Eigen matrix in which each column is a point; this matrix has dim rows More...
 
enum  SearchOptionFlags
 search option More...
 
enum  SearchType
 type of search More...
 
typedef Eigen::Matrix< T, Eigen::Dynamic, 1 > Vector
 an Eigen vector of type T, to hold the coordinates of a point More...
 

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)
 
- Public Member Functions inherited from Nabo::NearestNeighbourSearch< T, CloudType >
unsigned long knn (const Vector &query, IndexVector &indices, Vector &dists2, const Index k=1, const T epsilon=0, const unsigned optionFlags=0, const T maxRadius=std::numeric_limits< T >::infinity()) const
 Find the k nearest neighbours of query. More...
 
virtual unsigned long knn (const Matrix &query, IndexMatrix &indices, Matrix &dists2, const Index k=1, const T epsilon=0, const unsigned optionFlags=0, const T maxRadius=std::numeric_limits< T >::infinity()) const=0
 Find the k nearest neighbours for each point of query. More...
 
virtual unsigned long knn (const Matrix &query, IndexMatrix &indices, Matrix &dists2, const Vector &maxRadii, const Index k=1, const T epsilon=0, const unsigned optionFlags=0) const=0
 Find the k nearest neighbours for each point of query. More...
 
virtual ~NearestNeighbourSearch ()
 virtual destructor More...
 

Protected Types

typedef std::vector< BuildPointBuildPoints
 
typedef BuildPoints::const_iterator BuildPointsCstIt
 
typedef BuildPoints::iterator BuildPointsIt
 
typedef std::vector< NodeNodes
 

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 Member Functions inherited from Nabo::NearestNeighbourSearch< T, CloudType >
void checkSizesKnn (const Matrix &query, const IndexMatrix &indices, const Matrix &dists2, const Index k, const unsigned optionFlags, const Vector *maxRadii=0) const
 Make sure that the output matrices have the right sizes. Throw an exception otherwise. More...
 
 NearestNeighbourSearch (const CloudType &cloud, const Index dim, const unsigned creationOptionFlags)
 constructor More...
 

Protected Attributes

Nodes nodes
 

Additional Inherited Members

- Static Public Member Functions inherited from Nabo::NearestNeighbourSearch< T, CloudType >
static NearestNeighbourSearchcreate (const CloudType &cloud, const Index dim=std::numeric_limits< Index >::max(), const SearchType preferedType=KDTREE_LINEAR_HEAP, const unsigned creationOptionFlags=0, const Parameters &additionalParameters=Parameters())
 Create a nearest-neighbour search. More...
 
static NearestNeighbourSearchcreate (const WrongMatrixType &cloud, const Index dim=std::numeric_limits< Index >::max(), const SearchType preferedType=KDTREE_LINEAR_HEAP, const unsigned creationOptionFlags=0, const Parameters &additionalParameters=Parameters())
 Prevent creation of trees with the wrong matrix type. Currently only dynamic size matrices are supported. More...
 
static NearestNeighbourSearchcreateBruteForce (const CloudType &cloud, const Index dim=std::numeric_limits< Index >::max(), const unsigned creationOptionFlags=0)
 Create a nearest-neighbour search, using brute-force search, useful for comparison only. More...
 
static NearestNeighbourSearchcreateBruteForce (const WrongMatrixType &cloud, const Index dim=std::numeric_limits< Index >::max(), const unsigned creationOptionFlags=0)
 Prevent creation of trees with the wrong matrix type. Currently only dynamic size matrices are supported. More...
 
static NearestNeighbourSearchcreateKDTreeLinearHeap (const CloudType &cloud, const Index dim=std::numeric_limits< Index >::max(), const unsigned creationOptionFlags=0, const Parameters &additionalParameters=Parameters())
 Create a nearest-neighbour search, using a kd-tree with linear heap, good for small k (~up to 30) More...
 
static NearestNeighbourSearchcreateKDTreeLinearHeap (const WrongMatrixType &cloud, const Index dim=std::numeric_limits< Index >::max(), const unsigned creationOptionFlags=0, const Parameters &additionalParameters=Parameters())
 Prevent creation of trees with the wrong matrix type. Currently only dynamic size matrices are supported. More...
 
static NearestNeighbourSearchcreateKDTreeTreeHeap (const CloudType &cloud, const Index dim=std::numeric_limits< Index >::max(), const unsigned creationOptionFlags=0, const Parameters &additionalParameters=Parameters())
 Create a nearest-neighbour search, using a kd-tree with tree heap, good for large k (~from 30) More...
 
static NearestNeighbourSearchcreateKDTreeTreeHeap (const WrongMatrixType &, const Index dim=std::numeric_limits< Index >::max(), const unsigned creationOptionFlags=0, const Parameters &additionalParameters=Parameters())
 Prevent creation of trees with the wrong matrix type. Currently only dynamic size matrices are supported. More...
 
- Public Attributes inherited from Nabo::NearestNeighbourSearch< T, CloudType >
const CloudTypecloud
 the reference to the data-point cloud, which must remain valid during the lifetime of the NearestNeighbourSearch object More...
 
const unsigned creationOptionFlags
 creation options More...
 
const Index dim
 the dimensionality of the data-point cloud More...
 
const Vector maxBound
 the high bound of the search space (axis-aligned bounding box) More...
 
const Vector minBound
 the low bound of the search space (axis-aligned bounding box) More...
 
- Static Public Attributes inherited from Nabo::NearestNeighbourSearch< T, CloudType >
static constexpr Index InvalidIndex
 the invalid index More...
 
static constexpr T InvalidValue
 the invalid value More...
 

Detailed Description

template<typename T, typename Heap, typename CloudType>
struct Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >

Definition at line 208 of file nabo_experimental.h.

Member Typedef Documentation

◆ BuildPoints

template<typename T, typename Heap, typename CloudType>
typedef std::vector<BuildPoint> Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::BuildPoints
protected

Definition at line 228 of file nabo_experimental.h.

◆ BuildPointsCstIt

template<typename T, typename Heap, typename CloudType>
typedef BuildPoints::const_iterator Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::BuildPointsCstIt
protected

Definition at line 230 of file nabo_experimental.h.

◆ BuildPointsIt

template<typename T, typename Heap, typename CloudType>
typedef BuildPoints::iterator Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::BuildPointsIt
protected

Definition at line 229 of file nabo_experimental.h.

◆ Index

template<typename T, typename Heap, typename CloudType>
typedef NearestNeighbourSearch<T, CloudType>::Index Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::Index

Definition at line 212 of file nabo_experimental.h.

◆ IndexMatrix

template<typename T, typename Heap, typename CloudType>
typedef NearestNeighbourSearch<T, CloudType>::IndexMatrix Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::IndexMatrix

Definition at line 214 of file nabo_experimental.h.

◆ IndexVector

template<typename T, typename Heap, typename CloudType>
typedef NearestNeighbourSearch<T, CloudType>::IndexVector Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::IndexVector

Definition at line 213 of file nabo_experimental.h.

◆ Matrix

template<typename T, typename Heap, typename CloudType>
typedef NearestNeighbourSearch<T, CloudType>::Matrix Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::Matrix

Definition at line 211 of file nabo_experimental.h.

◆ Nodes

template<typename T, typename Heap, typename CloudType>
typedef std::vector<Node> Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::Nodes
protected

Definition at line 259 of file nabo_experimental.h.

◆ Vector

template<typename T, typename Heap, typename CloudType>
typedef NearestNeighbourSearch<T, CloudType>::Vector Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::Vector

Definition at line 210 of file nabo_experimental.h.

Constructor & Destructor Documentation

◆ KDTreeUnbalancedPtInLeavesImplicitBoundsStack()

template<typename T , typename Heap , typename CloudType>
Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::KDTreeUnbalancedPtInLeavesImplicitBoundsStack ( const CloudType cloud)

Definition at line 612 of file experimental/kdtree_cpu.cpp.

Member Function Documentation

◆ buildNodes()

template<typename T , typename Heap , typename CloudType >
unsigned Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::buildNodes ( const BuildPointsIt  first,
const BuildPointsIt  last,
const Vector  minValues,
const Vector  maxValues 
)
protected

Definition at line 550 of file experimental/kdtree_cpu.cpp.

◆ knn()

template<typename T, typename Heap , typename CloudType >
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 634 of file experimental/kdtree_cpu.cpp.

◆ knnM()

template<typename T, typename Heap , typename CloudType >
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 655 of file experimental/kdtree_cpu.cpp.

◆ recurseKnn()

template<typename T, typename Heap, typename CloudType >
void Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::recurseKnn ( const Vector query,
const unsigned  n,
rd,
Heap &  heap,
Vector off,
const T  maxError,
const bool  allowSelfMatch 
)
protected

Definition at line 690 of file experimental/kdtree_cpu.cpp.

Member Data Documentation

◆ nodes

template<typename T, typename Heap, typename CloudType>
Nodes Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStack< T, Heap, CloudType >::nodes
protected

Definition at line 261 of file nabo_experimental.h.


The documentation for this struct was generated from the following files:


libnabo
Author(s): Stéphane Magnenat
autogenerated on Mon Feb 28 2022 22:41:38