Iterated Nearest Neighbors and Finding Minimal Polytopes (1994)

by David Eppstein , Jeff Erickson
Citations:56 - 6 self

Documents Related by Co-Citation

41 Static and dynamic algorithms for k-point clustering problems – A Datta, H-P Lenhof, C Schwarz, M Smid - 1995
1759 Computational geometry: an introduction – F P Preparata, M I Shamos - 1985
386 Applications of Random Sampling in Computational Geometry, II – Kenneth L. Clarkson, Peter W. Shor - 1995
45 On geometric optimization with few violated constraints – J Matousek - 1994
687 Algorithms in Combinatorial Geometry – H Edelsbrunner - 1987
78 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 k-enclosing circle and related problems – A Efrat, M Sharir, A Ziv - 1994
242 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
271 Worst-case analysis of a new heuristic for the travelling salesman problem – N Christofides - 1976
215 Lower bounds for algebraic computation trees – M Ben-Or - 1983
29 Netanyahu, A randomized algorithm for slope selection – M B Dillencourt, D M Mount, N S - 1992
285 Computational Geometry. An Introduction Through Randomized Algorithms – Ketan Mulmuley - 1994
89 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
55 Geometry helps in matching – P M Vaidya - 1989
8495 Introduction to Algorithms – T Cormen, C Leiserson, R Rivest - 1990