Nabo::KDTreeBalancedPtInNodesStackOpenCL< T > Member List

This is the complete list of members for Nabo::KDTreeBalancedPtInNodesStackOpenCL< T >, including all inherited members.
ALLOW_SELF_MATCH enum valueNabo::NearestNeighbourSearch< T >
BRUTE_FORCE enum valueNabo::NearestNeighbourSearch< T >
BRUTE_FORCE_CL enum valueNabo::NearestNeighbourSearch< T >
buildNodes(const BuildPointsIt first, const BuildPointsIt last, const size_t pos, const Vector minValues, const Vector maxValues)Nabo::KDTreeBalancedPtInNodesStackOpenCL< T > [inline, protected]
BuildPoint typedefNabo::KDTreeBalancedPtInNodesStackOpenCL< T > [protected]
BuildPoints typedefNabo::KDTreeBalancedPtInNodesStackOpenCL< T > [protected]
BuildPointsCstIt typedefNabo::KDTreeBalancedPtInNodesStackOpenCL< T > [protected]
BuildPointsIt typedefNabo::KDTreeBalancedPtInNodesStackOpenCL< T > [protected]
checkSizesKnn(const Matrix &query, const IndexMatrix &indices, const Matrix &dists2, const Index k, const Vector *maxRadii=0) const Nabo::NearestNeighbourSearch< T > [inline, protected]
childLeft(size_t pos) const Nabo::KDTreeBalancedPtInNodesStackOpenCL< T > [inline, protected]
childRight(size_t pos) const Nabo::KDTreeBalancedPtInNodesStackOpenCL< T > [inline, protected]
cloudNabo::NearestNeighbourSearch< T >
cloudCLNabo::OpenCLSearch< T > [protected]
contextNabo::OpenCLSearch< T > [protected]
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 > [inline, static]
createBruteForce(const Matrix &cloud, const Index dim=std::numeric_limits< Index >::max(), const unsigned creationOptionFlags=0)Nabo::NearestNeighbourSearch< T > [inline, static]
createKDTreeLinearHeap(const Matrix &cloud, const Index dim=std::numeric_limits< Index >::max(), const unsigned creationOptionFlags=0, const Parameters &additionalParameters=Parameters())Nabo::NearestNeighbourSearch< T > [inline, static]
createKDTreeTreeHeap(const Matrix &cloud, const Index dim=std::numeric_limits< Index >::max(), const unsigned creationOptionFlags=0, const Parameters &additionalParameters=Parameters())Nabo::NearestNeighbourSearch< T > [inline, static]
creationOptionFlagsNabo::NearestNeighbourSearch< T >
CreationOptionFlags enum nameNabo::NearestNeighbourSearch< T >
deviceTypeNabo::OpenCLSearch< T > [protected]
dimNabo::NearestNeighbourSearch< T >
getTreeDepth(size_t size) const Nabo::KDTreeBalancedPtInNodesStackOpenCL< T > [inline, protected]
getTreeSize(size_t size) const Nabo::KDTreeBalancedPtInNodesStackOpenCL< T > [inline, protected]
Index typedefNabo::KDTreeBalancedPtInNodesStackOpenCL< T >
IndexMatrix typedefNabo::KDTreeBalancedPtInNodesStackOpenCL< T >
IndexVector typedefNabo::KDTreeBalancedPtInNodesStackOpenCL< T >
initOpenCL(const char *clFileName, const char *kernelName, const std::string &additionalDefines="")Nabo::OpenCLSearch< T > [inline, protected]
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 >
KDTreeBalancedPtInNodesStackOpenCL(const Matrix &cloud, const Index dim, const unsigned creationOptionFlags, const cl_device_type deviceType)Nabo::KDTreeBalancedPtInNodesStackOpenCL< T > [inline]
knn(const Matrix &query, IndexMatrix &indices, Matrix &dists2, const Index k, const T epsilon, const unsigned optionFlags, const T maxRadius) const Nabo::OpenCLSearch< T > [inline, 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 > [inline]
Nabo::NearestNeighbourSearch::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 > [pure virtual]
knnKernelNabo::OpenCLSearch< T > [mutable, protected]
Matrix typedefNabo::KDTreeBalancedPtInNodesStackOpenCL< T >
maxBoundNabo::NearestNeighbourSearch< T >
minBoundNabo::NearestNeighbourSearch< T >
NearestNeighbourSearch(const Matrix &cloud, const Index dim, const unsigned creationOptionFlags)Nabo::NearestNeighbourSearch< T > [inline, protected]
Nodes typedefNabo::KDTreeBalancedPtInNodesStackOpenCL< T > [protected]
nodesNabo::KDTreeBalancedPtInNodesStackOpenCL< T > [protected]
nodesCLNabo::KDTreeBalancedPtInNodesStackOpenCL< T > [protected]
OpenCLSearch(const Matrix &cloud, const Index dim, const unsigned creationOptionFlags, const cl_device_type deviceType)Nabo::OpenCLSearch< T > [inline, protected]
parent(size_t pos) const Nabo::KDTreeBalancedPtInNodesStackOpenCL< T > [inline, protected]
queueNabo::OpenCLSearch< T > [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 typedefNabo::KDTreeBalancedPtInNodesStackOpenCL< T >
~NearestNeighbourSearch()Nabo::NearestNeighbourSearch< T > [inline, virtual]
Generated on Fri May 3 12:48:10 2013 for libnabo by  doxygen 1.6.3