H
Herbert Edelsbrunner
Researcher at Institute of Science and Technology Austria
Publications - 389
Citations - 36345
Herbert Edelsbrunner is an academic researcher from Institute of Science and Technology Austria. The author has contributed to research in topics: Delaunay triangulation & Voronoi diagram. The author has an hindex of 84, co-authored 377 publications receiving 33877 citations. Previous affiliations of Herbert Edelsbrunner include University of Illinois at Urbana–Champaign & Duke University.
Papers
More filters
Journal ArticleDOI
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
TL;DR: This paper describes a general-purpose programming technique, called Simulation of Simplicity, that can be used to cope with degenerate input data for geometric algorithms and it is believed that this technique will become a standard tool in writing geometric software.
Book
Geometry and Topology for Mesh Generation
TL;DR: 1. Delaunay triangulations 2. Triangle meshes 3. Combinatorial topology 4. Surface simplification 5.Delaunay tetrahedrizations 6. Tetrahedron meshes 7. Open problems.
Journal ArticleDOI
Optimal point location in a monotone subdivision
TL;DR: A substantial refinement of the technique of Lee and Preparata for locating a point in $\mathcal{S}$ based on separating chains is exhibited, which can be implemented in a simple and practical way, and is extensible to subdivisions with edges more general than straight-line segments.
Posted Content
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
TL;DR: A general purpose programming technique, called the Simulation of Simplicity, which can be used to cope with degenerate input data for geometric algorithms, and it is believed that this technique will become a standard tool in writing geometric software.
Journal ArticleDOI
Constructing arrangements of lines and hyperplanes with applications
TL;DR: An algorithm is presented that constructs a representation for the cell complex defined by n hyperplanes in optimal $O(n^d )$ time in d dimensions, which is shown to lead to new methods for computing $\lambda $-matrices, constructing all higher-order Voronoi diagrams, halfspatial range estimation, degeneracy testing, and finding minimum measure simplices.