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.
45 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.
[Published Version]
View
| Files available
| DOI
| WoS
J.-D. Boissonnat, R. Dyer, A. Ghosh, M. Wintraecken, Discrete & Computational Geometry 69 (2023) 156–191.
2023 | Journal Article | IST-REx-ID: 11999 |
Inserting one edge into a simple drawing is hard
A.M. Arroyo Guevara, F. Klute, I. Parada, B. Vogtenhuber, R. Seidel, T. Wiedera, Discrete and Computational Geometry 69 (2023) 745–770.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
A.M. Arroyo Guevara, F. Klute, I. Parada, B. Vogtenhuber, R. Seidel, T. Wiedera, Discrete and Computational Geometry 69 (2023) 745–770.
2023 | Journal Article | IST-REx-ID: 12764 |
Discrete yamabe problem for polyhedral surfaces
H. Kourimska, Discrete and Computational Geometry 70 (2023) 123–153.
[Published Version]
View
| Files available
| DOI
| WoS
H. Kourimska, Discrete and Computational Geometry 70 (2023) 123–153.
2023 | Journal Article | IST-REx-ID: 12709 |
Computing the multicover bifiltration
R. Corbet, M. Kerber, M. Lesnick, G.F. Osang, Discrete and Computational Geometry 70 (2023) 376–405.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
R. Corbet, M. Kerber, M. Lesnick, G.F. Osang, Discrete and Computational Geometry 70 (2023) 376–405.
2023 | Journal Article | IST-REx-ID: 13974 |
The crossing Tverberg theorem
R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, U. Wagner, Discrete and Computational Geometry (2023).
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, U. Wagner, Discrete and Computational Geometry (2023).
2023 | Journal Article | IST-REx-ID: 14345 |
On angles in higher order Brillouin tessellations and related tilings in the plane
H. Edelsbrunner, A. Garber, M. Ghafari, T. Heiss, M. Saghafian, Discrete and Computational Geometry (2023).
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
H. Edelsbrunner, A. Garber, M. Ghafari, T. Heiss, M. Saghafian, Discrete and Computational Geometry (2023).
2023 | Journal Article | IST-REx-ID: 13270 |
Iterated medial triangle subdivision in surfaces of constant curvature
F.R. Brunck, Discrete and Computational Geometry 70 (2023) 1059–1089.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
F.R. Brunck, Discrete and Computational Geometry 70 (2023) 1059–1089.
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.
[Published Version]
View
| Files available
| DOI
| WoS
R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, M. Saghafian, Discrete and Computational Geometry 67 (2022) 811–842.
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.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
Z. Patakova, M. Tancer, U. Wagner, Discrete and Computational Geometry 68 (2022) 1133–1154.
2022 | Journal Article | IST-REx-ID: 12129 |
Connectivity of triangulation flip graphs in the plane
U. Wagner, E. Welzl, Discrete & Computational Geometry 68 (2022) 1227–1284.
[Published Version]
View
| Files available
| DOI
| WoS
U. Wagner, E. Welzl, Discrete & Computational Geometry 68 (2022) 1227–1284.
2022 | Journal Article | IST-REx-ID: 11593 |
The Z2-Genus of Kuratowski minors
R. Fulek, J. Kynčl, Discrete and Computational Geometry 68 (2022) 425–447.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
R. Fulek, J. Kynčl, Discrete and Computational Geometry 68 (2022) 425–447.
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.
[Preprint]
View
| Files available
| DOI
| arXiv
S. Avvakumov, S. Kudrya, Discrete & Computational Geometry 66 (2021) 1202–1216.
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.
[Published Version]
View
| Files available
| DOI
| WoS
H. Edelsbrunner, G.F. Osang, Discrete and Computational Geometry 65 (2021) 1296–1313.
2021 | Journal Article | IST-REx-ID: 8940 |
Triangulating submanifolds: An elementary and quantified version of Whitney’s method
J.-D. Boissonnat, S. Kachanovich, M. Wintraecken, Discrete & Computational Geometry 66 (2021) 386–434.
[Published Version]
View
| Files available
| DOI
| WoS
J.-D. Boissonnat, S. Kachanovich, M. Wintraecken, Discrete & Computational Geometry 66 (2021) 386–434.
2021 | 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 (2021) 938–976.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
A. Akopyan, A.I. Bobenko, W.K. Schief, J. Techter, Discrete and Computational Geometry 66 (2021) 938–976.
2021 | Journal Article | IST-REx-ID: 8248 |
Local conditions for triangulating submanifolds of Euclidean space
J.-D. Boissonnat, R. Dyer, A. Ghosh, A. Lieutier, M. Wintraecken, Discrete and Computational Geometry 66 (2021) 666–686.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
J.-D. Boissonnat, R. Dyer, A. Ghosh, A. Lieutier, M. Wintraecken, Discrete and Computational Geometry 66 (2021) 666–686.
2021 | Journal Article | IST-REx-ID: 7905 |
Sheaf-theoretic stratification learning from geometric and topological perspectives
A. Brown, B. Wang, Discrete and Computational Geometry 65 (2021) 1166–1198.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
A. Brown, B. Wang, Discrete and Computational Geometry 65 (2021) 1166–1198.
2019 | Journal Article | IST-REx-ID: 5986 |
A proof of the orbit conjecture for flipping edge-labelled triangulations
A. Lubiw, Z. Masárová, U. Wagner, Discrete & Computational Geometry 61 (2019) 880–898.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
A. Lubiw, Z. Masárová, U. Wagner, Discrete & Computational Geometry 61 (2019) 880–898.
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.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
H. Edelsbrunner, B.T. Fasy, G. Rote, Discrete & Computational Geometry 49 (2013) 797–822.
2002 | Journal Article | IST-REx-ID: 3996
Topological persistence and simplification
H. Edelsbrunner, D. Letscher, A. Zomorodian, Discrete & Computational Geometry 28 (2002) 511–533.
View
| DOI
H. Edelsbrunner, D. Letscher, A. Zomorodian, Discrete & Computational Geometry 28 (2002) 511–533.
2001 | Journal Article | IST-REx-ID: 4007
Dynamic skin triangulation
H. Cheng, T. Dey, H. Edelsbrunner, J. Sullivan, Discrete & Computational Geometry 25 (2001) 525–568.
View
| DOI
H. Cheng, T. Dey, H. Edelsbrunner, J. Sullivan, Discrete & Computational Geometry 25 (2001) 525–568.
2001 | Journal Article | IST-REx-ID: 2419
A continuous analogue of the Upper Bound Theorem
U. Wagner, E. Welzl, Discrete & Computational Geometry 26 (2001) 205–219.
View
| DOI
U. Wagner, E. Welzl, Discrete & Computational Geometry 26 (2001) 205–219.
2000 | Journal Article | IST-REx-ID: 4004
Edgewise subdivision of a simplex
H. Edelsbrunner, D. Grayson, Discrete & Computational Geometry 24 (2000) 707–719.
View
| DOI
H. Edelsbrunner, D. Grayson, Discrete & Computational Geometry 24 (2000) 707–719.
1999 | Journal Article | IST-REx-ID: 4014
Deformable smooth surface design
H. Edelsbrunner, Discrete & Computational Geometry 21 (1999) 87–115.
View
| DOI
H. Edelsbrunner, Discrete & Computational Geometry 21 (1999) 87–115.
1997 | Journal Article | IST-REx-ID: 4022
Cutting dense point sets in half
H. Edelsbrunner, P. Valtr, E. Welzl, Discrete & Computational Geometry 17 (1997) 243–255.
View
| DOI
H. Edelsbrunner, P. Valtr, E. Welzl, Discrete & Computational Geometry 17 (1997) 243–255.
1997 | Journal Article | IST-REx-ID: 4023
Inclusion-exclusion complexes for pseudodisk collections
H. Edelsbrunner, E. Ramos, Discrete & Computational Geometry 17 (1997) 287–306.
View
| DOI
H. Edelsbrunner, E. Ramos, Discrete & Computational Geometry 17 (1997) 287–306.
1995 | Journal Article | IST-REx-ID: 4035
Improved bounds on weak ε-nets for convex sets
B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, M. Sharir, E. Welzl, Discrete & Computational Geometry 13 (1995) 1–15.
View
| DOI
| Download None (ext.)
B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, M. Sharir, E. Welzl, Discrete & Computational Geometry 13 (1995) 1–15.
1995 | Journal Article | IST-REx-ID: 4028 |
The union of balls and its dual shape
H. Edelsbrunner, Discrete & Computational Geometry 13 (1995) 415–440.
[Published Version]
View
| DOI
| Download Published Version (ext.)
H. Edelsbrunner, Discrete & Computational Geometry 13 (1995) 415–440.
1994 | Journal Article | IST-REx-ID: 4032
Counting triangle crossings and halving planes
T. Dey, H. Edelsbrunner, Discrete & Computational Geometry 12 (1994) 281–289.
View
| DOI
| Download None (ext.)
T. Dey, H. Edelsbrunner, Discrete & Computational Geometry 12 (1994) 281–289.
1993 | Journal Article | IST-REx-ID: 4040
An upper bound for conforming Delaunay triangulations
H. Edelsbrunner, T. Tan, Discrete & Computational Geometry 10 (1993) 197–213.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, T. Tan, Discrete & Computational Geometry 10 (1993) 197–213.
1993 | Journal Article | IST-REx-ID: 4044
Edge insertion for optimal triangulations
M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, T. Tan, Discrete & Computational Geometry 10 (1993) 47–65.
View
| DOI
| Download None (ext.)
M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, T. Tan, Discrete & Computational Geometry 10 (1993) 47–65.
1993 | Journal Article | IST-REx-ID: 4045
Diameter, width, closest line pair, and parametric searching
B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 10 (1993) 183–196.
View
| DOI
| Download None (ext.)
B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 10 (1993) 183–196.
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.
[Published Version]
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.
[Published Version]
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: 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: 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: 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: 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.
[Published Version]
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.
[Published Version]
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.
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.
[Published Version]
View
| DOI
| Download Published Version (ext.)
H. Edelsbrunner, Discrete & Computational Geometry 4 (1989) 337–343.
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.
[Published Version]
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: 4093
The complexity of cutting complexes
B. Chazelle, H. Edelsbrunner, L. Guibas, Discrete & Computational Geometry 4 (1989) 139–181.
View
| DOI
| Download None (ext.)
B. Chazelle, H. Edelsbrunner, L. Guibas, Discrete & Computational Geometry 4 (1989) 139–181.
1987 | Journal Article | IST-REx-ID: 4100
Linear space data structures for two types of range search
B. Chazelle, H. Edelsbrunner, Discrete & Computational Geometry 2 (1987) 113–126.
View
| DOI
B. Chazelle, H. Edelsbrunner, Discrete & Computational Geometry 2 (1987) 113–126.
1986 | Journal Article | IST-REx-ID: 4108
Voronoi diagrams and arrangements
H. Edelsbrunner, R. Seidel, Discrete & Computational Geometry 1 (1986) 25–44.
View
| DOI
H. Edelsbrunner, R. Seidel, Discrete & Computational Geometry 1 (1986) 25–44.