a Department of Computer Science & Engineering, University of South Florida, 4202 Fowler Avenue, ENG 118, Tampa, FL 33620, USA b GeomWare Inc., 3035 Great Oak Circle, Tyler, TX 75703, USA
Abstract:
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.