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
Book ChapterDOI
Optimal Solutions for a Class of Point Retrieval Problems
TL;DR: If constant time suffices for deciding the inclusion of a point in C, the existence of an optimal solution is demonstrated: the algorithm requires O(n) space and O(k + log n) time for a query with output size k.
Journal ArticleDOI
Sink insertion for mesh improvement
TL;DR: Sink insertion is proposed as a new technique to improve the mesh quality of Delaunay triangulations and compared with the conventional circumcenter insertion technique under three scheduling regimes: incremental, in blocks, and in parallel.
Posted Content
A Simple Algorithm for Higher-order Delaunay Mosaics and Alpha Shapes.
Herbert Edelsbrunner,Georg Osang +1 more
TL;DR: A simple algorithm for computing higher-order Delaunay mosaics that works in Euclidean spaces of any finite dimensions and is extended to compute higher- order $\alpha$-shapes and provides open-source implementations.
Patent
Surfaces reconstruction from data point sets
TL;DR: In this article, the authors propose to reconstruct a dense and locally two-dimensionalally distributed 3D point set (e.g., point cloud) by merging stars in 2D weighted Delaunay triangulations within estimated tangent planes.
Book ChapterDOI
Mean-payoff Automaton Expressions
Krishnendu Chatterjee,Laurent Doyen,Herbert Edelsbrunner,Thomas A. Henzinger,Philippe Rannou +4 more
TL;DR: A new class of quantitative languages is introduced, defined by mean-payoff automaton expressions, which is robust and decidable: it is closed under the four pointwise operations, and it is shown that all decision problems are decidable for this class.