Algorithms for proximity problems in higher dimensions

Matthew T. Dickerson and David Eppstein
Computational Geometry Theory & Applications 5(5):277–291, Jan 1996
Mathematical Reviews 96m:68180
http://dx.doi.org/10.1016/0925-7721(95)00009-7

Cited by:

• Geometric applications of posets
• On enumerating and selecting distances
• Voronoi diagrams
• Closest-point problems in computational geometry
• AUTOCLUST: Automatic clustering via boundary extraction for mining massive point-data sets
• Approximation algorithms for the bottleneck stretch factor problem
• Random geometric graphs
• Reporting intersections among thick objects
• Clustering spatial data using random walks
• A fast expected time algorithm for the point pattern matching problem
• Surface Reconstruction and Simplificiation