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
Lines in space: Combinatorics and algorithms
TL;DR: A tight Θ( n2) bound on the maximum combinatorial description complexity of the set of all oriented lines that have specified orientations relative to then given lines and an algorithm that tests the “towering property” inO(n2+ɛ) time.
Book ChapterDOI
A Singly-Expenential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications
TL;DR: An effective procedure for stratifying a real semi-algebraic set into cells of constant description size that compares favorably with the doubly exponential size of Collins’ decomposition and is able to apply in interesting ways to problems of point location and geometric optimization.
Journal ArticleDOI
The complexity of cutting complexes
TL;DR: This paper investigates the combinatorial and computational aspects of certain extremal geometric problems in two and three dimensions and is able to prove sharp bounds on the asymptotic behavior of the corresponding extremal functions.
Journal ArticleDOI
Counting triangle crossings and halving planes
TL;DR: Every collection oft≥2n2 triangles with a total ofn vertices in ℝ3 has Ω(t4/n6) crossing pairs, which implies that one of their edges meets one of the triangles.
An Experimental Study of Sliver Exudation.
TL;DR: In this paper, a two-step improvement of mesh quality in three-dimensional Delaunay triangulations is presented. The first step refines the triangulation by inserting sinks and eliminating tetrahedra with large circumradius over shortest edge length ratio, and the second step assigns weights to the vertices to eliminate slivers.