Herbert Edelsbrunner
Duke Univ., Dept. of Computer Science
http://www.cs.duke.edu/~edels/
edels@cs.duke.edu
Author, editor, or reviewer of:
- Adaptive simplicial grids from cross-sections of monotone complexes
- Algorithms for weak epsilon-nets
- An upper bound for conforming Delaunay triangulations
- Computational topology
- Counting triangle crossings and halving planes
- Cutting dense point sets in half
- Edge insertion for optimal triangulation
- Fast software for box intersection
- Geometry and Topology for Mesh Generation
- On the zone theorem for hyperplane arrangements
- Selecting heavily covered points
- Sliver exudation
- Triangulations and meshes in computational geometry
