#include <limits>
#include <GfxTL/LimitedHeap.h>
Go to the source code of this file.
|
template<class Point , class Points , template< class > class ContainerT, class NN > |
void | BruteForceL1NearestNeighbors (unsigned int k, const Point &p, const Points &points, size_t size, LimitedHeap< NN, std::less< NN >, ContainerT > *neighbors) |
|
template<class Point , class Points , template< class > class ContainerT, class NN > |
void | BruteForceNearestNeighbors (unsigned int k, const Point &p, const Points &points, size_t size, LimitedHeap< NN, std::less< NN >, ContainerT > *neighbors) |
|
template<class NNs , class ScalarType > |
void | FindFurthestNearestNeighbor (const NNs &n, size_t size, size_t *worst, ScalarType *worstDist) |
|
template<class Point , class Points > |
void | NearestNeighbors (unsigned int k, const Point &p, const Points &points, size_t size, std::vector< NearestNeighbor< typename Points::size_type, typename Point::ScalarType > > *n) |
|
template<class NN , class NNs > |
void | SortedNearestNeighborInsert (const NN &nn, unsigned int k, NNs *n) |
|