Closest-point problems
Michael Ian Shamos, Dan Hoey · Annual Symposium on Foundations of Computer Science · 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 structure, called the Voronoi diagram, which can be constructed rapidly and contains all of the relevant proximity information in only linear space. The Voronoi diagram is used to obtain O(N log N) algorithms for all of the problems.
Cited by 1,057 works. doi:10.1109/sfcs.1975.8
Authors
References
- The Design and Analysis of Computer Algorithms
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Clustering Algorithms
- Shortest Connection Networks And Some Generalizations
- An efficient algorith for determining the convex hull of a finite planar set
- Time bounds for selection
- Clustering Algorithms.
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
- The Location of Emergency Service Facilities
- On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem