Efficient algorithms for geometric optimization

Pankaj Kumar Agarwal and Micha Sharir
Computing Surveys 30(4):412–458, Dec 1998
Tech. report CS-1996-19, Duke Univ., Dept. of Computer Science, 1996
http://www.cs.duke.edu/~pankaj/papers/geom-full.ps.gz

Cites:

• Dynamic three-dimensional linear programming
• Faster construction of planar two-centers
• Iterated nearest neighbors and finding minimal polytopes
• Approximating center points with iterated Radon points
• Approximation algorithms for geometric problems
• Fast hierarchical clustering and other applications of dynamic closest pairs