libnabo  1.0.4
Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap > Member List

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

ALLOW_SELF_MATCH enum valueNabo::NearestNeighbourSearch< T >
BRUTE_FORCE enum valueNabo::NearestNeighbourSearch< T >
BRUTE_FORCE_CL enum valueNabo::NearestNeighbourSearch< T >
Buckets typedefNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >protected
bucketsNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >protected
bucketSizeNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >protected
buildNodes(const BuildPointsIt first, const BuildPointsIt last, const Vector minValues, const Vector maxValues)Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >protected
BuildPoints typedefNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >protected
BuildPointsCstIt typedefNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >protected
BuildPointsIt typedefNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >protected
checkSizesKnn(const Matrix &query, const IndexMatrix &indices, const Matrix &dists2, const Index k, const unsigned optionFlags, const Vector *maxRadii=0) const Nabo::NearestNeighbourSearch< T >protected
cloudNabo::NearestNeighbourSearch< T >
create(const Matrix &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 >static
createBruteForce(const Matrix &cloud, const Index dim=std::numeric_limits< Index >::max(), const unsigned creationOptionFlags=0)Nabo::NearestNeighbourSearch< T >static
createDimChildBucketSize(const uint32_t dim, const uint32_t childIndex) const Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >inlineprotected
createKDTreeLinearHeap(const Matrix &cloud, const Index dim=std::numeric_limits< Index >::max(), const unsigned creationOptionFlags=0, const Parameters &additionalParameters=Parameters())Nabo::NearestNeighbourSearch< T >static
createKDTreeTreeHeap(const Matrix &cloud, const Index dim=std::numeric_limits< Index >::max(), const unsigned creationOptionFlags=0, const Parameters &additionalParameters=Parameters())Nabo::NearestNeighbourSearch< T >static
CreationOptionFlags enum nameNabo::NearestNeighbourSearch< T >
creationOptionFlagsNabo::NearestNeighbourSearch< T >
dimNabo::NearestNeighbourSearch< T >
dimBitCountNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >protected
dimMaskNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >protected
getBounds(const BuildPointsIt first, const BuildPointsIt last, const unsigned dim)Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >protected
getChildBucketSize(const uint32_t dimChildBucketSize) const Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >inlineprotected
getDim(const uint32_t dimChildBucketSize) const Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >inlineprotected
Index typedef (defined in Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >)Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >
IndexMatrix typedef (defined in Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >)Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >
IndexVector typedef (defined in Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >)Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >
KDTREE_CL_PT_IN_LEAVES enum valueNabo::NearestNeighbourSearch< T >
KDTREE_CL_PT_IN_NODES enum valueNabo::NearestNeighbourSearch< T >
KDTREE_LINEAR_HEAP enum valueNabo::NearestNeighbourSearch< T >
KDTREE_TREE_HEAP enum valueNabo::NearestNeighbourSearch< T >
KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt(const Matrix &cloud, const Index dim, const unsigned creationOptionFlags, const Parameters &additionalParameters)Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >
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 >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 >virtual
Nabo::NearestNeighbourSearch::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 Nabo::NearestNeighbourSearch< T >
Matrix typedef (defined in Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >)Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >
maxBoundNabo::NearestNeighbourSearch< T >
minBoundNabo::NearestNeighbourSearch< T >
NearestNeighbourSearch(const Matrix &cloud, const Index dim, const unsigned creationOptionFlags)Nabo::NearestNeighbourSearch< T >protected
Nodes typedefNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >protected
nodesNabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >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 >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 >protected
SEARCH_TYPE_COUNT enum valueNabo::NearestNeighbourSearch< T >
SearchOptionFlags enum nameNabo::NearestNeighbourSearch< T >
SearchType enum nameNabo::NearestNeighbourSearch< T >
SORT_RESULTS enum valueNabo::NearestNeighbourSearch< T >
TOUCH_STATISTICS enum valueNabo::NearestNeighbourSearch< T >
Vector typedef (defined in Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >)Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >
~NearestNeighbourSearch()Nabo::NearestNeighbourSearch< T >inlinevirtual