Namespace for Nabo. More...

Classes
struct	BruteForceSearch
	Brute-force nearest neighbour. More...
struct	IndexHeapBruteForceVector
	brute-force implementation of heap More...
struct	IndexHeapSTL
	balanced-tree implementation of heap More...
struct	KDTreeBalancedPtInLeavesStack
struct	KDTreeBalancedPtInNodes
struct	KDTreeBalancedPtInNodesPQ
struct	KDTreeBalancedPtInNodesStack
struct	KDTreeUnbalancedPtInLeavesExplicitBoundsStack
struct	KDTreeUnbalancedPtInLeavesImplicitBoundsStack
struct	KDTreeUnbalancedPtInLeavesImplicitBoundsStackOpt
	KDTree, unbalanced, points in leaves, stack, implicit bounds, ANN_KD_SL_MIDPT, optimised implementation. More...
struct	NearestNeighbourSearch
	Nearest neighbour search interface, templatized on scalar type. More...
struct	Parameters
	Parameter vector. More...
Typedefs
typedef NearestNeighbourSearch < double >	NNSearchD
	nearest neighbour search with scalars of type double
typedef NearestNeighbourSearch < float >	NNSearchF
	nearest neighbour search with scalars of type float
Functions
template<typename T , typename A , typename B >
T	dist2 (const A &v0, const B &v1)
	Euclidean distance.

template<typename T , typename CloudType >
size_t	argMax (const typename NearestNeighbourSearch< T, CloudType >::Vector &v)
	Return the index of the maximum value of a vector of positive values.
template<typename T >
T	getStorageBitCount (T v)
	Return the number of bit required to store a value.

Detailed Description

Namespace for Nabo.

Function Documentation

template<typename T , typename CloudType >

size_t Nabo::argMax ( const typename NearestNeighbourSearch< T, CloudType >::Vector & v )

Return the index of the maximum value of a vector of positive values.

Parameters:

v	vector of positive values

template<typename T >

T Nabo::getStorageBitCount ( T v )

Return the number of bit required to store a value.

Parameters:

v	value to store

Definition at line 64 of file nabo/kdtree_cpu.cpp.