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 E. Black.

Entry modified 18 February 2005.
HTML page formatted Tue Dec 6 16:16:32 2011.

Cite this as:
Paul E. Black, "nearest neighbor", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 18 February 2005. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/nearestNeighbor.html

to NIST home page