Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
23 Publications
2023 | Journal Article | IST-REx-ID: 12287 | 
Local criteria for triangulating general manifolds
J.-D. Boissonnat, R. Dyer, A. Ghosh, M. Wintraecken, Discrete & Computational Geometry 69 (2023) 156–191.
View
| Files available
| DOI
J.-D. Boissonnat, R. Dyer, A. Ghosh, M. Wintraecken, Discrete & Computational Geometry 69 (2023) 156–191.
2022 | Journal Article | IST-REx-ID: 10773 |
Continuous and discrete radius functions on Voronoi tessellations and Delaunay mosaics
R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, M. Saghafian, Discrete and Computational Geometry 67 (2022) 811–842.
View
| Files available
| DOI
R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, M. Saghafian, Discrete and Computational Geometry 67 (2022) 811–842.
2022 | Journal Article | IST-REx-ID: 11999 |
Inserting one edge into a simples drawing is hard
A.M. Arroyo Guevara, F. Klute, I. Parada, B. Vogtenhuber, R. Seidel, T. Wiedera, Discrete and Computational Geometry (2022).
View
| Files available
| DOI
| arXiv
A.M. Arroyo Guevara, F. Klute, I. Parada, B. Vogtenhuber, R. Seidel, T. Wiedera, Discrete and Computational Geometry (2022).
2022 | Journal Article | IST-REx-ID: 12129 |
Connectivity of triangulation flip graphs in the plane
Wagner, Uli, Connectivity of triangulation flip graphs in the plane. Discrete & Computational Geometry 68 (4). 2022
View
| Files available
| DOI
Wagner, Uli, Connectivity of triangulation flip graphs in the plane. Discrete & Computational Geometry 68 (4). 2022
2022 | Journal Article | IST-REx-ID: 11593 |
The Z2-Genus of Kuratowski minors
R. Fulek, J. Kynčl, Discrete and Computational Geometry (2022).
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
R. Fulek, J. Kynčl, Discrete and Computational Geometry (2022).
2022 | Journal Article | IST-REx-ID: 10776 |
Barycentric cuts through a convex body
Z. Patakova, M. Tancer, U. Wagner, Discrete and Computational Geometry 68 (2022) 1133–1154.
View
| DOI
| Download Preprint (ext.)
| arXiv
Z. Patakova, M. Tancer, U. Wagner, Discrete and Computational Geometry 68 (2022) 1133–1154.
2021 | Journal Article | IST-REx-ID: 9317 |
The multi-cover persistence of Euclidean balls
H. Edelsbrunner, G.F. Osang, Discrete and Computational Geometry 65 (2021) 1296–1313.
View
| Files available
| DOI
H. Edelsbrunner, G.F. Osang, Discrete and Computational Geometry 65 (2021) 1296–1313.
2021 | Journal Article | IST-REx-ID: 11446
Vanishing of all equivariant obstructions and the mapping degree
S. Avvakumov, S. Kudrya, Discrete & Computational Geometry 66 (2021) 1202–1216.
View
| Files available
| DOI
| arXiv
S. Avvakumov, S. Kudrya, Discrete & Computational Geometry 66 (2021) 1202–1216.
2020 | Journal Article | IST-REx-ID: 8338 |
On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs
A. Akopyan, A.I. Bobenko, W.K. Schief, J. Techter, Discrete and Computational Geometry 66 (2020) 938–976.
View
| DOI
| Download Preprint (ext.)
| arXiv
A. Akopyan, A.I. Bobenko, W.K. Schief, J. Techter, Discrete and Computational Geometry 66 (2020) 938–976.
2013 | Journal Article | IST-REx-ID: 2815 |
Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions
H. Edelsbrunner, B.T. Fasy, G. Rote, Discrete & Computational Geometry 49 (2013) 797–822.
View
| Files available
| DOI
| Download Published Version (ext.)
H. Edelsbrunner, B.T. Fasy, G. Rote, Discrete & Computational Geometry 49 (2013) 797–822.
1991 | Journal Article | IST-REx-ID: 4061 |
Euclidean minimum spanning trees and bichromatic closest pairs
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, Discrete & Computational Geometry 6 (1991) 407–422.
View
| DOI
| Download Published Version (ext.)
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, Discrete & Computational Geometry 6 (1991) 407–422.
1991 | Journal Article | IST-REx-ID: 4062 |
Points and triangles in the plane and halving planes in space
B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, R. Wenger, Discrete & Computational Geometry 6 (1991) 435–442.
View
| DOI
| Download Published Version (ext.)
B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, R. Wenger, Discrete & Computational Geometry 6 (1991) 435–442.
1990 | Journal Article | IST-REx-ID: 4066
The complexity of many cells in arrangements of planes and related problems
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 5 (1990) 197–216.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 5 (1990) 197–216.
1990 | Journal Article | IST-REx-ID: 4068
The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2
H. Edelsbrunner, M. Sharir, Discrete & Computational Geometry 5 (1990) 35–42.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, M. Sharir, Discrete & Computational Geometry 5 (1990) 35–42.
1990 | Journal Article | IST-REx-ID: 4072
The complexity and construction of many faces in arrangements of lines and of segments
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 5 (1990) 161–196.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 5 (1990) 161–196.
1990 | Journal Article | IST-REx-ID: 4074
Combinatorial complexity bounds for arrangements of curves and spheres
K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, E. Welzl, Discrete & Computational Geometry 5 (1990) 99–160.
View
| DOI
| Download None (ext.)
K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, E. Welzl, Discrete & Computational Geometry 5 (1990) 99–160.
1989 | Journal Article | IST-REx-ID: 4081 |
The upper envelope of piecewise linear functions: Algorithms and applications
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 4 (1989) 311–336.
View
| DOI
| Download Published Version (ext.)
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 4 (1989) 311–336.
1989 | Journal Article | IST-REx-ID: 4086 |
The upper envelope of piecewise linear functions: Tight bounds on the number of faces
H. Edelsbrunner, Discrete & Computational Geometry 4 (1989) 337–343.
View
| DOI
| Download Published Version (ext.)
H. Edelsbrunner, Discrete & Computational Geometry 4 (1989) 337–343.
1989 | Journal Article | IST-REx-ID: 4088 |
Implicitly representing arrangements of lines or segments
H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, J. Snoeyink, E. Welzl, Discrete & Computational Geometry 4 (1989) 433–466.
View
| DOI
| Download Published Version (ext.)
H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, J. Snoeyink, E. Welzl, Discrete & Computational Geometry 4 (1989) 433–466.
1989 | Journal Article | IST-REx-ID: 4089 |
On arrangements of Jordan arcs with three intersections per pair
H. Edelsbrunner, L. Guibas, J. Hershberger, J. Pach, R. Pollack, R. Seidel, M. Sharir, J. Snoeyink, Discrete & Computational Geometry 4 (1989) 523–539.
View
| DOI
| Download Published Version (ext.)
H. Edelsbrunner, L. Guibas, J. Hershberger, J. Pach, R. Pollack, R. Seidel, M. Sharir, J. Snoeyink, Discrete & Computational Geometry 4 (1989) 523–539.