NearestNeighborsSqrtApprox.h
virtual void add(const std::vector< _T > &data)
Add a vector of points.
Definition: NearestNeighborsSqrtApprox.h:81
virtual void add(const _T &data)
Add an element to the datastructure.
Definition: NearestNeighborsSqrtApprox.h:75
void updateCheckCount()
The maximum number of checks to perform when searching for a nearest neighbor.
Definition: NearestNeighborsSqrtApprox.h:125
std::size_t offset_
The offset to start checking at (between 0 and checks_)
Definition: NearestNeighborsSqrtApprox.h:134
std::size_t checks_
The number of checks to be performed when looking for a nearest neighbor.
Definition: NearestNeighborsSqrtApprox.h:131
A nearest neighbors datastructure that uses linear search. The linear search is done over sqrt(n) ele...
Definition: NearestNeighborsSqrtApprox.h:57
A nearest neighbors datastructure that uses linear search.
Definition: NearestNeighborsLinear.h:57
virtual bool remove(const _T &data)
Remove an element from the datastructure.
Definition: NearestNeighborsLinear.h:89
virtual std::size_t size() const
Get the number of elements in the datastructure.
Definition: NearestNeighborsLinear.h:147
virtual void add(const _T &data)
Add an element to the datastructure.
Definition: NearestNeighborsLinear.h:78
virtual _T nearest(const _T &data) const
Get the nearest neighbor of a point.
Definition: NearestNeighborsSqrtApprox.h:95