Herbert Edelsbrunner
Books
- Upper Envelope of Piecewise Linear Functions
- A Short Course in Computational Geometry and Topology
- Algorithms in combinatorial geometry
- The complexity of many cells in arrangements of planes and related problems
- Implicitly representing arrangements of lines or segments
- The upper envelope of piecewise linear functions: algorithms and applications
- Computational topology
- Algorithms in Combinatorial Geometry
- Arrangements of curves in the plane- topology, combinatorics, and algorithms
- Computational topology
- Minimum polygonal separation
- The complexity of many faces in arrangements of lines and segments
- The maximum number of ways to stab n convex non-intersecting objects in the plane 2n-2
- Probing convex polygons with x-rays
- Tetrahedrizing point sets in three dimensions
- Geometry and Topology for Mesh Generation
- The complexity of many faces in arrangements of lines and of segments
- On arrangements of Jordan arcs with three intersections per pair
- Testing the necklace condition for shortest tours and optimal factors in the plane
- Topologically sweeping an arrangement
- Geometry and Topology for Mesh Generation (Cambridge Monographs on Applied and Computational Mathematics)
Author data: Open Library