, including all inherited members.
| ALLOW_SELF_MATCH enum value | Nabo::NearestNeighbourSearch< T > | |
| BRUTE_FORCE enum value | Nabo::NearestNeighbourSearch< T > | |
| BRUTE_FORCE_CL enum value | Nabo::NearestNeighbourSearch< T > | |
| Buckets typedef | Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap > | [protected] |
| buckets | Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap > | [protected] |
| bucketSize | Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap > | [protected] |
| buildNodes(const BuildPointsIt first, const BuildPointsIt last, const Vector minValues, const Vector maxValues) | Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap > | [protected] |
| BuildPoints typedef | Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap > | [protected] |
| BuildPointsCstIt typedef | Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap > | [protected] |
| BuildPointsIt typedef | Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap > | [protected] |
| checkSizesKnn(const Matrix &query, const IndexMatrix &indices, const Matrix &dists2, const Index k, const Vector *maxRadii=0) const | Nabo::NearestNeighbourSearch< T > | [protected] |
| cloud | Nabo::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 > | [inline, protected] |
| 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 name | Nabo::NearestNeighbourSearch< T > | |
| creationOptionFlags | Nabo::NearestNeighbourSearch< T > | |
| dim | Nabo::NearestNeighbourSearch< T > | |
| dimBitCount | Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap > | [protected] |
| dimMask | Nabo::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 > | [inline, protected] |
| getDim(const uint32_t dimChildBucketSize) const | Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap > | [inline, protected] |
| Index typedef | Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap > | |
| IndexMatrix typedef | Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap > | |
| IndexVector typedef | Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap > | |
| KDTREE_CL_PT_IN_LEAVES enum value | Nabo::NearestNeighbourSearch< T > | |
| KDTREE_CL_PT_IN_NODES enum value | Nabo::NearestNeighbourSearch< T > | |
| KDTREE_LINEAR_HEAP enum value | Nabo::NearestNeighbourSearch< T > | |
| KDTREE_TREE_HEAP enum value | Nabo::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 | Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap > | |
| maxBound | Nabo::NearestNeighbourSearch< T > | |
| minBound | Nabo::NearestNeighbourSearch< T > | |
| NearestNeighbourSearch(const Matrix &cloud, const Index dim, const unsigned creationOptionFlags) | Nabo::NearestNeighbourSearch< T > | [protected] |
| Nodes typedef | Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap > | [protected] |
| nodes | Nabo::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 value | Nabo::NearestNeighbourSearch< T > | |
| SearchOptionFlags enum name | Nabo::NearestNeighbourSearch< T > | |
| SearchType enum name | Nabo::NearestNeighbourSearch< T > | |
| SORT_RESULTS enum value | Nabo::NearestNeighbourSearch< T > | |
| TOUCH_STATISTICS enum value | Nabo::NearestNeighbourSearch< T > | |
| Vector typedef | Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap > | |
| ~NearestNeighbourSearch() | Nabo::NearestNeighbourSearch< T > | [inline, virtual] |