navlib::VpTree< T > Class Template Reference

Data structure used to find k-nearest neighbors using an arbitrary distance metric. More...

#include <vpTree.h>

List of all members.

Public Member Functions
	VpTree (std::vector< T > items, VpDistance distance, size_t maxChildren=2)
	Constructor.
	~VpTree ()
	Destructor.
std::vector< T >	search (const T &query, size_t k)
	Returns the k-nearest neighbors to the query.
Public Attributes
VpDistance	_distance
	distance function
VpNode *	_root
	root node of the tree
double	_tau
	search radius
size_t	_maxChildren
	max number of children per node
Classes
struct	VpNode
	Node in the vantage point tree.
struct	VpSearchElement
	Structure used to search the tree.

---

Detailed Description

template<class T>
class navlib::VpTree< T >

Data structure used to find k-nearest neighbors using an arbitrary distance metric.

---

The documentation for this class was generated from the following file:

• pathplanner/vpTree.h