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::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::KDTreeBalancedPtInNodesStackOpenCL< T > |
KDTree, balanced, points in nodes, stack, implicit bounds, balance aspect ratio. More... | |
Files | |
file | brute_force_cpu.cpp |
brute force search, cpu implementation | |
file | index_heap.h |
implementation of index heaps | |
file | kdtree_cpu.cpp |
kd-tree search, cpu implementation | |
file | kdtree_opencl.cpp |
file | nabo.cpp |
implementation of public interface | |
file | nabo_private.h |
header for implementation | |
Functions | |
template<typename T , typename A , typename B > | |
T | Nabo::dist2 (const A &v0, const B &v1) |
Euclidean distance. | |
| |
#define | MAX_K 32 |
#define MAX_K 32 |
Maximum number of points acceptable in a query