header for implementation More...
#include "nabo.h"#include <stdint.h>#include "CL/cl.hpp"Go to the source code of this file.
Classes | |
| struct | Nabo::BruteForceSearch< T > |
| Brute-force nearest neighbour. More... | |
| struct | Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap > |
| KDTree, unbalanced, points in leaves, stack, implicit bounds, ANN_KD_SL_MIDPT, optimised implementation. More... | |
| struct | Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >::Node |
| search node More... | |
| struct | Nabo::KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt< T, Heap >::BucketEntry |
| entry in a bucket More... | |
| struct | Nabo::OpenCLSearch< T > |
| OpenCL support for nearest neighbour search. More... | |
| struct | Nabo::BruteForceSearchOpenCL< T > |
| KDTree, balanced, points in leaves, stack, implicit bounds, balance aspect ratio. More... | |
| struct | Nabo::KDTreeBalancedPtInLeavesStackOpenCL< T > |
| KDTree, balanced, points in leaves, stack, implicit bounds, balance aspect ratio. More... | |
| struct | Nabo::KDTreeBalancedPtInLeavesStackOpenCL< T >::BuildPoint |
| Point during kd-tree construction. More... | |
| struct | Nabo::KDTreeBalancedPtInLeavesStackOpenCL< T >::CompareDim |
| Functor to compare point values on a given dimension. More... | |
| struct | Nabo::KDTreeBalancedPtInLeavesStackOpenCL< T >::Node |
| Tree node for CL. More... | |
| struct | Nabo::KDTreeBalancedPtInNodesStackOpenCL< T > |
| KDTree, balanced, points in nodes, stack, implicit bounds, balance aspect ratio. More... | |
| struct | Nabo::KDTreeBalancedPtInNodesStackOpenCL< T >::CompareDim |
| Functor to compare point values on a given dimension. More... | |
| struct | Nabo::KDTreeBalancedPtInNodesStackOpenCL< T >::Node |
| Tree node for CL. More... | |
Namespaces | |
| namespace | Nabo |
Namespace for Nabo. | |
Functions | |
| template<typename T , typename A , typename B > | |
| T | Nabo::dist2 (const A &v0, const B &v1) |
| Euclidean distance. | |
header for implementation
1.6.3