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


2022 | Journal Article | IST-REx-ID: 11593 | OA
Fulek, Radoslav, and Jan Kynčl. “The Z2-Genus of Kuratowski Minors.” Discrete and Computational Geometry. Springer Nature, 2022. https://doi.org/10.1007/s00454-022-00412-w.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Journal Article | IST-REx-ID: 11446
Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.” Discrete & Computational Geometry. Springer Nature, 2021. https://doi.org/10.1007/s00454-021-00299-z.
[Preprint] View | Files available | DOI | arXiv
 

2021 | Journal Article | IST-REx-ID: 9317 | OA
Edelsbrunner, Herbert, and Georg F Osang. “The Multi-Cover Persistence of Euclidean Balls.” Discrete and Computational Geometry. Springer Nature, 2021. https://doi.org/10.1007/s00454-021-00281-9.
[Published Version] View | Files available | DOI | WoS
 

2021 | Journal Article | IST-REx-ID: 8940 | OA
Boissonnat, Jean-Daniel, Siargey Kachanovich, and Mathijs Wintraecken. “Triangulating Submanifolds: An Elementary and Quantified Version of Whitney’s Method.” Discrete & Computational Geometry. Springer Nature, 2021. https://doi.org/10.1007/s00454-020-00250-8.
[Published Version] View | Files available | DOI | WoS
 

2021 | Journal Article | IST-REx-ID: 8338 | OA
Akopyan, Arseniy, Alexander I. Bobenko, Wolfgang K. Schief, and Jan Techter. “On Mutually Diagonal Nets on (Confocal) Quadrics and 3-Dimensional Webs.” Discrete and Computational Geometry. Springer Nature, 2021. https://doi.org/10.1007/s00454-020-00240-w.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Journal Article | IST-REx-ID: 8248 | OA
Boissonnat, Jean-Daniel, Ramsay Dyer, Arijit Ghosh, Andre Lieutier, and Mathijs Wintraecken. “Local Conditions for Triangulating Submanifolds of Euclidean Space.” Discrete and Computational Geometry. Springer Nature, 2021. https://doi.org/10.1007/s00454-020-00233-9.
[Published Version] View | DOI | Download Published Version (ext.) | WoS
 

2021 | Journal Article | IST-REx-ID: 7905 | OA
Brown, Adam, and Bei Wang. “Sheaf-Theoretic Stratification Learning from Geometric and Topological Perspectives.” Discrete and Computational Geometry. Springer Nature, 2021. https://doi.org/10.1007/s00454-020-00206-y.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2019 | Journal Article | IST-REx-ID: 5986 | OA
Lubiw, Anna, Zuzana Masárová, and Uli Wagner. “A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations.” Discrete & Computational Geometry. Springer Nature, 2019. https://doi.org/10.1007/s00454-018-0035-8.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2013 | Journal Article | IST-REx-ID: 2815 | OA
Edelsbrunner, Herbert, Brittany Terese Fasy, and Günter Rote. “Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.” Discrete & Computational Geometry. Springer, 2013. https://doi.org/10.1007/s00454-013-9517-x.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

1991 | Journal Article | IST-REx-ID: 4061 | OA
Agarwal, Pankaj, Herbert Edelsbrunner, Otfried Schwarzkopf, and Emo Welzl. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.” Discrete & Computational Geometry. Springer, 1991. https://doi.org/10.1007/BF02574698.
[Published Version] View | DOI | Download Published Version (ext.)
 

1991 | Journal Article | IST-REx-ID: 4062 | OA
Aronov, Boris, Bernard Chazelle, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Rephael Wenger. “Points and Triangles in the Plane and Halving Planes in Space.” Discrete & Computational Geometry. Springer, 1991. https://doi.org/10.1007/BF02574700.
[Published Version] View | DOI | Download Published Version (ext.)
 

1990 | Journal Article | IST-REx-ID: 4066
Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Complexity of Many Cells in Arrangements of Planes and Related Problems.” Discrete & Computational Geometry. Springer, 1990. https://doi.org/10.1007/BF02187785.
View | DOI | Download None (ext.)
 

1990 | Journal Article | IST-REx-ID: 4072
Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.” Discrete & Computational Geometry. Springer, 1990. https://doi.org/10.1007/BF02187784.
View | DOI | Download None (ext.)
 

1990 | Journal Article | IST-REx-ID: 4068
Edelsbrunner, Herbert, and Micha Sharir. “The Maximum Number of Ways to Stabn Convex Nonintersecting Sets in the Plane Is 2n−2.” Discrete & Computational Geometry. Springer, 1990. https://doi.org/10.1007/BF02187778.
View | DOI | Download None (ext.)
 

1990 | Journal Article | IST-REx-ID: 4074
Clarkson, Kenneth, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Emo Welzl. “Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.” Discrete & Computational Geometry. Springer, 1990. https://doi.org/10.1007/BF02187783.
View | DOI | Download None (ext.)
 

1989 | Journal Article | IST-REx-ID: 4088 | OA
Edelsbrunner, Herbert, Leonidas Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, and Emo Welzl. “Implicitly Representing Arrangements of Lines or Segments.” Discrete & Computational Geometry. Springer, 1989. https://doi.org/10.1007/BF02187742.
[Published Version] View | DOI | Download Published Version (ext.)
 

1989 | Journal Article | IST-REx-ID: 4089 | OA
Edelsbrunner, Herbert, Leonidas Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, and Jack Snoeyink. “On Arrangements of Jordan Arcs with Three Intersections per Pair.” Discrete & Computational Geometry. Springer, 1989. https://doi.org/10.1007/BF02187745.
[Published Version] View | DOI | Download Published Version (ext.)
 

1989 | Journal Article | IST-REx-ID: 4086 | OA
Edelsbrunner, Herbert. “The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces .” Discrete & Computational Geometry. Springer, 1989. https://doi.org/10.1007/BF02187734.
[Published Version] View | DOI | Download Published Version (ext.)
 

1989 | Journal Article | IST-REx-ID: 4081 | OA
Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.” Discrete & Computational Geometry. Springer, 1989. https://doi.org/10.1007/BF02187733.
[Published Version] View | DOI | Download Published Version (ext.)
 

1989 | Journal Article | IST-REx-ID: 4093
Chazelle, Bernard, Herbert Edelsbrunner, and Leonidas Guibas. “The Complexity of Cutting Complexes.” Discrete & Computational Geometry. Springer, 1989. https://doi.org/10.1007/BF02187720.
View | DOI | Download None (ext.)
 

Filters and Search Terms

eissn=1432-0444

Search

Filter Publications