|
38
|
Static and dynamic algorithms for k-point clustering problems
– A Datta, H-P Lenhof, C Schwarz, M Smid
- 1995
|
|
38
|
On geometric optimization with few violated constraints. Discrete Comput
– J MatouĊĦek
- 1995
|
|
40
|
Finding k points with Minimum Diameter and Related Problems
– A Aggarwal, H Imai, N Katoh, S Suri
- 1991
|
|
357
|
Applications of Random Sampling in Computational Geometry, II
– Kenneth L. Clarkson, Peter W. Shor
- 1995
|
|
643
|
Algorithms in Combinatorial Geometry
– Herbert Edelsbrunner
- 1987
|
|
21
|
Computing the smallest k-enclosing circle and related problems
– A Efrat, M Sharir, A Ziv
- 1994
|
|
74
|
Approximation Algorithms For Geometric Problems
– Marshall Bern, David Eppstein
- 1995
|
|
88
|
Applications of parametric searching in geometric optimization
– Pankaj K. Agarwal, Micha Sharir
- 1994
|
|
1611
|
Computational geometry: An introduction
– F P Preparata, M I Shamos
- 1985
|
|
12
|
On enclosing k points by a circle
– J Matousek
- 1995
|
|
9
|
L-infinity interdistance selection by parametric search
– J S Salowe
- 1989
|
|
214
|
A Decomposition of Multi-Dimensional Point Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields
– Paul B. Callahan, S. Rao Kosaraju
- 1992
|
|
221
|
Worst-Case Analysis of a New Heuristic for the Traveling Salesman Problem
– N Christofides
- 1976
|
|
28
|
A randomized algorithm for slope selection
– M B Dillencourt, D M Mount, N S Netanyahu
- 1992
|
|
275
|
Computational Geometry: An Introduction Through Randomized Algorithms
– K Mulmuley
- 1993
|
|
41
|
Efficient Randomized Algorithms for Some Geometric Optimization Problems
– Pankaj K. Agarwal, Micha Sharir
- 1995
|
|
5
|
Iterated nearest neighbors and minimal polytopes. Discrete Comput. Geom
– D Eppstein, J Erickson
- 1994
|
|
41
|
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
– Pankaj K. Agarwal, Mark de Berg, Jiri Matousek, Otfried Schwarzkopf
- 1994
|
|
50
|
Geometry helps in Matching
– M Vaidya
- 1989
|
