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 |
J.-D. Boissonnat, R. Dyer, A. Ghosh, and M. Wintraecken, “Local criteria for triangulating general manifolds,” Discrete & Computational Geometry, vol. 69. Springer Nature, pp. 156–191, 2023.
[Published Version]
View
| Files available
| DOI
| WoS
2023 | Journal Article | IST-REx-ID: 11999 |
A. M. Arroyo Guevara, F. Klute, I. Parada, B. Vogtenhuber, R. Seidel, and T. Wiedera, “Inserting one edge into a simple drawing is hard,” Discrete and Computational Geometry, vol. 69. Springer Nature, pp. 745–770, 2023.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2023 | Journal Article | IST-REx-ID: 12764 |
H. Kourimska, “Discrete yamabe problem for polyhedral surfaces,” Discrete and Computational Geometry, vol. 70. Springer Nature, pp. 123–153, 2023.
[Published Version]
View
| Files available
| DOI
| WoS
2023 | Journal Article | IST-REx-ID: 12709 |
R. Corbet, M. Kerber, M. Lesnick, and G. F. Osang, “Computing the multicover bifiltration,” Discrete and Computational Geometry, vol. 70. Springer Nature, pp. 376–405, 2023.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2023 | Journal Article | IST-REx-ID: 13974 |
R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, and U. Wagner, “The crossing Tverberg theorem,” Discrete and Computational Geometry. Springer Nature, 2023.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2023 | Journal Article | IST-REx-ID: 14345 |
H. Edelsbrunner, A. Garber, M. Ghafari, T. Heiss, and M. Saghafian, “On angles in higher order Brillouin tessellations and related tilings in the plane,” Discrete and Computational Geometry. Springer Nature, 2023.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
2023 | Journal Article | IST-REx-ID: 13270 |
F. R. Brunck, “Iterated medial triangle subdivision in surfaces of constant curvature,” Discrete and Computational Geometry, vol. 70, no. 3. Springer Nature, pp. 1059–1089, 2023.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2022 | Journal Article | IST-REx-ID: 10773 |
R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, and M. Saghafian, “Continuous and discrete radius functions on Voronoi tessellations and Delaunay mosaics,” Discrete and Computational Geometry, vol. 67. Springer Nature, pp. 811–842, 2022.
[Published Version]
View
| Files available
| DOI
| WoS
2022 | Journal Article | IST-REx-ID: 10776 |
Z. Patakova, M. Tancer, and U. Wagner, “Barycentric cuts through a convex body,” Discrete and Computational Geometry, vol. 68. Springer Nature, pp. 1133–1154, 2022.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Journal Article | IST-REx-ID: 12129 |
U. Wagner and E. Welzl, “Connectivity of triangulation flip graphs in the plane,” Discrete & Computational Geometry, vol. 68, no. 4. Springer Nature, pp. 1227–1284, 2022.
[Published Version]
View
| Files available
| DOI
| WoS
2022 | Journal Article | IST-REx-ID: 11593 |
R. Fulek and J. Kynčl, “The Z2-Genus of Kuratowski minors,” Discrete and Computational Geometry, vol. 68. Springer Nature, pp. 425–447, 2022.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Journal Article | IST-REx-ID: 11446
S. Avvakumov and S. Kudrya, “Vanishing of all equivariant obstructions and the mapping degree,” Discrete & Computational Geometry, vol. 66, no. 3. Springer Nature, pp. 1202–1216, 2021.
[Preprint]
View
| Files available
| DOI
| arXiv
2021 | Journal Article | IST-REx-ID: 9317 |
H. Edelsbrunner and G. F. Osang, “The multi-cover persistence of Euclidean balls,” Discrete and Computational Geometry, vol. 65. Springer Nature, pp. 1296–1313, 2021.
[Published Version]
View
| Files available
| DOI
| WoS
2021 | Journal Article | IST-REx-ID: 8940 |
J.-D. Boissonnat, S. Kachanovich, and M. Wintraecken, “Triangulating submanifolds: An elementary and quantified version of Whitney’s method,” Discrete & Computational Geometry, vol. 66, no. 1. Springer Nature, pp. 386–434, 2021.
[Published Version]
View
| Files available
| DOI
| WoS
2021 | Journal Article | IST-REx-ID: 8338 |
A. Akopyan, A. I. Bobenko, W. K. Schief, and J. Techter, “On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs,” Discrete and Computational Geometry, vol. 66. Springer Nature, pp. 938–976, 2021.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Journal Article | IST-REx-ID: 8248 |
J.-D. Boissonnat, R. Dyer, A. Ghosh, A. Lieutier, and M. Wintraecken, “Local conditions for triangulating submanifolds of Euclidean space,” Discrete and Computational Geometry, vol. 66. Springer Nature, pp. 666–686, 2021.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
2021 | Journal Article | IST-REx-ID: 7905 |
A. Brown and B. Wang, “Sheaf-theoretic stratification learning from geometric and topological perspectives,” Discrete and Computational Geometry, vol. 65. Springer Nature, pp. 1166–1198, 2021.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2019 | Journal Article | IST-REx-ID: 5986 |
A. Lubiw, Z. Masárová, and U. Wagner, “A proof of the orbit conjecture for flipping edge-labelled triangulations,” Discrete & Computational Geometry, vol. 61, no. 4. Springer Nature, pp. 880–898, 2019.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2013 | Journal Article | IST-REx-ID: 2815 |
H. Edelsbrunner, B. T. Fasy, and G. Rote, “Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions,” Discrete & Computational Geometry, vol. 49, no. 4. Springer, pp. 797–822, 2013.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
1995 | Journal Article | IST-REx-ID: 4035
B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, M. Sharir, and E. Welzl, “Improved bounds on weak ε-nets for convex sets,” Discrete & Computational Geometry, vol. 13, no. 1. Springer, pp. 1–15, 1995.
View
| DOI
| Download None (ext.)
1995 | Journal Article | IST-REx-ID: 4028 |
H. Edelsbrunner, “The union of balls and its dual shape,” Discrete & Computational Geometry, vol. 13, no. 1. Springer, pp. 415–440, 1995.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1994 | Journal Article | IST-REx-ID: 4032
T. Dey and H. Edelsbrunner, “Counting triangle crossings and halving planes,” Discrete & Computational Geometry, vol. 12, no. 1. Springer, pp. 281–289, 1994.
View
| DOI
| Download None (ext.)
1993 | Journal Article | IST-REx-ID: 4040
H. Edelsbrunner and T. Tan, “An upper bound for conforming Delaunay triangulations,” Discrete & Computational Geometry, vol. 10, no. 1. Springer, pp. 197–213, 1993.
View
| DOI
| Download None (ext.)
1993 | Journal Article | IST-REx-ID: 4044
M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, and T. Tan, “Edge insertion for optimal triangulations,” Discrete & Computational Geometry, vol. 10, no. 1. Springer, pp. 47–65, 1993.
View
| DOI
| Download None (ext.)
1993 | Journal Article | IST-REx-ID: 4045
B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, “Diameter, width, closest line pair, and parametric searching,” Discrete & Computational Geometry, vol. 10, no. 1. Springer, pp. 183–196, 1993.
View
| DOI
| Download None (ext.)
1991 | Journal Article | IST-REx-ID: 4061 |
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl, “Euclidean minimum spanning trees and bichromatic closest pairs,” Discrete & Computational Geometry, vol. 6, no. 1. Springer, pp. 407–422, 1991.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1991 | Journal Article | IST-REx-ID: 4062 |
B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and R. Wenger, “Points and triangles in the plane and halving planes in space,” Discrete & Computational Geometry, vol. 6, no. 1. Springer, pp. 435–442, 1991.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1990 | Journal Article | IST-REx-ID: 4066
H. Edelsbrunner, L. Guibas, and M. Sharir, “The complexity of many cells in arrangements of planes and related problems,” Discrete & Computational Geometry, vol. 5, no. 1. Springer, pp. 197–216, 1990.
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4072
H. Edelsbrunner, L. Guibas, and M. Sharir, “The complexity and construction of many faces in arrangements of lines and of segments,” Discrete & Computational Geometry, vol. 5, no. 1. Springer, pp. 161–196, 1990.
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4068
H. Edelsbrunner and M. Sharir, “The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2,” Discrete & Computational Geometry, vol. 5, no. 1. Springer, pp. 35–42, 1990.
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4074
K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, and E. Welzl, “Combinatorial complexity bounds for arrangements of curves and spheres,” Discrete & Computational Geometry, vol. 5, no. 1. Springer, pp. 99–160, 1990.
View
| DOI
| Download None (ext.)
1989 | Journal Article | IST-REx-ID: 4088 |
H. Edelsbrunner et al., “Implicitly representing arrangements of lines or segments,” Discrete & Computational Geometry, vol. 4, no. 1. Springer, pp. 433–466, 1989.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4089 |
H. Edelsbrunner et al., “On arrangements of Jordan arcs with three intersections per pair,” Discrete & Computational Geometry, vol. 4, no. 1. Springer, pp. 523–539, 1989.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4086 |
H. Edelsbrunner, “The upper envelope of piecewise linear functions: Tight bounds on the number of faces ,” Discrete & Computational Geometry, vol. 4, no. 4. Springer, pp. 337–343, 1989.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4081 |
H. Edelsbrunner, L. Guibas, and M. Sharir, “The upper envelope of piecewise linear functions: Algorithms and applications,” Discrete & Computational Geometry, vol. 4, no. 1. Springer, pp. 311–336, 1989.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4093
B. Chazelle, H. Edelsbrunner, and L. Guibas, “The complexity of cutting complexes,” Discrete & Computational Geometry, vol. 4, no. 1. Springer, pp. 139–181, 1989.
View
| DOI
| Download None (ext.)