The
closest pair of points problem or
closest pair problem is a problem of
computational geometry: given
n points in
metric space, find a pair of points with the smallest distance between them. The closest pair problem for points in the Euclidean plane was among the first geometric problems which were treated at the origins of the systematic study of the
computational complexity of geometric algorithms.