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.
32 Publications
2023 | Journal Article | IST-REx-ID: 12287 | 
Boissonnat J-D, Dyer R, Ghosh A, Wintraecken M. Local criteria for triangulating general manifolds. Discrete & Computational Geometry. 2023;69:156-191. doi:10.1007/s00454-022-00431-7
[Published Version]
View
| Files available
| DOI
| WoS
2023 | Journal Article | IST-REx-ID: 11999 |
Arroyo Guevara AM, Klute F, Parada I, Vogtenhuber B, Seidel R, Wiedera T. Inserting one edge into a simple drawing is hard. Discrete and Computational Geometry. 2023;69:745–770. doi:10.1007/s00454-022-00394-9
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2023 | Journal Article | IST-REx-ID: 12764 |
Kourimska H. Discrete yamabe problem for polyhedral surfaces. Discrete and Computational Geometry. 2023;70:123-153. doi:10.1007/s00454-023-00484-2
[Published Version]
View
| Files available
| DOI
| WoS
2023 | Journal Article | IST-REx-ID: 12709 |
Corbet R, Kerber M, Lesnick M, Osang GF. Computing the multicover bifiltration. Discrete and Computational Geometry. 2023;70:376-405. doi:10.1007/s00454-022-00476-8
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2023 | Journal Article | IST-REx-ID: 13974 |
Fulek R, Gärtner B, Kupavskii A, Valtr P, Wagner U. The crossing Tverberg theorem. Discrete and Computational Geometry. 2023. doi:10.1007/s00454-023-00532-x
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2023 | Journal Article | IST-REx-ID: 14345 |
Edelsbrunner H, Garber A, Ghafari M, Heiss T, Saghafian M. On angles in higher order Brillouin tessellations and related tilings in the plane. Discrete and Computational Geometry. 2023. doi:10.1007/s00454-023-00566-1
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
2023 | Journal Article | IST-REx-ID: 13270 |
Brunck FR. Iterated medial triangle subdivision in surfaces of constant curvature. Discrete and Computational Geometry. 2023;70(3):1059-1089. doi:10.1007/s00454-023-00500-5
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2022 | Journal Article | IST-REx-ID: 10773 |
Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. Continuous and discrete radius functions on Voronoi tessellations and Delaunay mosaics. Discrete and Computational Geometry. 2022;67:811-842. doi:10.1007/s00454-022-00371-2
[Published Version]
View
| Files available
| DOI
| WoS
2022 | Journal Article | IST-REx-ID: 10776 |
Patakova Z, Tancer M, Wagner U. Barycentric cuts through a convex body. Discrete and Computational Geometry. 2022;68:1133-1154. doi:10.1007/s00454-021-00364-7
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Journal Article | IST-REx-ID: 12129 |
Wagner U, Welzl E. Connectivity of triangulation flip graphs in the plane. Discrete & Computational Geometry. 2022;68(4):1227-1284. doi:10.1007/s00454-022-00436-2
[Published Version]
View
| Files available
| DOI
| WoS
2022 | Journal Article | IST-REx-ID: 11593 |
Fulek R, Kynčl J. The Z2-Genus of Kuratowski minors. Discrete and Computational Geometry. 2022;68:425-447. doi:10.1007/s00454-022-00412-w
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Journal Article | IST-REx-ID: 11446
Avvakumov S, Kudrya S. Vanishing of all equivariant obstructions and the mapping degree. Discrete & Computational Geometry. 2021;66(3):1202-1216. doi:10.1007/s00454-021-00299-z
[Preprint]
View
| Files available
| DOI
| arXiv
2021 | Journal Article | IST-REx-ID: 9317 |
Edelsbrunner H, Osang GF. The multi-cover persistence of Euclidean balls. Discrete and Computational Geometry. 2021;65:1296–1313. doi:10.1007/s00454-021-00281-9
[Published Version]
View
| Files available
| DOI
| WoS
2021 | Journal Article | IST-REx-ID: 8940 |
Boissonnat J-D, Kachanovich S, Wintraecken M. Triangulating submanifolds: An elementary and quantified version of Whitney’s method. Discrete & Computational Geometry. 2021;66(1):386-434. doi:10.1007/s00454-020-00250-8
[Published Version]
View
| Files available
| DOI
| WoS
2021 | Journal Article | IST-REx-ID: 8338 |
Akopyan A, Bobenko AI, Schief WK, Techter J. On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs. Discrete and Computational Geometry. 2021;66:938-976. doi:10.1007/s00454-020-00240-w
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Journal Article | IST-REx-ID: 8248 |
Boissonnat J-D, Dyer R, Ghosh A, Lieutier A, Wintraecken M. Local conditions for triangulating submanifolds of Euclidean space. Discrete and Computational Geometry. 2021;66:666-686. doi:10.1007/s00454-020-00233-9
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
2021 | Journal Article | IST-REx-ID: 7905 |
Brown A, Wang B. Sheaf-theoretic stratification learning from geometric and topological perspectives. Discrete and Computational Geometry. 2021;65:1166-1198. doi:10.1007/s00454-020-00206-y
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2019 | Journal Article | IST-REx-ID: 5986 |
Lubiw A, Masárová Z, Wagner U. A proof of the orbit conjecture for flipping edge-labelled triangulations. Discrete & Computational Geometry. 2019;61(4):880-898. doi:10.1007/s00454-018-0035-8
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2013 | Journal Article | IST-REx-ID: 2815 |
Edelsbrunner H, Fasy BT, Rote G. Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. Discrete & Computational Geometry. 2013;49(4):797-822. doi:10.1007/s00454-013-9517-x
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
1991 | Journal Article | IST-REx-ID: 4061 |
Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete & Computational Geometry. 1991;6(1):407-422. doi:10.1007/BF02574698
[Published Version]
View
| DOI
| Download Published Version (ext.)
1991 | Journal Article | IST-REx-ID: 4062 |
Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. Points and triangles in the plane and halving planes in space. Discrete & Computational Geometry. 1991;6(1):435-442. doi:10.1007/BF02574700
[Published Version]
View
| DOI
| Download Published Version (ext.)
1990 | Journal Article | IST-REx-ID: 4066
Edelsbrunner H, Guibas L, Sharir M. The complexity of many cells in arrangements of planes and related problems. Discrete & Computational Geometry. 1990;5(1):197-216. doi:10.1007/BF02187785
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4072
Edelsbrunner H, Guibas L, Sharir M. The complexity and construction of many faces in arrangements of lines and of segments. Discrete & Computational Geometry. 1990;5(1):161-196. doi:10.1007/BF02187784
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4068
Edelsbrunner H, Sharir M. The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2. Discrete & Computational Geometry. 1990;5(1):35-42. doi:10.1007/BF02187778
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4074
Clarkson K, Edelsbrunner H, Guibas L, Sharir M, Welzl E. Combinatorial complexity bounds for arrangements of curves and spheres. Discrete & Computational Geometry. 1990;5(1):99-160. doi:10.1007/BF02187783
View
| DOI
| Download None (ext.)
1989 | Journal Article | IST-REx-ID: 4088 |
Edelsbrunner H, Guibas L, Hershberger J, et al. Implicitly representing arrangements of lines or segments. Discrete & Computational Geometry. 1989;4(1):433-466. doi:10.1007/BF02187742
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4089 |
Edelsbrunner H, Guibas L, Hershberger J, et al. On arrangements of Jordan arcs with three intersections per pair. Discrete & Computational Geometry. 1989;4(1):523-539. doi:10.1007/BF02187745
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4086 |
Edelsbrunner H. The upper envelope of piecewise linear functions: Tight bounds on the number of faces . Discrete & Computational Geometry. 1989;4(4):337-343. doi:10.1007/BF02187734
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4081 |
Edelsbrunner H, Guibas L, Sharir M. The upper envelope of piecewise linear functions: Algorithms and applications. Discrete & Computational Geometry. 1989;4(1):311-336. doi:10.1007/BF02187733
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4093
Chazelle B, Edelsbrunner H, Guibas L. The complexity of cutting complexes. Discrete & Computational Geometry. 1989;4(1):139-181. doi:10.1007/BF02187720
View
| DOI
| Download None (ext.)
1987 | Journal Article | IST-REx-ID: 4100
Chazelle B, Edelsbrunner H. Linear space data structures for two types of range search. Discrete & Computational Geometry. 1987;2(1):113-126. doi:10.1007/BF02187875
View
| DOI
1986 | Journal Article | IST-REx-ID: 4108
Edelsbrunner H, Seidel R. Voronoi diagrams and arrangements. Discrete & Computational Geometry. 1986;1(1):25-44. doi:10.1007/BF02187681
View
| DOI