Iterated Nearest Neighbors and Finding Minimal Polytopes (1994)

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

Active Bibliography

9 On Enumerating and Selecting Distances – Timothy M. Chan - 1999
78 Arrangements and Their Applications – Pankaj K. Agarwal, Micha Sharir - 1998
53 Geometric Applications of a Randomized Optimization Technique – Timothy M. Chan - 1999
94 Efficient algorithms for geometric optimization – Pankaj K. Agarwal, Micha Sharir - 1998
9 New Algorithms for Minimum Area k-gons – David Eppstein - 1991
6 On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space – Marco Pellegrini - 1994
46 Geometric Range Searching – Jiri Matousek - 1994
70 Range Searching – Pankaj K. Agarwal - 1996
40 An Expander-Based Approach to Geometric Optimization – Matthew J. Katz, Micha Sharir - 1993
8 Lower Bounds for Fundamental Geometric Problems – Jeffrey Gordon Erickson - 1996
256 Geometric Range Searching and Its Relatives – Pankaj K. Agarwal
9 Computational Geometry – D. T. Lee - 1996
3 Efficient Parallel Algorithms for Geometric Clustering and Partitioning Problems – Amitava Datta - 1994
65 Closest-Point Problems in Computational Geometry – Michiel Smid - 1997
3 Biased Search and K-Point Clustering – Binay K. Bhattacharya, Hossam A. ElGindy - 1997
23 Finding Minimum Area k-gons – David Eppstein, Mark Overmars, Günter Rote, Gerhard Woeginger - 1992
10 Computing the Smallest k-Enclosing Circle and Related Problems – Alon Efrat, Micha Sharir, Alon Ziv - 1999
46 Low-Dimensional Linear Programming with Violations – Timothy M. Chan - 2002
Dynamic Algorithms for Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees – Pankaj Agarwal, David Eppstein, Jirí Matousek - 1992