论文信息 - Algorithm for finding all k nearest neighbors

Algorithm for finding all k nearest neighbors

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.

Les A. Piegl | Wayne Tiller | L. Piegl | W. Tiller

[1] Matthew Dickerson,et al. Simple algorithms for enumerating interpoint distances and finding $k$ nearest neighbors , 1992, Int. J. Comput. Geom. Appl..

[2] Joseph O'Rourke,et al. Computational Geometry in C. , 1995 .

[3] George Goodsell. On finding p-th nearest neighbours of scattered points in two dimensions for small p , 2000, Comput. Aided Geom. Des..

[4] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .

[5] M. Laszlo. Computational Geometry and Computer Graphics in C , 1995 .

[6] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.