×

Algorithm for finding all \(k\) nearest neighbors. (English) Zbl 1206.65165

Summary: A very simple algorithm for computing all \(k\) nearest neighbors in 2-D is presented. The method does not rely on complicated forms of tessellation, it only requires simple data binning for fast range searching. Its applications range from scattered data interpolation to reverse engineering.

MSC:

65K05 Numerical mathematical programming methods
PDFBibTeX XMLCite
Full Text: DOI