42

Static and dynamic algorithms for kpoint clustering problems
– A Datta, HP Lenhof, C Schwarz, M Smid
 1995

396

Applications of Random Sampling in Computational Geometry, II
– Kenneth L. Clarkson, Peter W. Shor
 1995

1770

Computational Geometry: An Introduction
– Franco P Preparata, Michael Ian Shamos
 1985

44

On geometric optimization with few violated constraints
– J MatouĊĦek
 1994

694

Algorithms in Combinatorial Geometry
– H Edelsbrunner
 1987

82

Approximation Algorithms For Geometric Problems
– Marshall Bern, David Eppstein
 1995

46

Finding k points with minimum diameter and related problems
– A Aggarwal, H Imai, N Katoh, S Suri

14

On enclosing k points by a circle
– Jiri Matousek
 1995

21

Computing the smallest kenclosing circle and related problems
– A Efrat, M Sharir, A Ziv
 1994

244

A Decomposition of MultiDimensional Point Sets with Applications to kNearestNeighbors and nBody Potential Fields
– Paul B. Callahan, S. Rao Kosaraju
 1992

277

Worstcase analysis of a new heuristic for the traveling salesman problem
– N Christofides
 1976

215

Lower bounds for algebraic computation trees
– M BenOr
 1983

30

Netanyahu, A randomized algorithm for slope selection
– M B Dillencourt, D M Mount, N S
 1992

286

Computational Geometry: An Introduction Through Randomized Algorithms
– Ketan Mulmuley
 1993

91

Applications of parametric searching in geometric optimization
– Pankaj K. Agarwal, Micha Sharir
 1994

5

Iterated nearest neighbors and minimal polytopes. Discrete Comput. Geom
– D Eppstein, J Erickson
 1994

42

Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
– Pankaj K. Agarwal, Mark de Berg, Jiri Matousek, Otfried Schwarzkopf
 1994

57

Geometry helps in matching
– P M Vaidya
 1989

8557

R.: Introduction to Algorithms
– T Cormen, C Leiserson, Rivest
 1990
