Closest-point problems

  title={Closest-point problems},
  author={Michael Ian Shamos and Dan Hoey},
  journal={16th Annual Symposium on Foundations of Computer Science (sfcs 1975)},
A number of seemingly unrelated problems involving the proximity of N points in the plane are studied, such as finding a Euclidean minimum spanning tree, the smallest circle enclosing the set, k nearest and farthest neighbors, the two closest points, and a proper straight-line triangulation. For most of the problems considered a lower bound of O(N log N) is shown. For all of them the best currently-known upper bound is O(N2) or worse. The purpose of this paper is to introduce a single geometric… CONTINUE READING
Highly Influential
This paper has highly influenced 34 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 590 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
367 Citations
8 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 367 extracted citations

591 Citations

Citations per Year
Semantic Scholar estimates that this publication has 591 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-8 of 8 references

At ? - Eff 1 : cient AlgOl ' 1 : thm fOl " } the Convex Hull of a Finite Planal ' Set

  • R. L. Graham
  • Info . Proc . Lett .
  • 1972

Geometrical Solutions for some Minimax Location Problems

  • J. Elzinga, D. W. Hearn
  • Transportation Science
  • 1972

Optimal Location of a Single Service Center of certain Types

  • K. P. K. Nair, R. Chandrasekaran
  • Nav . Res . Log . Quart .
  • 1971

Graph - Theoretical Methods f 011 Describing Gestalt Clusters

  • C. T. Zahn

Similar Papers

Loading similar papers…