Herbert Edelsbrunner
Herbert Edelsbrunner
Bookitis has not yet captured a biography for this author, but the catalog links below show the books currently associated with this profile.
Overview
Catalog identity and bibliographic footprint for this author.
Catalog identity
How this author appears inside the active Bookitis catalog.
Display name
Personal name
Source identifier
Featured books
Representative editions for works actually authored by this person.
- Image source: Open LibraryAO
Arrangements of curves in the plane- topology, combinatorics, and algorithms
cover - Image source: Open LibraryAS
A Short Course in Computational Geometry and Topology
cover - Image source: Open LibraryAI
Algorithms in Combinatorial Geometry
cover - Image source: Open LibraryGA
Geometry and Topology for Mesh Generation (Cambridge Monographs on Applied and Computational Mathematics)
cover - Image source: Open LibraryTC
The complexity of many cells in arrangements of planes and related problems
cover - Image source: Open LibraryTC
The complexity of many faces in arrangements of lines and of segments
cover - Image source: Open LibraryIR
Implicitly representing arrangements of lines or segments
cover - Image source: Open LibraryOA
On arrangements of Jordan arcs with three intersections per pair
cover - Image source: Open LibraryAI
Algorithms in combinatorial geometry
cover - Image source: Open LibraryTU
The upper envelope of piecewise linear functions: algorithms and applications
cover - UEUpper Envelope of Piecewise Lin...Herbert Edelsbrunner
Upper Envelope of Piecewise Linear Functions
no cover - GAGeometry and Topology for Mesh...Herbert Edelsbrunner
Geometry and Topology for Mesh Generation
no cover - CTComputational topologyHerbert Edelsbrunner
Computational topology
no cover - CTComputational topologyHerbert Edelsbrunner
Computational topology
no cover - TCThe complexity of many faces in...Herbert Edelsbrunner
The complexity of many faces in arrangements of lines and segments
no cover - MPMinimum polygonal separationHerbert Edelsbrunner
Minimum polygonal separation
no cover - PCProbing convex polygons with x-...Herbert Edelsbrunner
Probing convex polygons with x-rays
no cover - TTTesting the necklace condition...Herbert Edelsbrunner
Testing the necklace condition for shortest tours and optimal factors in the plane
no cover - TPTetrahedrizing point sets in th...Herbert Edelsbrunner
Tetrahedrizing point sets in three dimensions
no cover - TSTopologically sweeping an arran...Herbert Edelsbrunner
Topologically sweeping an arrangement
no cover
Works in catalog
Quick navigation into the work-level grouping pages behind the featured books.
- Open Work
Arrangements of curves in the plane- topology, combinatorics, and algorithms
- Open Work
A Short Course in Computational Geometry and Topology
- Open Work
Algorithms in Combinatorial Geometry
- Open Work
Geometry and Topology for Mesh Generation (Cambridge Monographs on Applied and Computational Mathematics)
- Open Work
The complexity of many cells in arrangements of planes and related problems
- Open Work
The complexity of many faces in arrangements of lines and of segments
- Open Work
Implicitly representing arrangements of lines or segments
- Open Work
On arrangements of Jordan arcs with three intersections per pair
- Open Work
Algorithms in combinatorial geometry
- Open Work
The upper envelope of piecewise linear functions: algorithms and applications
- Open Work
Upper Envelope of Piecewise Linear Functions
- Open Work
Geometry and Topology for Mesh Generation
- Open Work
Computational topology
- Open Work
Computational topology
- Open Work
The complexity of many faces in arrangements of lines and segments
- Open Work
Minimum polygonal separation
- Open Work
Probing convex polygons with x-rays
- Open Work
Testing the necklace condition for shortest tours and optimal factors in the plane
- Open Work
Tetrahedrizing point sets in three dimensions
- Open Work
Topologically sweeping an arrangement