David M. Mount

Univ. of Maryland, College Park, Dept. of Computer Science
http://www.cs.umd.edu/~mount/
mount@cs.umd.edu

Author, editor, or reviewer of:

• A point-placement strategy for conforming Delaunay tetrahedralization
• An optimal algorithm for approximate nearest neighbor searching in fixed dimensions
• Delaunay triangulations and computational fluid dynamics meshes
• Efficient expected-case algorithms for planar point location
• Incremental construction and dynamic maintenance of constrained Delaunay triangulations
• On the efficiency of nearest neighbor searching with data Clustered in lower dimensions
• Quantile approximation for robust statistical estimation and kappa-enclosing problems
• Query-sensitive ray shooting
• Proc. 4th Int. Worksh. Algorithm Engineering & Experiments (ALENEX 2002)