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