Nabo::KDTreeBalancedPtInNodes< T, CloudType > Member List

This is the complete list of members for Nabo::KDTreeBalancedPtInNodes< T, CloudType >, including all inherited members.

ALLOW_SELF_MATCH enum valueNabo::NearestNeighbourSearch< T, CloudType >
BRUTE_FORCE enum valueNabo::NearestNeighbourSearch< T, CloudType >
BRUTE_FORCE_CL enum valueNabo::NearestNeighbourSearch< T, CloudType >
buildNodes(const BuildPointsIt first, const BuildPointsIt last, const size_t pos)Nabo::KDTreeBalancedPtInNodes< T, CloudType >protected
BuildPoints typedefNabo::KDTreeBalancedPtInNodes< T, CloudType >protected
BuildPointsCstIt typedefNabo::KDTreeBalancedPtInNodes< T, CloudType >protected
BuildPointsIt typedefNabo::KDTreeBalancedPtInNodes< T, CloudType >protected
checkSizesKnn(const Matrix &query, const IndexMatrix &indices, const Matrix &dists2, const Index k, const unsigned optionFlags, const Vector *maxRadii=0) constNabo::NearestNeighbourSearch< T, CloudType >protected
childLeft(size_t pos) constNabo::KDTreeBalancedPtInNodes< T, CloudType >inlineprotected
childRight(size_t pos) constNabo::KDTreeBalancedPtInNodes< T, CloudType >inlineprotected
cloudNabo::NearestNeighbourSearch< T, CloudType >
cloudIndexesFromNodesIndexes(const IndexVector &indexes) constNabo::KDTreeBalancedPtInNodes< T, CloudType >protected
CloudType typedefNabo::NearestNeighbourSearch< T, CloudType >
create(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())Nabo::NearestNeighbourSearch< T, CloudType >static
create(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())Nabo::NearestNeighbourSearch< T, CloudType >inlinestatic
createBruteForce(const CloudType &cloud, const Index dim=std::numeric_limits< Index >::max(), const unsigned creationOptionFlags=0)Nabo::NearestNeighbourSearch< T, CloudType >static
createBruteForce(const WrongMatrixType &cloud, const Index dim=std::numeric_limits< Index >::max(), const unsigned creationOptionFlags=0)Nabo::NearestNeighbourSearch< T, CloudType >inlinestatic
createKDTreeLinearHeap(const CloudType &cloud, const Index dim=std::numeric_limits< Index >::max(), const unsigned creationOptionFlags=0, const Parameters &additionalParameters=Parameters())Nabo::NearestNeighbourSearch< T, CloudType >static
createKDTreeLinearHeap(const WrongMatrixType &cloud, const Index dim=std::numeric_limits< Index >::max(), const unsigned creationOptionFlags=0, const Parameters &additionalParameters=Parameters())Nabo::NearestNeighbourSearch< T, CloudType >inlinestatic
createKDTreeTreeHeap(const CloudType &cloud, const Index dim=std::numeric_limits< Index >::max(), const unsigned creationOptionFlags=0, const Parameters &additionalParameters=Parameters())Nabo::NearestNeighbourSearch< T, CloudType >static
createKDTreeTreeHeap(const WrongMatrixType &, const Index dim=std::numeric_limits< Index >::max(), const unsigned creationOptionFlags=0, const Parameters &additionalParameters=Parameters())Nabo::NearestNeighbourSearch< T, CloudType >inlinestatic
CreationOptionFlags enum nameNabo::NearestNeighbourSearch< T, CloudType >
creationOptionFlagsNabo::NearestNeighbourSearch< T, CloudType >
dimNabo::NearestNeighbourSearch< T, CloudType >
dump(const Vector minValues, const Vector maxValues, const size_t pos) constNabo::KDTreeBalancedPtInNodes< T, CloudType >protected
getTreeSize(size_t size) constNabo::KDTreeBalancedPtInNodes< T, CloudType >protected
Index typedefNabo::KDTreeBalancedPtInNodes< T, CloudType >
IndexMatrix typedefNabo::NearestNeighbourSearch< T, CloudType >
IndexVector typedefNabo::KDTreeBalancedPtInNodes< T, CloudType >
InvalidIndexNabo::NearestNeighbourSearch< T, CloudType >static
InvalidValueNabo::NearestNeighbourSearch< T, CloudType >static
KDTREE_CL_PT_IN_LEAVES enum valueNabo::NearestNeighbourSearch< T, CloudType >
KDTREE_CL_PT_IN_NODES enum valueNabo::NearestNeighbourSearch< T, CloudType >
KDTREE_LINEAR_HEAP enum valueNabo::NearestNeighbourSearch< T, CloudType >
KDTREE_TREE_HEAP enum valueNabo::NearestNeighbourSearch< T, CloudType >
KDTreeBalancedPtInNodes(const CloudType &cloud)Nabo::KDTreeBalancedPtInNodes< T, CloudType >protected
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()) constNabo::NearestNeighbourSearch< T, CloudType >
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=0Nabo::NearestNeighbourSearch< T, CloudType >pure virtual
knn(const Matrix &query, IndexMatrix &indices, Matrix &dists2, const Vector &maxRadii, const Index k=1, const T epsilon=0, const unsigned optionFlags=0) const=0Nabo::NearestNeighbourSearch< T, CloudType >pure virtual
Matrix typedefNabo::KDTreeBalancedPtInNodes< T, CloudType >
maxBoundNabo::NearestNeighbourSearch< T, CloudType >
minBoundNabo::NearestNeighbourSearch< T, CloudType >
NearestNeighbourSearch(const CloudType &cloud, const Index dim, const unsigned creationOptionFlags)Nabo::NearestNeighbourSearch< T, CloudType >protected
Nodes typedefNabo::KDTreeBalancedPtInNodes< T, CloudType >protected
nodesNabo::KDTreeBalancedPtInNodes< T, CloudType >protected
parent(size_t pos) constNabo::KDTreeBalancedPtInNodes< T, CloudType >inlineprotected
SEARCH_TYPE_COUNT enum valueNabo::NearestNeighbourSearch< T, CloudType >
SearchOptionFlags enum nameNabo::NearestNeighbourSearch< T, CloudType >
SearchType enum nameNabo::NearestNeighbourSearch< T, CloudType >
SORT_RESULTS enum valueNabo::NearestNeighbourSearch< T, CloudType >
TOUCH_STATISTICS enum valueNabo::NearestNeighbourSearch< T, CloudType >
Vector typedefNabo::KDTreeBalancedPtInNodes< T, CloudType >
~NearestNeighbourSearch()Nabo::NearestNeighbourSearch< T, CloudType >inlinevirtual


libnabo
Author(s): Stéphane Magnenat
autogenerated on Fri Aug 2 2024 08:39:11