This is the preliminary version of a chapter that will appear in the Handbook on Computational Geometry, edited by J.-R. Sack and J. Urrutia. A comprehensive overview is given of algorithms and data structures for proximity problems on point sets in IR D . In particular, the closest pair problem, the exact and approximate post-office problem, and the problem of constructing spanners are discussed in detail. Contents 1 Introduction 1 2 The static closest pair problem 4 2.1 Preliminary remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.2 Algorithms that are optimal in the algebraic computation tree model . 5 2.2.1 An algorithm based on the Voronoi diagram . . . . . . . . . . . 5 2.2.2 A divide-and-conquer algorithm . . . . . . . . . . . . . . . . . . 5 2.2.3 A plane sweep algorithm . . . . . . . . . . . . . . . . . . . . . . 6 2.3 A deterministic algorithm that uses indirect addressing . . . . . . . . . 7 2.3.1 The degraded grid . . . . . . . . . . . . . . . . . . ...
|
1481
|
Computational Geometry: An introduction
– Preparata, Shamos
- 1985
|
|
793
|
Clustering Algorithms
– Hartigan
- 1975
|
|
602
|
Algorithms in Combinatorial Geometry
– Edelsbrunner
- 1987
|
|
503
|
The Art of Computer Programming, Volume 3: Sorting and Searching
– Knuth
- 1998
|
|
444
|
A.: An optimal algorithm for approximate nearest neighbor searching
– ARYA, MOUNT, et al.
- 1994
|
|
415
|
An algorithm for finding best matches in logarithmic expected time
– Friedman, Bentley, et al.
- 1977
|
|
376
|
Voronoi diagrams - a survey of a fundamental geometric data structure
– Aurenhammer
- 1991
|
|
262
|
Computational Geometry: An Introduction Through Randomized Algorithms
– Mulmuley
- 1994
|
|
218
|
Skip Lists: A Probabilistic Alternative to Balanced Trees
– Pugh
- 1989
|
|
218
|
A data structure for dynamic trees
– SLEATOR, TARJAN
- 1981
|
|
184
|
A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields
– Callahan, Kosaraju
- 1995
|
|
179
|
Storing a sparse table with O(1) worst case access time
– Fredman, Komlós, et al.
- 1984
|
|
172
|
Lower Bounds for Algebraic Computation Trees
– Ben-Or
- 1983
|
|
162
|
Quad Trees: A Data Structure for Retrieval of Composite Keys
– Finkel, Bentley
- 1974
|
|
159
|
Provably good mesh generation
– Bern, Eppstein, et al.
- 1994
|
|
156
|
Closest-Point problems
– SHAMOS, HOEY
- 1975
|
|
137
|
On constructing minimum spanning trees in kdimensional spaces and related problems
– Yao
- 1982
|
|
128
|
Leeuwen, Maintenance of configurations in the plane
– Overmars, van
- 1981
|
|
122
|
Fractional cascading: I. a data structuring technique
– Chazelle, Guibas
- 1986
|
|
120
|
R.E.: Scaling and related techniques for geometry problems
– Gabow, Bentley, et al.
- 1984
|
|
114
|
The design of dynamic data structures
– Overmars
- 1983
|
|
113
|
Dynamic Perfect Hashing: Upper and Lower Bounds
– Dietzfelbinger, Karlin, et al.
- 1994
|
|
96
|
A functional approach to data structures and its use in multidimensional searching
– Chazelle
- 1988
|
|
91
|
A randomized algorithm for closest-point queries
– Clarkson
- 1988
|
|
86
|
Multidimensional divide-and-conquer
– Bentley
- 1980
|
|
83
|
and C.A Gutwin. Classes of graphs which approximate the complete euclidean graph. Discretecomputational Geometry
– Keil
- 1992
|
|
82
|
Euclidean spanners: short, thin, and lanky
– Arya, Das, et al.
- 1995
|
|
82
|
Delaunay graphs are almost as good as complete graphs
– Dobkin, Friedman, et al.
- 1990
|
|
78
|
There is a planar graph almost as good as the complete graph
– Chew
- 1986
|
|
75
|
A combinatorial bound for linear programming and related problems
– Sharir, Welzl
- 1992
|
|
71
|
An O(nlog n) algorithm for the allnearest-neighbors problem
– Vaidya
- 1989
|
|
67
|
New sparseness results on graph spanners
– Chandra, Das, et al.
- 1995
|
|
66
|
Linear Time Algorithms for Visibility and Shortest Path Problems inside Triangulated Simple Polygons
– Guibas, Hershberger, et al.
- 1987
|
|
65
|
A linear-time algorithm for computing the Voronoĭ diagram of a convex polygon
– Aggarwal, Guibas, et al.
- 1989
|
|
62
|
L.: Decomposable Searching Problems
– Bentley
- 1979
|
|
58
|
An algorithm for approximate closest-point queries
– Clarkson
- 1994
|
|
57
|
Backwards analysis of randomized geometric algorithms
– Seidel
- 1993
|
|
56
|
Approximation algorithms for shortest path motion planning
– Clarkson
- 1987
|
|
55
|
Approximate nearest neighbor queries in fixed dimensions
– Arya, Mount
- 1993
|
|
51
|
Euclidean minimum spanning trees and bichromatic closest pairs
– Agarwal, Edelsbrunner, et al.
- 1991
|
|
49
|
Efficient algorithms for agglomerative hierarchical clustering methods
– DAY, EDELSBRUNNER
- 1984
|
|
49
|
Iterated nearest neighbors and finding minimal polytopes
– Eppstein, Erickson
- 1994
|
|
49
|
Constructing multidimensional spanner graphs
– Salowe
- 1991
|
|
48
|
Faster algorithms for some geometric graph problems in higher dimensions
– Callahan, Kosaraju
- 1993
|
|
48
|
Adding range restriction capability to dynamic data structures
– Willard, Lueker
- 1985
|
|
45
|
A data structure for orthogonal range queries
– Lueker
- 1978
|
|
44
|
A reliable randomized algorithm for the closest-pair problem
– Dietzfelbinger, Hagerup, et al.
- 1993
|
|
43
|
Algorithms for fast vector quantization
– Arya, Mount
- 1993
|
|
43
|
A fast algorithm for constructing sparse Euclidean spanners
– DAS, NARASIMHAN
- 1997
|
|
41
|
Parallel algorithms for higher dimensional convex hulls
– Amato, Goodrich, et al.
- 1994
|
