Herbert Edelsbrunner

Prof. Herbert Edelsbrunner


Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 December 2016 in Transactions of the American Mathematical Society
Verified
Journal Article
Open access
PDF file
UBUlrich Bauer
Ulrich Bauer
HEHerbert Edelsbrunner
Herbert Edelsbrunner
Given a finite set of points in R n \mathbb {R}^n and a radius parameter, we study the Čech, Delaunay–Čech, Delaunay (or alpha), and Wrap complexes in the light of generalized discrete Morse theory. Establishing the Čech and Delaunay complexes as sublevel sets of generalized discrete Morse functions, we prove that the four complexes are simple-homotopy equivalent by a sequence of simplicial collapses, which are explicitly described by a single discrete gradient field.

28 August 2022 in Algorithmica
Verified
Journal Article
Open access
PDF file
HEHerbert Edelsbrunner
Herbert Edelsbrunner
GOGeorg Osang
Georg Osang
We present a simple algorithm for computing higher-order Delaunay mosaics that works in Euclidean spaces of any finite dimensions. The algorithm selects the vertices of the order-k mosaic from incrementally constructed lower-order mosaics and uses an algorithm for weighted first-order Delaunay mosaics as a black-box to construct the order-k mosaic from its vertices. Beyond this black-box, the algorithm uses only combinatorial operations, thus facilitating easy implementation. We extend this algorithm to compute higher-order $$\alpha $$ α -shapes and provide open-source implementations. We present experimental results for properties of higher-order Delaunay mosaics of random point sets.

31 March 2021 in Discrete & Computational Geometry
Verified
Journal Article
Open access
PDF file
HEHerbert Edelsbrunner
Herbert Edelsbrunner
GOGeorg Osang
Georg Osang
Given a locally finite $$X \subseteq {{{\mathbb {R}}}}^d$$ X ⊆ R d and a radius $$r \ge 0$$ r ≥ 0 , the k-fold cover of X and r consists of all points in $${{{\mathbb {R}}}}^d$$ R d that have k or more points of X within distance r. We consider two filtrations—one in scale obtained by fixing k and increasing r, and the other in depth obtained by fixing r and decreasing k—and we compute the persistence diagrams of both. While standard methods suffice for the filtration in scale, we need novel geometric and topological concepts for the filtration in depth. In particular, we introduce a rhomboid tiling in $${{{\mathbb {R}}}}^{d+1}$$ R d + 1 whose horizontal integer slices are the order-k Delaunay mosaics of X, and construct a zigzag module of Delaunay mosaics that is isomorphic to the persistence module of the multi-covers.

1 August 2015 in Computational Geometry
Verified
Journal Article
Closed access
TCThanh-Tung Cao
Thanh-Tung Cao
HEHerbert Edelsbrunner
Herbert Edelsbrunner
TTTiow-Seng Tan
Tiow-Seng Tan

20 March 2020 in Discrete & Computational Geometry
Verified
Journal Article
Open access
PDF file
HEHerbert Edelsbrunner
Herbert Edelsbrunner
KÖKatharina Ölsböck
Katharina Ölsböck
Generalizing the decomposition of a connected planar graph into a tree and a dual tree, we prove a combinatorial analog of the classic Helmholtz–Hodge decomposition of a smooth vector field. Specifically, we show that for every polyhedral complex, K, and every dimension, p, there is a partition of the set of p-cells into a maximal p-tree, a maximal p-cotree, and a collection of p-cells whose cardinality is the p-th reduced Betti number of K. Given an ordering of the p-cells, this tri-partition is unique, and it can be computed by a matrix reduction algorithm that also constructs canonical bases of cycle and boundary groups.

20 September 2021 in Soft Matter
Verified
Journal Article
Closed access
PDF file
GOGeorg Osang
Georg Osang
HEHerbert Edelsbrunner
Herbert Edelsbrunner
MSMohammad Saadatfar
Mohammad Saadatfar
3D rendering of the experimental packing obtained via X-ray CT. A cut-out section shows the bulk crystallisation and partially crystallised regions.