Closest-point problems

@article{Shamos1975ClosestpointP,
  title={Closest-point problems},
  author={Michael Ian Shamos and Dan Hoey},
  journal={16th Annual Symposium on Foundations of Computer Science (sfcs 1975)},
  year={1975},
  pages={151-162}
}
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

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 417 CITATIONS, ESTIMATED 25% COVERAGE

417 Citations

0102030'76'86'97'08'19
Citations per Year
Semantic Scholar estimates that this publication has 417 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…