Piegl, Les A.; Tiller, Wayne Algorithm for finding all \(k\) nearest neighbors. (English) Zbl 1206.65165 Comput.-Aided Des. 34, No. 2, 167-172 (2002). 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. Cited in 3 Documents MSC: 65K05 Numerical mathematical programming methods PDFBibTeX XMLCite \textit{L. A. Piegl} and \textit{W. Tiller}, Comput.-Aided Des. 34, No. 2, 167--172 (2002; Zbl 1206.65165) Full Text: DOI