Closest Pair of Points Problem

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.

A naive algorithm of finding distances between all pairs of points and selecting the minimum requires O(dn2) time. It turns out that the problem may be solved in O(n log n) time in a Euclidean space or Lp space of fixed dimension d. In the algebraic decision tree model of computation, the O(n log n) algorithm is optimal. The optimality follows from the observation that the element uniqueness problem (with the lower bound of Ω(n log n) for time complexity) is reducible to the closest pair problem: checking whether the minimal distance is 0 after the solving of the closest pair problem answers the question whether there are two coinciding points.

In the computational model which assumes that the floor function is computable in constant time the problem can be solved in O(n log log n) time. If we allow randomization to be used together with the floor function, the problem can be solved in O(n) time.

Read more about Closest Pair Of Points Problem:  Brute-force Algorithm, Planar Case, Dynamic Closest-pair Problem

Famous quotes containing the words closest, pair, points and/or problem:

    Poetry, whose material is language, is perhaps the most human and least worldly of the arts, the one in which the end product remains closest to the thought that inspired it.... Of all things of thought, poetry is the closest to thought, and a poem is less a thing than any other work of art ...
    Hannah Arendt (1906–1975)

    I saw a guide-post surmounted by a pair of moose horns.... They are sometimes used for ornamental hat-trees, together with deer’s horns, in front entries; but ... I trust that I shall have a better excuse for killing a moose than that I may hang my hat on his horns.
    Henry David Thoreau (1817–1862)

    Wonderful “Force of Public Opinion!” We must act and walk in all points as it prescribes; follow the traffic it bids us, realise the sum of money, the degree of “influence” it expects of us, or we shall be lightly esteemed; certain mouthfuls of articulate wind will be blown at us, and this what mortal courage can front?
    Thomas Carlyle (1795–1881)

    I tell you, sir, the only safeguard of order and discipline in the modern world is a standardized worker with interchangeable parts. That would solve the entire problem of management.
    Jean Giraudoux (1882–1944)