KdTree to save n-dimensional point value pairs. This KdTree uses n-dimensional points (type T) as keys to save values (type V) More...
#include <KdTree.h>
Classes | |
class | Node |
Public Member Functions | |
const V * | Find (const std::vector< T > &point) |
void | Insert (const std::vector< T > &point, const V &value) |
KdTree (int dimensions) | |
Implementation. | |
virtual | ~KdTree () |
Deconstructor. | |
Private Attributes | |
int | m_dimensions |
Node * | m_root |
KdTree to save n-dimensional point value pairs. This KdTree uses n-dimensional points (type T) as keys to save values (type V)
face_contour_detector::KdTree< T, V >::KdTree | ( | int | dimensions | ) |
face_contour_detector::KdTree< T, V >::~KdTree | ( | ) | [virtual] |
const V * face_contour_detector::KdTree< T, V >::Find | ( | const std::vector< T > & | point | ) |
void face_contour_detector::KdTree< T, V >::Insert | ( | const std::vector< T > & | point, |
const V & | value | ||
) |
int face_contour_detector::KdTree< T, V >::m_dimensions [private] |
Node* face_contour_detector::KdTree< T, V >::m_root [private] |