Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType > Member List
This is the complete list of members for Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, 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 >
Buckets typedefNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType > [protected]
bucketsNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType > [protected]
bucketSizeNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType > [protected]
buildNodes(const BuildPointsIt first, const BuildPointsIt last, const Vector minValues, const Vector maxValues)Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType > [protected]
BuildPoints typedefNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType > [protected]
BuildPointsCstIt typedefNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType > [protected]
BuildPointsIt typedefNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, 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]
cloudNabo::NearestNeighbourSearch< T, CloudType >
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 > [inline, static]
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 > [inline, static]
createDimChildBucketSize(const uint32_t dim, const uint32_t childIndex) const Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType > [inline, protected]
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 > [inline, static]
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 > [inline, static]
CreationOptionFlags enum nameNabo::NearestNeighbourSearch< T, CloudType >
creationOptionFlagsNabo::NearestNeighbourSearch< T, CloudType >
dimNabo::NearestNeighbourSearch< T, CloudType >
dimBitCountNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType > [protected]
dimMaskNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType > [protected]
getBounds(const BuildPointsIt first, const BuildPointsIt last, const unsigned dim)Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType > [protected]
getChildBucketSize(const uint32_t dimChildBucketSize) const Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType > [inline, protected]
getDim(const uint32_t dimChildBucketSize) const Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType > [inline, protected]
Index typedefNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >
IndexMatrix typedefNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >
IndexVector typedefNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >
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 >
KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt(const CloudType &cloud, const Index dim, const unsigned creationOptionFlags, const Parameters &additionalParameters)Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >
knn(const Matrix &query, IndexMatrix &indices, Matrix &dists2, const Index k, const T epsilon, const unsigned optionFlags, const T maxRadius) const Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType > [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 Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType > [virtual]
NearestNeighbourSearch< T, CloudType >::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 >
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]
NearestNeighbourSearch< T, CloudType >::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::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, 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::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType > [protected]
nodesNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType > [protected]
onePointKnn(const Matrix &query, IndexMatrix &indices, Matrix &dists2, int i, Heap &heap, std::vector< T > &off, const T maxError, const T maxRadius2, const bool allowSelfMatch, const bool collectStatistics, const bool sortResults) const Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType > [protected]
recurseKnn(const T *query, const unsigned n, T rd, Heap &heap, std::vector< T > &off, const T maxError, const T maxRadius2) const Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType > [protected]
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::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap, CloudType >
~NearestNeighbourSearch()Nabo::NearestNeighbourSearch< T, CloudType > [inline, virtual]


libnabo
Author(s): Stéphane Magnenat
autogenerated on Thu Sep 10 2015 10:54:55