libnabo: Class Members

Here is a list of all class members with links to the classes they belong to:

- a -

ALLOW_SELF_MATCH : Nabo::NearestNeighbourSearch< T >

- b -

BRUTE_FORCE : Nabo::NearestNeighbourSearch< T >
BRUTE_FORCE_CL : Nabo::NearestNeighbourSearch< T >
BruteForceSearch() : Nabo::BruteForceSearch< T >
BucketEntry() : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >::BucketEntry
bucketIndex : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >::Node
Buckets : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >
buckets : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >
bucketSize : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >
buildNodes() : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >
BuildPoints : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >
BuildPointsCstIt : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >
BuildPointsIt : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >

- c -

checkSizesKnn() : Nabo::NearestNeighbourSearch< T >
cloud : Nabo::NearestNeighbourSearch< T >
create() : Nabo::NearestNeighbourSearch< T >
createBruteForce() : Nabo::NearestNeighbourSearch< T >
createDimChildBucketSize() : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >
createKDTreeLinearHeap() : Nabo::NearestNeighbourSearch< T >
createKDTreeTreeHeap() : Nabo::NearestNeighbourSearch< T >
CreationOptionFlags : Nabo::NearestNeighbourSearch< T >
creationOptionFlags : Nabo::NearestNeighbourSearch< T >
cutVal : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >::Node

- d -

data : Nabo::IndexHeapSTL< IT, VT > , Nabo::IndexHeapBruteForceVector< IT, VT >
dim : Nabo::NearestNeighbourSearch< T >
dimBitCount : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >
dimChildBucketSize : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >::Node
dimMask : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >

- e -

Entries : Nabo::IndexHeapSTL< IT, VT > , Nabo::IndexHeapBruteForceVector< IT, VT >
Entry() : Nabo::IndexHeapSTL< IT, VT >::Entry , Nabo::IndexHeapBruteForceVector< IT, VT >::Entry

- g -

get() : Nabo::Parameters
getBounds() : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >
getChildBucketSize() : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >
getData() : Nabo::IndexHeapSTL< IT, VT > , Nabo::IndexHeapBruteForceVector< IT, VT >
getDim() : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >

- h -

headValue() : Nabo::IndexHeapSTL< IT, VT > , Nabo::IndexHeapBruteForceVector< IT, VT >
headValueRef : Nabo::IndexHeapBruteForceVector< IT, VT >

- i -

Index : Nabo::IndexHeapSTL< IT, VT > , Nabo::IndexHeapBruteForceVector< IT, VT > , Nabo::BruteForceSearch< T >
index : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >::BucketEntry
Index : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap > , Nabo::NearestNeighbourSearch< T >
index : Nabo::IndexHeapSTL< IT, VT >::Entry , Nabo::IndexHeapBruteForceVector< IT, VT >::Entry
IndexHeapBruteForceVector() : Nabo::IndexHeapBruteForceVector< IT, VT >
IndexHeapSTL() : Nabo::IndexHeapSTL< IT, VT >
IndexMatrix : Nabo::NearestNeighbourSearch< T > , Nabo::BruteForceSearch< T > , Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >
IndexVector : Nabo::IndexHeapSTL< IT, VT > , Nabo::NearestNeighbourSearch< T > , Nabo::IndexHeapBruteForceVector< IT, VT > , Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap > , Nabo::BruteForceSearch< T >

- k -

KDTREE_CL_PT_IN_LEAVES : Nabo::NearestNeighbourSearch< T >
KDTREE_CL_PT_IN_NODES : Nabo::NearestNeighbourSearch< T >
KDTREE_LINEAR_HEAP : Nabo::NearestNeighbourSearch< T >
KDTREE_TREE_HEAP : Nabo::NearestNeighbourSearch< T >
KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt() : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >
knn() : Nabo::NearestNeighbourSearch< T > , Nabo::BruteForceSearch< T > , Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap > , Nabo::BruteForceSearch< T >

- m -

Matrix : Nabo::NearestNeighbourSearch< T > , Nabo::BruteForceSearch< T > , Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >
maxBound : Nabo::NearestNeighbourSearch< T >
minBound : Nabo::NearestNeighbourSearch< T >

- n -

nbNeighbours : Nabo::IndexHeapSTL< IT, VT >
NearestNeighbourSearch() : Nabo::NearestNeighbourSearch< T >
Node() : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >::Node
nodes : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >
Nodes : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >

- o -

onePointKnn() : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >
operator< : Nabo::IndexHeapBruteForceVector< IT, VT >::Entry , Nabo::IndexHeapSTL< IT, VT >::Entry

- p -

Parameters() : Nabo::Parameters
pt : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >::BucketEntry

- r -

recurseKnn() : Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >
replaceHead() : Nabo::IndexHeapSTL< IT, VT > , Nabo::IndexHeapBruteForceVector< IT, VT >
reset() : Nabo::IndexHeapSTL< IT, VT > , Nabo::IndexHeapBruteForceVector< IT, VT >

- s -

SEARCH_TYPE_COUNT : Nabo::NearestNeighbourSearch< T >
SearchOptionFlags : Nabo::NearestNeighbourSearch< T >
SearchType : Nabo::NearestNeighbourSearch< T >
sizeMinusOne : Nabo::IndexHeapBruteForceVector< IT, VT >
sort() : Nabo::IndexHeapSTL< IT, VT > , Nabo::IndexHeapBruteForceVector< IT, VT >
SORT_RESULTS : Nabo::NearestNeighbourSearch< T >

- t -

TOUCH_STATISTICS : Nabo::NearestNeighbourSearch< T >

- v -

- ~ -

~NearestNeighbourSearch() : Nabo::NearestNeighbourSearch< T >

libnabo
Author(s): Stéphane Magnenat
autogenerated on Mon Oct 6 2014 10:27:28