Nearest Neighbor Problem -- from Wolfram MathWorld

Geometry > Computational Geometry > Nearest Neighbor Problems >

Interactive Entries > Interactive Demonstrations >

Nearest Neighbor Problem

The problem in computational geometry of identifying the point from a set of points which is nearest to a given point according to some measure of distance. The nearest neighborhood problem involves identifying the locus of points lying nearer to the query point than to any other point in the set.

The nearest neighbor from the set of points , can be computed in Mathematica using Nearest[u1, u2, ..., x].

REFERENCES:

Smid, M. "Closest-Point Problems in Computational Geometry." Ch. 20 in Handbook of Computational Geometry (Ed. J.-R. Sack and J. Urrutia). Amsterdam, Netherlands: North-Holland, pp. 877-935, 2000.

Skiena, S. S. "Nearest Neighbor Search." §8.6.5 in The Algorithm Design Manual. New York: Springer-Verlag, pp. 361-363, 1997.

CITE THIS AS:

Weisstein, Eric W. "Nearest Neighbor Problem." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/NearestNeighborProblem.html