# Optimal Expected-Time Algorithms for Closest Point Problems

@article{Bentley1980OptimalEA, title={Optimal Expected-Time Algorithms for Closest Point Problems}, author={J. Bentley and B. Weide and A. Yao}, journal={ACM Trans. Math. Softw.}, year={1980}, volume={6}, pages={563-580} }

Abstract : Geometric closest-point problems deal with the proximity relationships in k-dimensional point sets. Examples of closest-point problems include building minimum spanning trees, nearest neighbor searching, and triangulation construction. Shamos and Hoey (1975) have shown how the Voronoi diagram can be used to solve a number of planar closest-point problems in optimal worst-case time. In this paper we extend their work by giving optimal expected-time algorithms for solving a number of… Expand

#### 343 Citations

Algorithms for solving near point problems

- Mathematics
- 2011

Near point problems are widely used in computational geometry as well as a variety of other scientific fields. This work examines four common near point problems and presents original algorithms that… Expand

Expected Time Analysis of Algorithms in Computational Geometry

- Mathematics
- 1985

We give a brief inexhaustive survey of recent results that can be helpful in the expected time analysis of algorithms in computational geometry. Most fast average time algorithms use one of three… Expand

A Linear Expected-Time Algorithm for Computing Planar Relative Neighbourhood Graphs

- Mathematics, Computer Science
- Inf. Process. Lett.
- 1987

A new algorithm for computing the relative neighbourhood graph (RNG) of a planar point set is given and the expected running time is linear for a point set in a unit square when the points have been generated by a homogeneous planar Poisson point process. Expand

An optimal algorithm for the all-nearest-neighbors problem

- Mathematics, Computer Science
- 27th Annual Symposium on Foundations of Computer Science (sfcs 1986)
- 1986

This work gives an O(nlogn) algorithm for the All-Nearest-Neighbors problem, for fixed dimension k and fixed metric Lq, and shows that the running time of this algorithm is optimal upto a constant. Expand

Recent Results on the Average Time Behavior of Some Algorithms in Computational Geometry

- Computer Science
- 1981

A brief inexhaustive survey of recent results that can be helpful in the average time analysis of algorithms in computational geometry, and discusses searching, sorting, finding the Voronoi diagram and the minimal spanning tree. Expand

Finding Nearest Neighbors with Voronoi Tessellations

- Mathematics, Computer Science
- Inf. Process. Lett.
- 1990

A new method for finding nearest neighbors in any bounded region using the Voronoi tessellation to allow nearest neighbor retrievals to be performed in expected constant time which is independent of the dimension. Expand

Fast expected-time and approximation algorithms for geometric minimum spanning trees

- Mathematics, Computer Science
- STOC '84
- 1984

Algorithms for solving the geometric minimum spanning tree problem: Given a set of n points hi d-dimensional space, find a minimum spraining tree for the complete weighted graph G dcfined by these points are presented. Expand

Fast Expected-Tinie and Approximation Algorithms for Geometric Minimum Spanning Trees

- 2000

Kenneth L. Clarkson Stanford University §1 I n t r o d u c t i o n We present algorithms for solving the geometric minimum spanning tree problem: Given a set of n points hi d-dimensional space, find… Expand

An algorithm for geometric minimum spanning trees requiring nearly linear expected time

- Mathematics, Computer Science
- Algorithmica
- 2005

An algorithm for finding a minimum spanning tree of the weighted complete graph induced by a set ofn points in Euclideand-space and the robustness of bucket sorting is demonstrated, which requiresO(n) expected time in this case despite the probability dependency between the edge weights. Expand

Average-case analysis of algorithms for convex hulls and Voronoi diagrams

- Mathematics
- 1988

This thesis addressed the design and analysis of fast-on-average algorithms for two classic problems of computational geometry: the construction of convex hulls and Voronoi diagrams of finite point… Expand

#### References

SHOWING 1-10 OF 50 REFERENCES

Closest-point problems

- Mathematics, Computer Science
- 16th Annual Symposium on Foundations of Computer Science (sfcs 1975)
- 1975

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, and is used to obtain O(N log N) algorithms for most of the problems considered. Expand

Finding Minimum Spanning Trees

- Mathematics, Computer Science
- SIAM J. Comput.
- 1976

This paper studies methods for finding minimum spanning trees in graphs and results include relationships with other problems which might lead general lower bound for the complexity of the minimum spanning tree problem. Expand

On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems

- Mathematics, Computer Science
- SIAM J. Comput.
- 1982

By employing a subroutine that solves the post office problem, it is shown that, for fixed k $\geq$ 3, such a minimum spanning tree can be found in time O($n^{2-a(k)} {(log n)}^{1-a (k)}$), where a(k) = $2^{-(k+1)}$. Expand

Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces

- Mathematics, Computer Science
- IEEE Transactions on Computers
- 1978

Algorithms are presented that construct the shortest connecting network, or minimal spanning tree, of N points embedded in k-dimensional coordinate space and an algorithm is also presented that constructs a spanning tree that is very nearly minimal with computation proportional to N log N for all k. Expand

Multidimensional divide-and-conquer

- Mathematics, Computer Science
- CACM
- 1980

Multidimensional divide-and-conquer is discussed, an algorithmic paradigm that can be instantiated in many different ways to yield a number of algorithms and data structures for multidimensional problems. Expand

Efficient computation of continuous skeletons

- Computer Science
- 20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
- 1979

An O(n lgn) algorithm is presented for the construction of skeletons of arbitrary n-line polygonal figures that employs a linear time algorithm for the merging of two arbitrary (standard) Voronoi diagrams. Expand

An Algorithm for Finding Best Matches in Logarithmic Expected Time

- Mathematics, Computer Science
- TOMS
- 1977

An algorithm and data structure are presented for searching a file containing N records, each described by k real valued keys, for the m closest matches or nearest neighbors to a given query record.… Expand

Convex hulls of finite sets of points in two and three dimensions

- Mathematics, Computer Science
- CACM
- 1977

The presented algorithms use the “divide and conquer” technique and recursively apply a merge procedure for two nonintersecting convex hulls to ensure optimal time complexity within a multiplicative constant. Expand

A Note on Rabin's Nearest-Neighbor Algorithm

- Mathematics, Computer Science
- Inf. Process. Lett.
- 1979

At least part of the speed up is due to the model rather than the probabilistic nature of the algorithm, which is asymtomatically linear whereas the best of the known deterministic algorithms take order $n \log n$ time. Expand

Application of a Planar Separator Theorem

- Mathematics, Computer Science
- FOCS
- 1977

Any n-vertex planar graph has the property that it can be divided into components of roughly equal size by removing only O(√n) vertices. This separator theorem, in combination with a… Expand