NIST

nearest neighbor

(classic problem)

Definition: Find the point (rectangle, line, etc.) that is closest to another point.

See also spatial access method, point access method.

Author: PEB

Implementation

(C, C++, and Pascal)

More information

A Voronoi diagram divides a plane into regions of nearest neighbors.

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 2 September 2014.
HTML page formatted Mon Feb 2 13:10:40 2015.

Cite this as:
Paul E. Black, "nearest neighbor", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 2 September 2014. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/nearestNeighbor.html