279 Publications

Mark all

[279]
2019 | Conference Paper | IST-REx-ID: 6648   OA
Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Topological Data Analysis in Information Space.” In 35th International Symposium on Computational Geometry, 129:31:1-31:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.SOCG.2019.31.
View | Files available | DOI | arXiv
 
[278]
2019 | Journal Article | IST-REx-ID: 6756   OA
Pranav, Pratyush, Robert J. Adler, Thomas Buchert, Herbert Edelsbrunner, Bernard J.T. Jones, Armin Schwartzman, Hubert Wagner, and Rien Van De Weygaert. “Unexpected Topology of the Temperature Fluctuations in the Cosmic Microwave Background.” Astronomy and Astrophysics 627 (2019). https://doi.org/10.1051/0004-6361/201834916.
View | Files available | DOI | arXiv
 
[277]
2019 | Journal Article | IST-REx-ID: 6608   OA
Edelsbrunner, Herbert, and Katharina Ölsböck. “Holes and Dependences in an Ordered Complex.” Computer Aided Geometric Design 73 (2019): 1–15. https://doi.org/10.1016/j.cagd.2019.06.003.
View | Files available | DOI
 
[276]
2018 | Journal Article | IST-REx-ID: 530   OA
Edelsbrunner, Herbert, and Mabel Iglesias Ham. “Multiple Covers with Balls I: Inclusion–Exclusion.” Computational Geometry: Theory and Applications 68 (2018): 119–33. https://doi.org/10.1016/j.comgeo.2017.06.014.
View | Files available | DOI
 
[275]
2018 | Conference Paper | IST-REx-ID: 187   OA
Edelsbrunner, Herbert, and Georg F Osang. “The Multi-Cover Persistence of Euclidean Balls,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.34.
View | Files available | DOI
 
[274]
2018 | Conference Paper | IST-REx-ID: 188   OA
Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Smallest Enclosing Spheres and Chernoff Points in Bregman Geometry,” 99:35:1-35:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.35.
View | Files available | DOI
 
[273]
2018 | Journal Article | IST-REx-ID: 87   OA
Edelsbrunner, Herbert, and Anton Nikitenko. “Random Inscribed Polytopes Have Similar Radius Functions as Poisson-Delaunay Mosaics.” Annals of Applied Probability 28, no. 5 (2018): 3215–38. https://doi.org/10.1214/18-AAP1389.
View | Files available | DOI | Download (ext.) | arXiv
 
[272]
2018 | Journal Article | IST-REx-ID: 312
Edelsbrunner, Herbert, and Mabel Iglesias Ham. “On the Optimality of the FCC Lattice for Soft Sphere Packing.” SIAM J Discrete Math 32, no. 1 (2018): 750–82. https://doi.org/10.1137/16M1097201.
View | DOI
 
[271]
2018 | Journal Article | IST-REx-ID: 5678   OA
Edelsbrunner, Herbert, and Anton Nikitenko. “Poisson–Delaunay Mosaics of Order K.” Discrete and Computational Geometry, 2018. https://doi.org/10.1007/s00454-018-0049-2.
View | Files available | DOI
 
[270]
2017 | Journal Article | IST-REx-ID: 1022   OA
Pranav, Pratyush, Herbert Edelsbrunner, Rien Van De Weygaert, Gert Vegter, Michael Kerber, Bernard Jones, and Mathijs Wintraecken. “The Topology of the Cosmic Web in Terms of Persistent Betti Numbers.” Monthly Notices of the Royal Astronomical Society 465, no. 4 (2017): 4281–4310. https://doi.org/10.1093/mnras/stw2862.
View | DOI | Download (ext.)
 
[269]
2017 | Journal Article | IST-REx-ID: 1173   OA
Edelsbrunner, Herbert, Alexey Glazyrin, Oleg Musin, and Anton Nikitenko. “The Voronoi Functional Is Maximized by the Delaunay Triangulation in the Plane.” Combinatorica 37, no. 5 (2017): 887–910. https://doi.org/10.1007/s00493-016-3308-y.
View | DOI | Download (ext.)
 
[268]
2017 | Journal Article | IST-REx-ID: 718   OA
Edelsbrunner, Herbert, Anton Nikitenko, and Matthias Reitzner. “Expected Sizes of Poisson Delaunay Mosaics and Their Discrete Morse Functions.” Advances in Applied Probability 49, no. 3 (2017): 745–67. https://doi.org/10.1017/apr.2017.20.
View | Files available | DOI | Download (ext.) | arXiv
 
[267]
2017 | Journal Article | IST-REx-ID: 1072   OA
Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Complexes.” Transactions of the American Mathematical Society 369, no. 5 (2017): 3741–62.
View | Download (ext.)
 
[266]
2017 | Conference Paper | IST-REx-ID: 688   OA
Edelsbrunner, Herbert, and Hubert Wagner. “Topological Data Analysis with Bregman Divergences,” 77:391–3916. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.SoCG.2017.39.
View | Files available | DOI
 
[265]
2017 | Preprint | IST-REx-ID: 6288   OA
Edelsbrunner, Herbert, and Anton Nikitenko. “Poisson-Delaunay Mosaics of Order K.” ArXiv:1709.09380, n.d.
View | Download (ext.) | arXiv
 
[264]
2017 | Book Chapter | IST-REx-ID: 84
Edelsbrunner, Herbert, and Patrice Koehl. “Computational Topology for Structural Molecular Biology.” In Handbook of Discrete and Computational Geometry, Third Edition, edited by Csaba Toth, Joseph O’Rourke, and Jacob Goodman, 1709–35. Handbook of Discrete and Computational Geometry. CRC Press, 2017. https://doi.org/10.1201/9781315119601.
View | DOI
 
[263]
2016 | Journal Article | IST-REx-ID: 1662   OA
Edelsbrunner, Herbert, and Florian Pausinger. “Approximation and Convergence of the Intrinsic Volume.” Advances in Mathematics 287 (2016): 674–703. https://doi.org/10.1016/j.aim.2015.10.004.
View | Files available | DOI
 
[262]
2016 | Journal Article | IST-REx-ID: 1295
Edelsbrunner, Herbert, and Mabel Iglesias Ham. “Multiple Covers with Balls II: Weighted Averages.” Electronic Notes in Discrete Mathematics 54 (2016): 169–74. https://doi.org/10.1016/j.endm.2016.09.030.
View | DOI
 
[261]
2016 | Journal Article | IST-REx-ID: 1289
Dunaeva, Olga, Herbert Edelsbrunner, Anton Lukyanov, Michael Machin, Daria Malkova, Roman Kuvaev, and Sergey Kashin. “The Classification of Endoscopy Images with Persistent Homology.” Pattern Recognition Letters 83, no. 1 (2016): 13–22. https://doi.org/10.1016/j.patrec.2015.12.012.
View | Files available | DOI
 
[260]
2015 | Journal Article | IST-REx-ID: 1793   OA
Symonova, Olga, Christopher Topp, and Herbert Edelsbrunner. “DynamicRoots: A Software Platform for the Reconstruction and Analysis of Growing Plant Roots.” PLoS One 10, no. 6 (2015). https://doi.org/10.1371/journal.pone.0127657.
View | Files available | DOI
 
[259]
2015 | Journal Article | IST-REx-ID: 3585
Cao, Thanh, Herbert Edelsbrunner, and Tiow Tan. “Proof of Correctness of the Digital Delaunay Triangulation Algorithm.” Computational Geometry: Theory and Applications 48, no. 7 (2015): 507–19. https://doi.org/10.1016/j.comgeo.2015.04.001.
View | DOI
 
[258]
2015 | Conference Paper | IST-REx-ID: 1495   OA
Edelsbrunner, Herbert, Mabel Iglesias Ham, and Vitaliy Kurlin. “Relaxed Disk Packing.” In Proceedings of the 27th Canadian Conference on Computational Geometry, 2015–August:128–35. Queen’s University, 2015.
View | Download (ext.)
 
[257]
2015 | Journal Article | IST-REx-ID: 1578
Cao, Thanhtung, Herbert Edelsbrunner, and Tiowseng Tan. “Triangulations from Topologically Correct Digital Voronoi Diagrams.” Computational Geometry 48, no. 7 (2015): 507–19. https://doi.org/10.1016/j.comgeo.2015.04.001.
View | DOI
 
[256]
2015 | Conference Paper | IST-REx-ID: 1567
Edelsbrunner, Herbert. “Shape, Homology, Persistence, and Stability.” Lecture Notes in Computer Science. Springer, 2015.
View
 
[255]
2015 | Conference Paper | IST-REx-ID: 1568
Dunaeva, Olga, Herbert Edelsbrunner, Anton Lukyanov, Michael Machin, and Daria Malkova. “The Classification of Endoscopy Images with Persistent Homology.” In Proceedings - 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 7034731. IEEE, 2015. https://doi.org/10.1109/SYNASC.2014.81.
View | Files available | DOI
 
[254]
2015 | Journal Article | IST-REx-ID: 2035   OA
Edelsbrunner, Herbert, Grzegorz Jablonski, and Marian Mrozek. “The Persistent Homology of a Self-Map.” Foundations of Computational Mathematics 15, no. 5 (2015): 1213–44. https://doi.org/10.1007/s10208-014-9223-y.
View | Files available | DOI
 
[253]
2014 | Conference Paper | IST-REx-ID: 2905   OA
Edelsbrunner, Herbert, and Dmitriy Morozovy. “Persistent Homology: Theory and Practice,” 31–50. European Mathematical Society Publishing House, 2014. https://doi.org/10.4171/120-1/3.
View | Files available | DOI
 
[252]
2014 | Journal Article | IST-REx-ID: 1876   OA
Dolbilin, Nikolai, Herbert Edelsbrunner, Alexey Glazyrin, and Oleg Musin. “Functionals on Triangulations of Delaunay Sets.” Moscow Mathematical Journal 14, no. 3 (2014): 491–504.
View | Download (ext.)
 
[251]
2014 | Conference Paper | IST-REx-ID: 2177
Edelsbrunner, Herbert, and Salman Parsa. “On the Computational Complexity of Betti Numbers Reductions from Matrix Rank.” In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 152–60. SIAM, 2014. https://doi.org/10.1137/1.9781611973402.11.
View | DOI
 
[250]
2014 | Journal Article | IST-REx-ID: 2255
Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.” Journal of Mathematical Imaging and Vision 50, no. 1 (2014): 164–77. https://doi.org/10.1007/s10851-013-0468-x.
View | Files available | DOI
 
[249]
2014 | Journal Article | IST-REx-ID: 1929
Alexeev, V V, V G Bogaevskaya, M M Preobrazhenskaya, A Y Ukhalov, Herbert Edelsbrunner, and Olga Yakimova. “An Algorithm for Cartographic Generalization That Preserves Global Topology.” Journal of Mathematical Sciences (United States) 203, no. 6 (2014): 754–60. https://doi.org/10.1007/s10958-014-2165-8.
View | DOI
 
[248]
2014 | Conference Paper | IST-REx-ID: 2155   OA
Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Filtrations.” In Proceedings of the Annual Symposium on Computational Geometry, 484–90. ACM, 2014. https://doi.org/10.1145/2582112.2582167.
View | DOI | Download (ext.)
 
[247]
2013 | Journal Article | IST-REx-ID: 2859   OA
Bendich, Paul, Herbert Edelsbrunner, Dmitriy Morozov, and Amit Patel. “Homology and Robustness of Level and Interlevel Sets.” Homology, Homotopy and Applications 15, no. 1 (2013): 51–72. https://doi.org/10.4310/HHA.2013.v15.n1.a3.
View | DOI | Download (ext.) | arXiv
 
[246]
2013 | Conference Paper | IST-REx-ID: 2843
Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.” In 17th IAPR International Conference on Discrete Geometry for Computer Imagery, 7749:XV–XIX. Springer, 2013. https://doi.org/10.1007/978-3-642-37067-0.
View | Files available | DOI
 
[245]
2013 | Conference Paper | IST-REx-ID: 2906   OA
Kerber, Michael, and Herbert Edelsbrunner. “3D Kinetic Alpha Complexes and Their Implementation.” In 2013 Proceedings of the 15th Workshop on Algorithm Engineering and Experiments, 70–77. Society of Industrial and Applied Mathematics, 2013. https://doi.org/10.1137/1.9781611972931.6.
View | Files available | DOI
 
[244]
2013 | Journal Article | IST-REx-ID: 2887   OA
Fang, Suqin, Randy Clark, Ying Zheng, Anjali Iyer Pascuzzi, Joshua Weitz, Leon Kochian, Herbert Edelsbrunner, Hong Liao, and Philip Benfey. “Genotypic Recognition and Spatial Responses by Rice Roots.” PNAS 110, no. 7 (2013): 2670–75. https://doi.org/10.1073/pnas.1222821110.
View | DOI | Download (ext.)
 
[243]
2013 | Journal Article | IST-REx-ID: 2822   OA
Topp, Christopher, Anjali Iyer Pascuzzi, Jill Anderson, Cheng Lee, Paul Zurek, Olga Symonova, Ying Zheng, et al. “3D Phenotyping and Quantitative Trait Locus Mapping Identify Core Regions of the Rice Genome Controlling Root Architecture.” PNAS 110, no. 18 (2013): E1695–1704. https://doi.org/10.1073/pnas.1304354110.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[242]
2013 | Journal Article | IST-REx-ID: 2815
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 49, no. 4 (2013): 797–822. https://doi.org/10.1007/s00454-013-9517-x.
View | Files available | DOI
 
[241]
2012 | Journal Article | IST-REx-ID: 2912
Edelsbrunner, Herbert, and Nataliya Strelkova. “Configuration Space for Shortest Networks .” Uspekhi Mat. Nauk 67, no. 6 (2012): 203–4. https://doi.org/10.4213/rm9503.
View | DOI
 
[240]
2012 | Journal Article | IST-REx-ID: 3256   OA
Edelsbrunner, Herbert, and Michael Kerber. “Dual Complexes of Cubical Subdivisions of ℝn.” Discrete & Computational Geometry 47, no. 2 (2012): 393–414. https://doi.org/10.1007/s00454-011-9382-4.
View | Files available | DOI
 
[239]
2012 | Journal Article | IST-REx-ID: 3310   OA
Bendich, Paul, Sergio Cabello, and Herbert Edelsbrunner. “A Point Calculus for Interlevel Set Homology.” Pattern Recognition Letters 33, no. 11 (2012): 1436–44. https://doi.org/10.1016/j.patrec.2011.10.007.
View | Files available | DOI
 
[238]
2012 | Journal Article | IST-REx-ID: 2849   OA
Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space of Steiner Minimal Trees.” Russian Mathematical Surveys 67, no. 6 (2012): 1167–68. https://doi.org/10.1070/RM2012v067n06ABEH004820.
View | Files available | DOI
 
[237]
2012 | Journal Article | IST-REx-ID: 2902
Edelsbrunner, Herbert, Oleg Musin, Alexey Ukhalov, Olga Yakimova, Vladislav Alexeev, Victoriya Bogaevskaya, Andrey Gorohov, and Margarita Preobrazhenskaya. “Fractal and Computational Geometry for Generalizing Cartographic Objects.” Modeling and Analysis of Information Systems 19, no. 6 (2012): 152–60.
View | Download (ext.)
 
[236]
2012 | Conference Paper | IST-REx-ID: 3133   OA
Edelsbrunner, Herbert, and Michael Kerber. “Alexander Duality for Functions: The Persistent Behavior of Land and Water and Shore.” In Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry , 249–58. ACM, 2012. https://doi.org/10.1145/2261250.2261287.
View | DOI | Download (ext.)
 
[235]
2012 | Conference Paper | IST-REx-ID: 2903   OA
Edelsbrunner, Herbert, and Olga Symonova. “The Adaptive Topology of a Digital Image,” 41–48. IEEE, 2012. https://doi.org/10.1109/ISVD.2012.11.
View | Files available | DOI
 
[234]
2012 | Journal Article | IST-REx-ID: 2941   OA
Dolbilin, Nikolai, Herbert Edelsbrunner, and Oleg Musin. “On the Optimality of Functionals over Triangulations of Delaunay Sets.” Russian Mathematical Surveys 67, no. 4 (2012): 781–83. https://doi.org/10.1070/RM2012v067n04ABEH004807.
View | Files available | DOI
 
[233]
2012 | Conference Paper | IST-REx-ID: 3134
Edelsbrunner, Herbert, Brittany Fasy, and Günter Rote. “Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.” In Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry , 91–100. ACM, 2012. https://doi.org/10.1145/2261250.2261265.
View | Files available | DOI
 
[232]
2012 | Journal Article | IST-REx-ID: 2911
Edelsbrunner, Herbert, Alexander Ivanov, and Roman Karasev. “Open Problems in Discrete and Computational Geometry.” Automatic Control and Computer Sciences in print (2012).
View
 
[231]
2012 | Journal Article | IST-REx-ID: 3159   OA
Mileyko, Yuriy, Herbert Edelsbrunner, Charles Price, and Joshua Weitz. “Hierarchical Ordering of Reticular Networks.” PLoS One 7, no. 6 (2012). https://doi.org/10.1371/journal.pone.0036715.
View | Files available | DOI
 
[230]
2011 | Journal Article | IST-REx-ID: 3965
Wang, Bei, Herbert Edelsbrunner, and Dmitriy Morozov. “Computing Elevation Maxima by Searching the Gauss Sphere.” Journal of Experimental Algorithmics 16, no. 2.2 (2011): 1–13. https://doi.org/10.1145/1963190.1970375.
View | DOI
 
[229]
2011 | Journal Article | IST-REx-ID: 3377   OA
Edelsbrunner, Herbert, Dmitriy Morozov, and Amit Patel. “Quantifying Transversality by Measuring the Robustness of Intersections.” Foundations of Computational Mathematics 11, no. 3 (2011): 345–61. https://doi.org/10.1007/s10208-011-9090-8.
View | DOI | Download (ext.)
 
[228]
2011 | Journal Article | IST-REx-ID: 3334
Edelsbrunner, Herbert, János Pach, and Günter Ziegler. “Letter from the New Editors-in-Chief.” Discrete & Computational Geometry 45, no. 1 (2011): 1–2. https://doi.org/10.1007/s00454-010-9313-9.
View | DOI
 
[227]
2011 | Book Chapter | IST-REx-ID: 3311
Edelsbrunner, Herbert. “Alpha Shapes - a Survey.” In Tessellations in the Sciences. Springer, 2011.
View
 
[226]
2011 | Book Chapter | IST-REx-ID: 3335   OA
Van De Weygaert, Rien, Gert Vegter, Herbert Edelsbrunner, Bernard Jones, Pratyush Pranav, Changbom Park, Wojciech Hellwing, et al. “Alpha, Betti and the Megaparsec Universe: On the Topology of the Cosmic Web.” In Transactions on Computational Science XIV, edited by Marina Gavrilova, Kenneth Tan, and Mir Mostafavi, 6970:60–101. Special Issue on Voronoi Diagrams and Delaunay Triangulation. Springer, 2011. https://doi.org/10.1007/978-3-642-25249-5_3.
View | DOI | Download (ext.) | arXiv
 
[225]
2011 | Book Chapter | IST-REx-ID: 3796   OA
Edelsbrunner, Herbert, and Michael Kerber. “Covering and Packing with Spheres by Diagonal Distortion in R^n.” In Rainbow of Computer Science, edited by Cristian Calude, Grzegorz Rozenberg, and Arto Salomaa, 6570:20–35. Dedicated to Hermann Maurer on the Occasion of His 70th Birthday. Springer, 2011. https://doi.org/10.1007/978-3-642-19391-0_2.
View | Files available | DOI
 
[224]
2011 | Conference Poster | IST-REx-ID: 3312   OA
Zheng, Ying, Steve Gu, Herbert Edelsbrunner, Carlo Tomasi, and Philip Benfey. Detailed Reconstruction of 3D Plant Root Shape. Proceedings of the IEEE International Conference on Computer Vision. IEEE, 2011. https://doi.org/10.1109/ICCV.2011.6126475.
View | Files available | DOI
 
[223]
2011 | Conference Paper | IST-REx-ID: 3313   OA
Chen, Chao, and Herbert Edelsbrunner. “Diffusion Runs Low on Persistence Fast.” In Proceedings of the IEEE International Conference on Computer Vision, 6126271. IEEE, 2011. https://doi.org/10.1109/ICCV.2011.6126271.
View | Files available | DOI
 
[222]
2010 | Book Chapter | IST-REx-ID: 3795   OA
Edelsbrunner, Herbert, Dmitriy Morozov, and Amit Patel. “The Stability of the Apparent Contour of an Orientable 2-Manifold.” In Topological Data Analysis and Visualization: Theory, Algorithms and Applications, 27–42. Springer, 2010. https://doi.org/10.1007/978-3-642-15014-2_3.
View | Files available | DOI
 
[221]
2010 | Conference Paper | IST-REx-ID: 3853   OA
Chatterjee, Krishnendu, Laurent Doyen, Herbert Edelsbrunner, Thomas A Henzinger, and Philippe Rannou. “Mean-Payoff Automaton Expressions,” 6269:269–83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. https://doi.org/10.1007/978-3-642-15375-4_19.
View | Files available | DOI
 
[220]
2010 | Conference Paper | IST-REx-ID: 3848
Bendich, Paul, Herbert Edelsbrunner, Dmitriy Morozov, and Amit Patel. “The Robustness of Level Sets,” 6346:1–10. Springer, 2010. https://doi.org/10.1007/978-3-642-15775-2_1.
View | DOI
 
[219]
2010 | Journal Article | IST-REx-ID: 3901   OA
Bendich, Paul, Herbert Edelsbrunner, and Michael Kerber. “Computing Robustness and Persistence for Images.” IEEE Transactions of Visualization and Computer Graphics 16, no. 6 (2010): 1251–60. https://doi.org/10.1109/TVCG.2010.139.
View | Files available | DOI
 
[218]
2010 | Conference Paper | IST-REx-ID: 3849   OA
Bendich, Paul, Herbert Edelsbrunner, Michael Kerber, and Amit Patel. “Persistent Homology under Non-Uniform Error,” 6281:12–23. Springer, 2010. https://doi.org/10.1007/978-3-642-15155-2_2.
View | Files available | DOI
 
[217]
2010 | Journal Article | IST-REx-ID: 3964
Cohen Steiner, David, Herbert Edelsbrunner, John Harer, and Yuriy Mileyko. “Lipschitz Functions Have L_p-Stable Persistence.” Foundations of Computational Mathematics 10, no. 2 (2010): 127–39. https://doi.org/10.1007/s10208-010-9060-6.
View | DOI
 
[216]
2010 | Book | IST-REx-ID: 3899
Edelsbrunner, Herbert, and John Harer. Computational Topology: An Introduction. American Mathematical Society, 2010.
View | Files available
 
[215]
2009 | Book Chapter | IST-REx-ID: 3578
Attali, Dominique, Jean Boissonnat, and Herbert Edelsbrunner. “Stability and Computation of Medial Axes: A State-of-the-Art Report.” In Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration, 109–25. Springer, 2009. https://doi.org/10.1007/b106657_6.
View | DOI | Download (ext.)
 
[214]
2009 | Journal Article | IST-REx-ID: 3966
Cohen Steiner, David, Herbert Edelsbrunner, and John Harer. “Extending Persistence Using Poincare and Lefschetz Duality.” Foundations of Computational Mathematics 9, no. 1 (2009): 79–103. https://doi.org/10.1007/s10208-008-9027-z.
View | DOI
 
[213]
2009 | Conference Paper | IST-REx-ID: 3967
Cohen Steiner, David, Herbert Edelsbrunner, John Harer, and Dmitriy Morozov. “Persistent Homology for Kernels, Images, and Cokernels,” 1011–20. SIAM, 2009.
View
 
[212]
2009 | Conference Paper | IST-REx-ID: 3968   OA
Edelsbrunner, Herbert, and John Harer. “The Persistent Morse Complex Segmentation of a 3-Manifold,” 5903:36–50. Springer, 2009. https://doi.org/10.1007/978-3-642-10470-1_4.
View | Files available | DOI
 
[211]
2008 | Conference Paper | IST-REx-ID: 3974
Edelsbrunner, Herbert, John Harer, and Amit Patel. “Reeb Spaces of Piecewise Linear Mappings,” 242–50. ACM, 2008. https://doi.org/10.1145/1377676.1377720.
View | DOI
 
[210]
2008 | Journal Article | IST-REx-ID: 3970
Dequéant, Mary, Sebastian Ahnert, Herbert Edelsbrunner, Thomas Fink, Earl Glynn, Gaye Hattem, Andrzej Kudlicki, et al. “Comparison of Pattern Detection Methods in Microarray Time Series of the Segmentation Clock.” PLoS One 3, no. 8 (2008). https://doi.org/10.1371/journal.pone.0002856.
View | DOI
 
[209]
2008 | Book Chapter | IST-REx-ID: 3577
Biasotti, Silvia, Dominique Attali, Jean Boissonnat, Herbert Edelsbrunner, Gershon Elber, Michela Mortara, Gabriella Sanniti Di Baja, Michela Spagnuolo, Mirela Tanase, and Remco Veltkam. “Skeletal Structures.” In Shape Analysis and Structuring, 145–83. Springer, 2008. https://doi.org/10.1007/978-3-540-33265-7_5.
View | DOI
 
[208]
2008 | Book Chapter | IST-REx-ID: 3969
Edelsbrunner, Herbert, and John Harer. “Persistent Homology - a Survey.” In Surveys on Discrete and Computational Geometry: Twenty Years Later, 257–82. American Mathematical Society, 2008.
View
 
[207]
2008 | Journal Article | IST-REx-ID: 3971
Edelsbrunner, Herbert, John Harer, Ajith Mascarenhas, Valerio Pascucci, and Jack Snoeyink. “Time-Varying Reeb Graphs for Continuous Space-Time Data.” Computational Geometry: Theory and Applications 41, no. 3 (2008): 149–66. https://doi.org/10.1016/j.comgeo.2007.11.001.
View | DOI
 
[206]
2007 | Conference Paper | IST-REx-ID: 3561   OA
Attali, Dominique, Herbert Edelsbrunner, and Yuriy Mileyko. “Weak Witnesses for Delaunay Triangulations of Submanifolds,” 143–50. ACM, 2007. https://doi.org/10.1145/1236246.1236267.
View | DOI | Download (ext.)
 
[205]
2007 | Journal Article | IST-REx-ID: 3972
Cohen Steiner, David, Herbert Edelsbrunner, and John Harer. “Stability of Persistence Diagrams.” Discrete & Computational Geometry 37, no. 1 (2007): 103–20. https://doi.org/10.1007/s00454-006-1276-5.
View | DOI
 
[204]
2007 | Journal Article | IST-REx-ID: 3977
Attali, Dominique, and Herbert Edelsbrunner. “Inclusion-Exclusion Formulas from Independent Complexes.” Discrete & Computational Geometry 37, no. 1 (2007): 59–77. https://doi.org/10.1007/s00454-006-1274-7.
View | DOI
 
[203]
2007 | Journal Article | IST-REx-ID: 3973
Cohen Steiner, David, and Herbert Edelsbrunner. “Inequalities for the Curvature of Curves and Surfaces.” Foundations of Computational Mathematics 7, no. 4 (2007): 391–404. https://doi.org/10.1007/s10208-005-0200-3.
View | DOI
 
[202]
2007 | Conference Paper | IST-REx-ID: 3981
Attali, Dominique, Herbert Edelsbrunner, John Harer, and Yuriy Mileyko. “Alpha-Beta Witness Complexes,” 4619:386–97. Springer, 2007. https://doi.org/10.1007/978-3-540-73951-7_34.
View | DOI
 
[201]
2007 | Conference Paper | IST-REx-ID: 3975
Bendich, Paul, David Cohen Steiner, Herbert Edelsbrunner, John Harer, and Dmitriy Morozov. “Inferring Local Homology from Sampled Stratified Spaces,” 536–46. IEEE, 2007. https://doi.org/10.1109/FOCS.2007.33.
View | DOI
 
[200]
2007 | Journal Article | IST-REx-ID: 3976
Headd, Jeffrey, Y E Andrew Ban, Paul Brown, Herbert Edelsbrunner, Madhuwanti Vaidya, and Johannes Rudolph. “Protein-Protein Interfaces: Properties, Preferences, and Projections.” Journal of Proteome Research 6, no. 7 (2007): 2576–86. https://doi.org/10.1021/pr070018+.
View | DOI
 
[199]
2006 | Patent | IST-REx-ID: 3511
Fu, Ping, Dmitry Nekhayev, and Herbert Edelsbrunner. “Manufacturing Methods and Systems for Rapid Production of Hearing-Aid Shells.” Elsevier, 2006. https://doi.org/US 7,050,876 B1.
View | DOI | Download (ext.)
 
[198]
2006 | Conference Paper | IST-REx-ID: 3559
Cohen Steiner, David, Herbert Edelsbrunner, and Dmitriy Morozov. “Vines and Vineyards by Updating Persistence in Linear Time,” 119–26. ACM, 2006. https://doi.org/10.1145/1137856.1137877.
View | DOI
 
[197]
2006 | Patent | IST-REx-ID: 3512
Fletcher, Yates, Tobias Gloth, Herbert Edelsbrunner, and Ping Fu. “Method, Apparatus and Computer Products That Reconstruct Surfaces from Data Points.” Elsevier, 2006. https://doi.org/US 7,023,432 B2.
View | DOI | Download (ext.)
 
[196]
2006 | Journal Article | IST-REx-ID: 3978
Ban, Yih, Johannes Rudolph, Pei Zhou, and Herbert Edelsbrunner. “Evaluating the Quality of NMR Structures by Local Density of Protons.” Proteins: Structure, Function and Bioinformatics 62, no. 4 (2006): 852–64. https://doi.org/10.1002/prot.20811.
View | DOI
 
[195]
2006 | Journal Article | IST-REx-ID: 3980
Agarwal, Pankaj, Herbert Edelsbrunner, John Harer, and Yusu Wang. “Extreme Elevation on a 2-Manifold.” Discrete & Computational Geometry 36, no. 4 (2006): 553–72. https://doi.org/10.1007/s00454-006-1265-8.
View | DOI
 
[194]
2006 | Journal Article | IST-REx-ID: 3979
Ban, Yih, Herbert Edelsbrunner, and Johannes Rudolph. “Interface Surfaces for Protein-Protein Complexes.” Journal of the ACM 53, no. 3 (2006): 361–78. https://doi.org/10.1145/1147954.1147957.
View | DOI
 
[193]
2006 | Patent | IST-REx-ID: 3510
Edelsbrunner, Herbert, Ping Fu, Dmitry Nekhayev, Michael Facello, and Steven Williams. “Method, Apparatus and Computer Program Products for Automatically Generating NURBS Models of Triangulated Surfaces Using Homeomorphism.” Elsevier, 2006. https://doi.org/US 6,996,505 B1.
View | DOI | Download (ext.)
 
[192]
2006 | Conference Paper | IST-REx-ID: 3560
Edelsbrunner, Herbert, Dmitriy Morozov, and Valerio Pascucci. “Persistence-Sensitive Simplification of Functions on 2-Manifolds,” 127–34. ACM, 2006. https://doi.org/10.1145/1137856.1137878.
View | DOI | Download (ext.)
 
[191]
2005 | Patent | IST-REx-ID: 3509
Williams, Steven, Herbert Edelsbrunner, and Ping Fu. “Methods, Apparatus and Computer Program Products for Modeling Three-Dimensional Colored Objects.” Elsevier, 2005. https://doi.org/US 6,853,373 B2.
View | DOI | Download (ext.)
 
[190]
2005 | Conference Paper | IST-REx-ID: 3557
Edelsbrunner, Herbert. “Surface Tiling with Differential Topology,” 9–11. ACM, 2005. http://dx.doi.org/10.2312/SGP/SGP05/009-011.
View | DOI | Download (ext.)
 
[189]
2005 | Book Chapter | IST-REx-ID: 3576
Edelsbrunner, Herbert, and Patrice Koehl. “The Geometry of Biomolecular Solvation.” In Combinatorial and Computational Geometry, 52:243–75. Cambridge University Press, 2005.
View | Download (ext.)
 
[188]
2005 | Conference Paper | IST-REx-ID: 3982
Wang, Yusu, Pankaj Agarwal, Paul Brown, Herbert Edelsbrunner, and Johannes Rudolph. “Coarse and Reliable Geometric Alignment for Protein Docking,” 64–75. World Scientific Publishing, 2005. https://doi.org/10.1142/9789812702456_0007.
View | DOI
 
[187]
2005 | Conference Paper | IST-REx-ID: 3558
Attali, Dominique, David Cohen Steiner, and Herbert Edelsbrunner. “Extraction and Simplification of Iso-Surfaces in Tandem,” 139–48. ACM, 2005.
View | Download (ext.)
 
[186]
2005 | Journal Article | IST-REx-ID: 3983
Sohn, Jungsan, Jerry Parks, Gregory Buhrman, Paul Brown, Kolbrun Kristjánsdóttir, Alexias Safi, Herbert Edelsbrunner, Weitao Yang, and Johannes Rudolph. “Experimental Validation of the Docking Orientation of Cdc25 with Its Cdk2-CycA Protein Substrate.” Biochemistry 44, no. 50 (2005): 16563–73. https://doi.org/10.1021/bi0516879.
View | DOI
 
[185]
2004 | Journal Article | IST-REx-ID: 3984
Bremer, Peer, Herbert Edelsbrunner, Bernd Hamann, and Valerio Pascucci. “A Topological Hierarchy for Functions on Triangulated Surfaces.” IEEE Transactions on Visualization and Computer Graphics 10, no. 4 (2004): 385–96. https://doi.org/10.1109/TVCG.2004.3.
View | DOI
 
[184]
2004 | Conference Paper | IST-REx-ID: 3989
Edelsbrunner, Herbert, John Harer, Vijay Natarajan, and Valerio Pascucci. “Local and Global Comparison of Continuous Functions,” 275–80. IEEE, 2004. https://doi.org/10.1109/VISUAL.2004.68.
View | DOI
 
[183]
2004 | Book Chapter | IST-REx-ID: 3574
Edelsbrunner, Herbert. “Biological Applications of Computational Topology.” In Handbook of Discrete and Computational Geometry, 1395–1412. CRC Press, 2004.
View | Download (ext.)
 
[182]
2004 | Journal Article | IST-REx-ID: 3985
Cole Mclaughlin, Kree, Herbert Edelsbrunner, John Harer, Vijay Natarajan, and Valerio Pascucci. “Loops in Reeb Graphs of 2-Manifolds.” Discrete & Computational Geometry 32, no. 2 (2004): 231–44. https://doi.org/10.1007/s00454-004-1122-6.
View | DOI
 
[181]
2004 | Book Chapter | IST-REx-ID: 3575
Edelsbrunner, Herbert, and John Harer. “Jacobi Sets of Multiple Morse Functions.” In Foundations of Computational Mathematics, 312:37–57. Springer, 2004. https://doi.org/10.1017/CBO9781139106962.003.
View | DOI
 
[180]
2004 | Journal Article | IST-REx-ID: 3986
Bryant, Robert, Herbert Edelsbrunner, Patrice Koehl, and Michael Levitt. “The Area Derivative of a Space-Filling Diagram.” Discrete & Computational Geometry 32, no. 3 (2004): 293–308. https://doi.org/10.1007/s00454-004-1099-1.
View | DOI
 
[179]
2004 | Journal Article | IST-REx-ID: 3987
Natarajan, Vijay, and Herbert Edelsbrunner. “Simplification of Three-Dimensional Density Maps.” IEEE Transactions on Visualization and Computer Graphics 10, no. 5 (2004): 587–97. https://doi.org/10.1109/TVCG.2004.32.
View | DOI
 
[178]
2004 | Conference Paper | IST-REx-ID: 3988
Choi, Vicky, Pankaj Agarwal, Herbert Edelsbrunner, and Johannes Rudolph. “Local Search Heuristic for Rigid Protein Docking,” 3240:218–29. Springer, 2004. https://doi.org/10.1007/978-3-540-30219-3_19.
View | DOI
 
[177]
2004 | Journal Article | IST-REx-ID: 3990
Agarwal, Pankaj, Herbert Edelsbrunner, and Yusu Wang. “Computing the Writhing Number of a Polygonal Knot.” Discrete & Computational Geometry 32, no. 1 (2004): 37–53. https://doi.org/10.1007/s00454-004-2864-x.
View | DOI
 
[176]
2003 | Book Chapter | IST-REx-ID: 3573
Edelsbrunner, Herbert. “Surface Reconstruction by Wrapping Finite Sets in Space.” In Discrete & Computational Geometry, 379–404. Springer, 2003. https://doi.org/10.1007/978-3-642-55566-4_17.
View | DOI | Download (ext.)
 
[175]
2003 | Book Chapter | IST-REx-ID: 3991
Cheng, Ho, and Herbert Edelsbrunner. “Area and Perimeter Derivatives of a Union of Disks.” In Computer Science in Perspective: Essays Dedicated to Thomas Ottmann, 2598:88–97. Springer, 2003. https://doi.org/10.1007/3-540-36477-3_7.
View | DOI
 
[174]
2003 | Journal Article | IST-REx-ID: 3992
Edelsbrunner, Herbert, and Patrice Koehl. “The Weighted-Volume Derivative of a Space-Filling Diagram.” PNAS 100, no. 5 (2003): 2203–8. https://doi.org/10.1073/pnas.0537830100.
View | DOI
 
[173]
2003 | Conference Paper | IST-REx-ID: 3997
Bremer, Peer, Herbert Edelsbrunner, Bernd Hamann, and Valerio Pascucci. “A Multi-Resolution Data Structure for Two-Dimensional Morse-Smale Functions,” 139–46. IEEE, 2003. https://doi.org/10.1109/VISUAL.2003.1250365.
View | DOI
 
[172]
2003 | Conference Paper | IST-REx-ID: 3556
Edelsbrunner, Herbert, John Harer, Vijay Natarajan, and Valerio Pascucci. “Morse-Smale Complexes for Piecewise Linear 3-Manifolds,” 361–70. ACM, 2003. https://doi.org/10.1145/777792.777846.
View | DOI | Download (ext.)
 
[171]
2003 | Journal Article | IST-REx-ID: 3993
Edelsbrunner, Herbert, John Harer, and Afra Zomorodian. “Hierarchical Morse-Smale Complexes for Piecewise Linear 2-Manifolds.” Discrete & Computational Geometry 30, no. 1 (2003): 87–107. https://doi.org/10.1007/s00454-003-2926-5.
View | DOI
 
[170]
2003 | Journal Article | IST-REx-ID: 3994
Cheng, Ho, and Herbert Edelsbrunner. “Area, Perimeter and Derivatives of a Skin Curve.” Computational Geometry: Theory and Applications 26, no. 2 (2003): 173–92. https://doi.org/10.1016/S0925-7721(02)00124-4.
View | DOI
 
[169]
2003 | Conference Paper | IST-REx-ID: 3999
Edelsbrunner, Herbert, and Alper Üngör. “Relaxed Scheduling in Dynamic Skin Triangulation,” 2866:135–51. Springer, 2003. https://doi.org/10.1007/978-3-540-44400-8_14.
View | DOI
 
[168]
2003 | Journal Article | IST-REx-ID: 3584
Edelsbrunner, Herbert, and Afra Zomorodian. “Computing Linking Numbers of a Filtration.” Homology, Homotopy and Applications 5, no. 2 (2003): 19–37.
View | Download (ext.)
 
[167]
2002 | Journal Article | IST-REx-ID: 3996
Edelsbrunner, Herbert, David Letscher, and Afra Zomorodian. “Topological Persistence and Simplification.” Discrete & Computational Geometry 28, no. 4 (2002): 511–33. https://doi.org/10.1007/s00454-002-2885-2.
View | DOI
 
[166]
2002 | Conference Paper | IST-REx-ID: 4003
Agarwal, Pankaj, Herbert Edelsbrunner, and Yusu Wang. “Computing the Writhing Number of a Polygonal Knot,” 791–99. SIAM, 2002.
View
 
[165]
2002 | Journal Article | IST-REx-ID: 3998
Edelsbrunner, Herbert, and Damrong Guoy. “An Experimental Study of Sliver Exudation.” Engineering with Computers 18, no. 3 (2002): 229–40. https://doi.org/10.1007/s003660200020.
View | DOI
 
[164]
2002 | Journal Article | IST-REx-ID: 4000
Zomorodian, Afra, and Herbert Edelsbrunner. “Fast Software for Box Intersections.” International Journal of Computational Geometry and Applications 12, no. 1–2 (2002): 143–72. https://doi.org/10.1142/S0218195902000785.
View | DOI
 
[163]
2002 | Patent | IST-REx-ID: 3508
Edelsbrunner, Herbert, and Ping Fu. “Methods of Generating Three-Dimensional Digital Models of Objects by Wrapping Point Cloud Data Points.” Elsevier, 2002. https://doi.org/US 6,377,865 B1.
View | DOI | Download (ext.)
 
[162]
2002 | Journal Article | IST-REx-ID: 3995
Agarwal, Pankaj, Leonidas Guibas, Herbert Edelsbrunner, Jeff Erickson, Michael Isard, Sariel Har Peled, John Hershberger, et al. “Algorithmic Issues in Modeling Motion.” ACM Computing Surveys 34, no. 4 (2002): 550–72. https://doi.org/10.1145/592642.592647.
View | DOI
 
[161]
2001 | Journal Article | IST-REx-ID: 4002
Cheng, Siu, Herbert Edelsbrunner, Ping Fu, and Ka Lam. “Design and Analysis of Planar Shape Deformation.” Computational Geometry: Theory and Applications 19, no. 2–3 (2001): 205–18. https://doi.org/10.1016/S0925-7721(01)00020-7.
View | DOI
 
[160]
2001 | Journal Article | IST-REx-ID: 4007
Cheng, Ho, Tamal Dey, Herbert Edelsbrunner, and John Sullivan. “Dynamic Skin Triangulation.” Discrete & Computational Geometry 25, no. 4 (2001): 525–68. https://doi.org/10.1007/s00454-001-0007-1.
View | DOI
 
[159]
2001 | Book | IST-REx-ID: 3586
Edelsbrunner, Herbert. Geometry and Topology for Mesh Generation. Vol. 7. Cambridge Monographs on Applied and Computational Mathematics. Cambridge University Press, 2001. https://doi.org/10.1017/CBO9780511530067.
View | Files available | DOI
 
[158]
2001 | Patent | IST-REx-ID: 3507
Liang, Jie, and Herbert Edelsbrunner. “Molecular Classification for Property Prediction.” Elsevier, 2001. https://doi.org/US 6,182,016 B1.
View | DOI | Download (ext.)
 
[157]
2001 | Conference Paper | IST-REx-ID: 4005
Cheng, Ho, Tamal Dey, Herbert Edelsbrunner, and John Sullivan. “Dynamic Skin Triangulation,” 47–56. SIAM, 2001.
View
 
[156]
2001 | Journal Article | IST-REx-ID: 4001
Cheng, Ho, Herbert Edelsbrunner, and Ping Fu. “Shape Space from Deformation.” Computational Geometry: Theory and Applications 19, no. 2–3 (2001): 191–204. https://doi.org/10.1016/S0925-7721(01)00021-9.
View | DOI
 
[155]
2001 | Journal Article | IST-REx-ID: 4006
Edelsbrunner, Herbert. “180 Wrapped Tubes.” Journal of Universal Computer Science 7, no. 5 (2001): 379–99. https://doi.org/10.3217/jucs-007-05-0379.
View | DOI
 
[154]
2000 | Conference Paper | IST-REx-ID: 3555
Edelsbrunner, Herbert, Xiang Li, Gary Miller, Andreas Stathopoulos, Dafna Talmor, Shang Teng, Alper Üngör, and Noel Walkington. “Smoothing and Cleaning up Slivers,” 273–77. ACM, 2000. https://doi.org/10.1145/335305.335338.
View | DOI | Download (ext.)
 
[153]
2000 | Conference Paper | IST-REx-ID: 4008
Edelsbrunner, Herbert, David Letscher, and Afra Zomorodian. “Topological Persistance and Simplification,” 454–63. IEEE, 2000. https://doi.org/10.1109/SFCS.2000.892133.
View | DOI
 
[152]
2000 | Journal Article | IST-REx-ID: 4010
Cheng, Siu, Tamal Dey, Herbert Edelsbrunner, Michael Facello, and Shang Teng. “Sliver Exudation.” Journal of the ACM 47, no. 5 (2000): 883–904. https://doi.org/10.1145/355483.355487.
View | DOI
 
[151]
2000 | Journal Article | IST-REx-ID: 4004
Edelsbrunner, Herbert, and Daniel Grayson. “Edgewise Subdivision of a Simplex.” Discrete & Computational Geometry 24, no. 4 (2000): 707–19. https://doi.org/10.1007/s004540010063.
View | DOI
 
[150]
2000 | Journal Article | IST-REx-ID: 4009
Edelsbrunner, Herbert, and Roman Waupotitsch. “Adaptive Simplicial Grids from Cross-Sections of Monotone Complexes.” International Journal of Computational Geometry and Applications 10, no. 3 (2000): 267–84. https://doi.org/10.1142/S0218195900000164.
View | DOI
 
[149]
2000 | Journal Article | IST-REx-ID: 3583
Edelsbrunner, Herbert. “Triangulations and Meshes in Computational Geometry.” Acta Numerica 9 (2000): 133–213.
View | Download (ext.)
 
[148]
2000 | Book Chapter | IST-REx-ID: 3572
Edelsbrunner, Herbert. “Spielereien Mit Kreisen Und Kugeln. Zum Thema Form Und Verformung.” In Zur Kunst Des Formalen Denkens, 153–71. Passagen Verlag, 2000.
View | Download (ext.)
 
[147]
1999 | Conference Paper | IST-REx-ID: 3554
Jiao, Xiangmin, Herbert Edelsbrunner, and Michael Heath. “Mesh Association: Formulation and Algorithms,” 75–82. Elsevier, 1999.
View | Download (ext.)
 
[146]
1999 | Journal Article | IST-REx-ID: 4014
Edelsbrunner, Herbert. “Deformable Smooth Surface Design.” Discrete & Computational Geometry 21, no. 1 (1999): 87–115. https://doi.org/10.1007/PL00009412.
View | DOI
 
[145]
1999 | Journal Article | IST-REx-ID: 3582
Dey, Tamal, Herbert Edelsbrunner, Sumanta Guha, and Dmitry Nekhayev. “Topology Preserving Edge Contraction.” Publications de l’Institut Mathématique 66 (1999): 23–45.
View | Download (ext.)
 
[144]
1999 | Book Chapter | IST-REx-ID: 3571
Dey, Tamal, Herbert Edelsbrunner, and Sumanta Guha. “Computational Topology.” In Advances in Discrete and Computational Geometry, 223:109–43. American Mathematical Society, 1999.
View | Download (ext.)
 
[143]
1998 | Conference Paper | IST-REx-ID: 4019
Cheng, Ho, Herbert Edelsbrunner, and Ping Fu. “Shape Space from Deformation,” 104–13. IEEE, 1998. https://doi.org/10.1109/PCCGA.1998.732056.
View | DOI
 
[142]
1998 | Conference Paper | IST-REx-ID: 4015
Edelsbrunner, Herbert. “Shape Reconstruction with Delaunay Complex,” 1380:119–32. Springer, 1998. https://doi.org/10.1007/BFb0054315.
View | DOI
 
[141]
1998 | Patent | IST-REx-ID: 3506
Edelsbrunner, Herbert, and Ping Fu. “Apparatus and Method for Geometric Morphing.” Elsevier, 1998. https://doi.org/US 5,850,229.
View | DOI | Download (ext.)
 
[140]
1998 | Book Chapter | IST-REx-ID: 3570
Axen, Ulrike, and Herbert Edelsbrunner. “Auditory Morse Analysis of Triangulated Manifolds.” In Mathematical Visualization, 223–36. Springer, 1998. https://doi.org/10.1007/978-3-662-03567-2_17.
View | DOI
 
[139]
1998 | Journal Article | IST-REx-ID: 4011
Liang, Jie, Herbert Edelsbrunner, Ping Fu, Pamidighantam Sudhakar, and Shankar Subramaniam. “Analytical Shape Computation of Macromolecules: I. Molecular Area and Volume through Alpha Shape.” Proteins: Structure, Function and Bioinformatics 33, no. 1 (1998): 1–17. https://doi.org/10.1002/(SICI)1097-0134(19981001)33:1<1::AID-PROT1>3.0.CO;2-O.
View | DOI
 
[138]
1998 | Conference Paper | IST-REx-ID: 4016
Edelsbrunner, Herbert, Michael Facello, Ping Fu, Jiang Qian, and Dmitry Nekhayev. “Wrapping 3D Scanning Data,” 3313:148–58. SPIE, 1998. https://doi.org/10.1117/12.302448.
View | DOI
 
[137]
1998 | Journal Article | IST-REx-ID: 4012
Liang, Jie, Herbert Edelsbrunner, Ping Fu, Pamidighantam Sudhakar, and Shankar Subramaniam. “Analytical Shape Computation of Macromolecules: II. Inaccessible Cavities in Proteins.” Proteins: Structure, Function and Bioinformatics 33, no. 1 (1998): 18–29. https://doi.org/10.1002/(SICI)1097-0134(19981001)33:1<18::AID-PROT2>3.0.CO;2-H.
View | DOI
 
[136]
1998 | Journal Article | IST-REx-ID: 4017   OA
Liang, Jie, Herbert Edelsbrunner, and Clare Woodward. “Anatomy of Protein Pockets and Cavities: Measurement of Binding Site Geometry and Implications for Ligand Design.” Protein Science 7, no. 9 (1998): 1884–97. https://doi.org/10.1002/pro.5560070905.
View | DOI | Download (ext.)
 
[135]
1998 | Journal Article | IST-REx-ID: 4013
Edelsbrunner, Herbert, Michael Facello, and Jie Liang. “On the Definition and the Construction of Pockets in Macromolecules.” Discrete Applied Mathematics 88, no. 1–3 (1998): 83–102. https://doi.org/10.1016/S0166-218X(98)00067-5.
View | DOI
 
[134]
1998 | Book Chapter | IST-REx-ID: 4020
Edelsbrunner, Herbert. “Geometry for Modeling Biomolecules.” In Robotics: The Algorithmic Perspective, 265–77. AK Peters, 1998.
View
 
[133]
1997 | Journal Article | IST-REx-ID: 4021
Edelsbrunner, Herbert, and Roman Waupotitsch. “A Combinatorial Approach to Cartograms.” Computational Geometry: Theory and Applications 7, no. 5–6 (1997): 343–60. https://doi.org/387910.1016/S0925-7721(96)00006-5.
View | DOI
 
[132]
1997 | Journal Article | IST-REx-ID: 4022
Edelsbrunner, Herbert, Pavel Valtr, and Emo Welzl. “Cutting Dense Point Sets in Half.” Discrete & Computational Geometry 17, no. 3 (1997): 243–55. https://doi.org/10.1007/PL00009291.
View | DOI
 
[131]
1997 | Journal Article | IST-REx-ID: 4023
Edelsbrunner, Herbert, and Edgar Ramos. “Inclusion-Exclusion Complexes for Pseudodisk Collections.” Discrete & Computational Geometry 17, no. 3 (1997): 287–306. https://doi.org/10.1007/PL00009295.
View | DOI
 
[130]
1997 | Journal Article | IST-REx-ID: 4018
Edelsbrunner, Herbert, and Nimish Shah. “Triangulating Topological Spaces.” International Journal of Computational Geometry and Applications 7, no. 4 (1997): 365–78. https://doi.org/10.1142/S0218195997000223.
View | DOI
 
[129]
1996 | Journal Article | IST-REx-ID: 4026
Edelsbrunner, Herbert, and Nimish Shah. “Incremental Topological Flipping Works for Regular Triangulations.” Algorithmica 15, no. 3 (1996): 223–41. https://doi.org/10.1007/BF01975867.
View | DOI
 
[128]
1996 | Journal Article | IST-REx-ID: 4027
Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Jorge Stolfi. “Lines in Space: Combinatorics and Algorithms.” Algorithmica 15, no. 5 (1996): 428–47. https://doi.org/10.1007/BF01955043.
View | DOI
 
[127]
1996 | Conference Poster | IST-REx-ID: 4030
Liang, Jie, Herbert Edelsbrunner, and Shankar Subramaniam. Effects of Molecular Shape Representations on Boundary Element Method for Protein Electrostatics Computations. Fortieth Annual Meeting. Vol. 70. Cell Press, 1996. https://doi.org/10.1016/S0006-3495(96)79664-9.
View | DOI
 
[126]
1996 | Journal Article | IST-REx-ID: 4024
Akkiraju, Nataraj, Herbert Edelsbrunner, Ping Fu, and Jiang Qian. “Viewing Geometric Protein Structures from inside a CAVE.” IEEE Computer Graphics and Applications 16, no. 4 (1996): 58–61. https://doi.org/10.1109/38.511855.
View | DOI
 
[125]
1996 | Conference Poster | IST-REx-ID: 4031
Liang, Jie, Herbert Edelsbrunner, Sudhakar Pamidghantam, and Shankar Subramaniam. Analytical Method for Molecular Shapes: Area, Volume, Cavities, Interface and Pockets. Fortieth Annual Meeting. Vol. 70. Cell Press, 1996. https://doi.org/10.1016/S0006-3495(96)79670-4.
View | DOI
 
[124]
1996 | Conference Paper | IST-REx-ID: 3553
Edelsbrunner, Herbert, Ping Fu, and Jiang Quian. “Geometric Modeling in CAVE,” 35-41 and-193–94. ACM, 1996.
View | Download (ext.)
 
[123]
1996 | Journal Article | IST-REx-ID: 4025
Akkiraju, Nataraj, and Herbert Edelsbrunner. “Triangulating the Surface of a Molecule.” Discrete Applied Mathematics 71, no. 1–3 (1996): 5–22. https://doi.org/10.1016/S0166-218X(96)00054-6.
View | DOI
 
[122]
1995 | Conference Paper | IST-REx-ID: 4034
Edelsbrunner, Herbert. “Algebraic Decomposition of Non-Convex Polyhedra,” 248–57. IEEE, 1995.
View
 
[121]
1995 | Conference Paper | IST-REx-ID: 3551
Edelsbrunner, Herbert, Michael Facello, Ping Fu, and Jie Liang. “Measuring Proteins and Voids in Proteins,” 256–64. IEEE, 1995. https://doi.org/10.1109/HICSS.1995.375331.
View | DOI
 
[120]
1995 | Journal Article | IST-REx-ID: 4028
Edelsbrunner, Herbert. “The Union of Balls and Its Dual Shape.” Discrete & Computational Geometry 13, no. 1 (1995): 415–40. https://doi.org/10.1007/BF02574053.
View | DOI
 
[119]
1995 | Journal Article | IST-REx-ID: 4035
Chazelle, Bernard, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas Guibas, Micha Sharir, and Emo Welzl. “Improved Bounds on Weak ε-Nets for Convex Sets.” Discrete & Computational Geometry 13, no. 1 (1995): 1–15. https://doi.org/10.1007/BF02574025.
View | DOI
 
[118]
1995 | Conference Paper | IST-REx-ID: 3552
Akkiraju, Nataraj, Herbert Edelsbrunner, Michael Facello, Ping Fu, Ernst Mücke, and Carlos Varela. “Alpha Shapes: Definition and Software,” 63–66. Elsevier, 1995.
View | Download (ext.)
 
[117]
1995 | Journal Article | IST-REx-ID: 4029
Delfinado, Cecil, and Herbert Edelsbrunner. “An Incremental Algorithm for Betti Numbers of Simplicial Complexes on the 3-Sphere.” Computer Aided Geometric Design 12, no. 7 (1995): 771–84. https://doi.org/10.1016/0167-8396(95)00016-Y.
View | DOI
 
[116]
1994 | Journal Article | IST-REx-ID: 4033
Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, John Hershberger, Raimund Seidel, and Micha Sharir. “Selecting Heavily Covered Points.” SIAM Journal on Computing 23, no. 6 (1994): 1138–51. https://doi.org/10.1137/S0097539790179919 .
View | DOI
 
[115]
1994 | Journal Article | IST-REx-ID: 4038
Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, and Micha Sharir. “Algorithms for Bichromatic Line-Segment Problems and Polyhedral Terrains.” Algorithmica 11, no. 2 (1994): 116–32. https://doi.org/10.1007/BF01182771.
View | DOI
 
[114]
1994 | Conference Paper | IST-REx-ID: 3550
Edelsbrunner, Herbert. “Modeling with Simplicial Complexes (Topology, Geometry and Algorithms),” 36–44. Unknown, 1994.
View | Download (ext.)
 
[113]
1994 | Journal Article | IST-REx-ID: 4039
Chazelle, Bernard, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas Guibas, John Hershberger, Micha Sharir, and Jack Snoeyink. “Ray Shooting in Polygons Using Geodesic Triangulations.” Algorithmica 12, no. 1 (1994): 54–68. https://doi.org/10.1007/BF01377183.
View | DOI
 
[112]
1994 | Journal Article | IST-REx-ID: 4032
Dey, Tamal, and Herbert Edelsbrunner. “Counting Triangle Crossings and Halving Planes.” Discrete & Computational Geometry 12, no. 1 (1994): 281–89. https://doi.org/10.1007/BF02574381.
View | DOI
 
[111]
1994 | Journal Article | IST-REx-ID: 4037
Edelsbrunner, Herbert, and Ernst Mücke. “Three-Dimensional Alpha Shapes.” ACM Transactions on Graphics 13, no. 1 (1994): 43–72. https://doi.org/10.1145/174462.156635.
View | DOI
 
[110]
1993 | Journal Article | IST-REx-ID: 4040
Edelsbrunner, Herbert, and Tiow Tan. “An Upper Bound for Conforming Delaunay Triangulations.” Discrete & Computational Geometry 10, no. 1 (1993): 197–213. https://doi.org/10.1007/BF02573974.
View | DOI
 
[109]
1993 | Journal Article | IST-REx-ID: 4045
Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, and Micha Sharir. “Diameter, Width, Closest Line Pair, and Parametric Searching.” Discrete & Computational Geometry 10, no. 1 (1993): 183–96. https://doi.org/10.1007/BF02573973.
View | DOI
 
[108]
1993 | Journal Article | IST-REx-ID: 4041
Edelsbrunner, Herbert, Raimund Seidel, and Micha Sharir. “On the Zone Theorem for Hyperplane Arrangements.” SIAM Journal on Computing 22, no. 2 (1993): 418–29. https://doi.org/10.1137/0222031.
View | DOI
 
[107]
1993 | Book Chapter | IST-REx-ID: 3568
Edelsbrunner, Herbert. “Geometric Algorithms.” In Handbook of Convex Geometry, 699–735. North Holland, 1993.
View | Download (ext.)
 
[106]
1993 | Journal Article | IST-REx-ID: 4042
Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the Minmax Length Triangulation.” SIAM Journal on Computing 22, no. 3 (1993): 527–51. https://doi.org/10.1137/0222036 .
View | DOI
 
[105]
1993 | Book Chapter | IST-REx-ID: 3569
Edelsbrunner, Herbert. “Computational Geometry.” In Current Trends in Theoretical Computer Science, Essays and Tutorials, 1–48. World Scientific Publishing, 1993. https://doi.org/10.1007/978-3-662-04245-8_1.
View | DOI
 
[104]
1993 | Journal Article | IST-REx-ID: 4036
Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Jack Snoeyink. “Computing a Face in an Arrangement of Line Segments and Related Problems.” SIAM Journal on Computing 22, no. 6 (1993): 1286–1302. https://doi.org/10.1137/0222077 .
View | DOI
 
[103]
1993 | Journal Article | IST-REx-ID: 4044
Bern, Marshall, Herbert Edelsbrunner, David Eppstein, Stephen Mitchell, and Tiow Tan. “Edge Insertion for Optimal Triangulations.” Discrete & Computational Geometry 10, no. 1 (1993): 47–65. https://doi.org/10.1007/BF02573962.
View | DOI
 
[102]
1992 | Journal Article | IST-REx-ID: 3581
Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, and Jack Snoeyink. “Counting and Cutting Cycles of Lines and Rods in Space.” Computational Geometry: Theory and Applications 1, no. 6 (1992): 305–23. https://doi.org/10.1016/0925-7721(92)90009-H.
View | DOI
 
[101]
1992 | Journal Article | IST-REx-ID: 4046
Chazelle, Bernard, and Herbert Edelsbrunner. “An Optimal Algorithm for Intersecting Line Segments in the Plane.” Journal of the ACM 39, no. 1 (1992): 1–54. https://doi.org/10.1145/147508.147511.
View | DOI
 
[100]
1992 | Journal Article | IST-REx-ID: 4053
Aronov, Boris, Herbert Edelsbrunner, Leonidas Guibas, and Micha Sharir. “The Number of Edges of Many Faces in a Line Segment Arrangement.” Combinatorica 12, no. 3 (1992): 261–74. https://doi.org/10.1007/BF01285815.
View | DOI
 
[99]
1992 | Journal Article | IST-REx-ID: 4047
Edelsbrunner, Herbert, Leonidas Guibas, János Pach, Richard Pollack, Raimund Seidel, and Micha Sharir. “Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms.” Theoretical Computer Science 92, no. 2 (1992): 319–36. https://doi.org/10.1016/0304-3975(92)90319-B.
View | DOI
 
[98]
1992 | Journal Article | IST-REx-ID: 4043
Edelsbrunner, Herbert, Tiow Tan, and Roman Waupotitsch. “An O(N^2 Log n) Time Algorithm for the MinMax Angle Triangulation.” SIAM Journal on Scientific Computing 13, no. 4 (1992): 994–1008. https://doi.org/10.1137/0913058.
View | DOI
 
[97]
1992 | Journal Article | IST-REx-ID: 4048
Aggarwal, Alok, Herbert Edelsbrunner, Prabhakar Raghavan, and Prasoon Tiwari. “Optimal Time Bounds for Some Proximity Problems in the Plane.” Information Processing Letters 42, no. 1 (1992): 55–60. https://doi.org/10.1016/0020-0190(92)90133-G.
View | DOI
 
[96]
1992 | Journal Article | IST-REx-ID: 4050
Edelsbrunner, Herbert. “Guest Editor’s Foreword.” Discrete & Computational Geometry 8, no. 1 (1992): 217–217. https://doi.org/10.1007/BF02293046.
View | DOI
 
[95]
1992 | Conference Paper | IST-REx-ID: 4049
Bern, Marshall, Herbert Edelsbrunner, David Eppstein, Stephen Mitchell, and Tiow Tan. “Edge Insertion for Optimal Triangulations,” 583:46–60. Springer, 1992. https://doi.org/10.1007/BFb0023816.
View | DOI
 
[94]
1991 | Book Chapter | IST-REx-ID: 3566
Edelsbrunner, Herbert, and Micha Sharir. “A Hyperplane Incidence Problem with Applications to Counting Distances.” In Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift, 4:253–63. American Mathematical Society, 1991.
View | Download (ext.)
 
[93]
1991 | Journal Article | IST-REx-ID: 4052
Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, and Micha Sharir. “A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications.” Theoretical Computer Science 84, no. 1 (1991): 77–105. https://doi.org/10.1016/0304-3975(91)90261-Y.
View | DOI
 
[92]
1991 | Journal Article | IST-REx-ID: 4057
Edelsbrunner, Herbert. “Corrigendum.” Journal of Computer and System Sciences 42, no. 2 (1991): 249–51. https://doi.org/10.1016/0022-0000(91)90013-U.
View | DOI
 
[91]
1991 | Book Chapter | IST-REx-ID: 3567
Edelsbrunner, Herbert. “Lines in Space – A Collection of Results.” In Discrete & Computational Geometry, 6:77–93. Springer, 1991.
View | Download (ext.)
 
[90]
1991 | Conference Paper | IST-REx-ID: 4058
Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Jack Snoeyink. “Computing a Face in an Arrangement of Line Segments,” 441–48. SIAM, 1991.
View
 
[89]
1991 | Conference Paper | IST-REx-ID: 4054
Edelsbrunner, Herbert, Raimund Seidel, and Micha Sharir. “On the Zone Theorem for Hyperplane Arrangements,” 555:108–23. Springer, 1991. https://doi.org/10.1007/BFb0038185.
View | DOI
 
[88]
1991 | Conference Paper | IST-REx-ID: 4059
Chazelle, Bernard, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas Guibas, John Hershberger, Micha Sharir, and Jack Snoeyink. “Ray Shooting in Polygons Using Geodesic Triangulations,” 510:661–73. Springer, 1991. https://doi.org/10.1007/3-540-54233-7_172.
View | DOI
 
[87]
1991 | Journal Article | IST-REx-ID: 4061
Agarwal, Pankaj, Herbert Edelsbrunner, Otfried Schwarzkopf, and Emo Welzl. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.” Discrete & Computational Geometry 6, no. 1 (1991): 407–22. https://doi.org/10.1007/BF02574698.
View | DOI
 
[86]
1991 | Conference Paper | IST-REx-ID: 4055
Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the Minmax Length Triangulation,” 414–23. IEEE, 1991. https://doi.org/10.1109/SFCS.1991.185400.
View | DOI
 
[85]
1991 | Journal Article | IST-REx-ID: 4062
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 6, no. 1 (1991): 435–42. https://doi.org/10.1007/BF02574700.
View | DOI
 
[84]
1991 | Journal Article | IST-REx-ID: 4051
Edelsbrunner, Herbert, and Weiping Shi. “An O(n Log^2 h) Time Algorithm for the Three-Dimensional Convex Hull Problem.” SIAM Journal on Computing 20, no. 2 (1991): 259–69. https://doi.org/10.1137/0220016 .
View | DOI
 
[83]
1991 | Journal Article | IST-REx-ID: 4056
Edelsbrunner, Herbert, and Péter Hajnal. “A Lower Bound on the Number of Unit Distances between the Vertices of a Convex Polygon.” Journal of Combinatorial Theory Series A 56, no. 2 (1991): 312–16. https://doi.org/10.1016/0097-3165(91)90042-F.
View | DOI
 
[82]
1990 | Journal Article | IST-REx-ID: 4064
Edelsbrunner, Herbert, and Diane Souvaine. “Computing Least Median of Squares Regression Lines and Guided Topological Sweep.” Journal of the American Statistical Association 85, no. 409 (1990): 115–19. https://doi.org/10.1080/01621459.1990.10475313.
View | DOI
 
[81]
1990 | Journal Article | IST-REx-ID: 4069
Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.” Combinatorica 10, no. 3 (1990): 251–60. https://doi.org/10.1007/BF02122779.
View | DOI
 
[80]
1990 | Conference Paper | IST-REx-ID: 4071
Edelsbrunner, Herbert, Tiow Tan, and Roman Waupotitsch. “An O(N^2log n) Time Algorithm for the MinMax Angle Triangulation,” 44–52. ACM, 1990. https://doi.org/10.1145/98524.98535.
View | DOI
 
[79]
1990 | Conference Paper | IST-REx-ID: 4076
Agarwal, Pankaj, Herbert Edelsbrunner, Otfried Schwarzkopf, and Emo Welzl. “ Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs,” 203–10. ACM, 1990. https://doi.org/10.1145/98524.98567.
View | DOI
 
[78]
1990 | Journal Article | IST-REx-ID: 4060
Edelsbrunner, Herbert, Franco Preparata, and Douglas West. “Tetrahedrizing Point Sets in Three Dimensions.” Journal of Symbolic Computation 10, no. 3–4 (1990): 335–47. https://doi.org/10.1016/S0747-7171(08)80068-5.
View | DOI | Download (ext.)
 
[77]
1990 | Journal Article | IST-REx-ID: 4065
Edelsbrunner, Herbert, Arch Robison, and Xiao Shen. “Covering Convex Sets with Non-Overlapping Polygons.” Discrete Mathematics 81, no. 2 (1990): 153–64. https://doi.org/10.1016/0012-365X(90)90147-A.
View | DOI
 
[76]
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 5, no. 1 (1990): 161–96. https://doi.org/ 10.1007/BF02187784.
View | DOI
 
[75]
1990 | Conference Paper | IST-REx-ID: 4077
Aronov, Boris, Bernard Chazelle, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Rephael Wenger. “Points and Triangles in the Plane and Halving Planes in Space,” 112–15. ACM, 1990. https://doi.org/10.1145/98524.98548.
View | DOI
 
[74]
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 5, no. 1 (1990): 197–216. https://doi.org/10.1007/BF02187785.
View | DOI
 
[73]
1990 | Conference Paper | IST-REx-ID: 4073
Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, and Jack Snoeyink. “Counting and Cutting Cycles of Lines and Rods in Space,” 242–51. IEEE, 1990. https://doi.org/10.1109/FSCS.1990.89543.
View | DOI
 
[72]
1990 | Conference Paper | IST-REx-ID: 4078
Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, John Hershberger, Raimund Seidel, and Micha Sharir. “Slimming down by Adding; Selecting Heavily Covered Points,” 116–27. ACM, 1990. https://doi.org/10.1145/98524.98551.
View | DOI
 
[71]
1990 | Conference Paper | IST-REx-ID: 4067
Edelsbrunner, Herbert, and Micha Sharir. “A Hyperplane Incidence Problem with Applications to Counting Distances,” 450:419–28. Springer, 1990. https://doi.org/10.1007/3-540-52921-7_91.
View | DOI
 
[70]
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 5, no. 1 (1990): 99–160. https://doi.org/10.1007/BF02187783.
View | DOI
 
[69]
1990 | Book Chapter | IST-REx-ID: 3565
Dobkin, David, Herbert Edelsbrunner, and Chee Yap. “Probing Convex Polytopes.” In Autonomous Robot Vehicles, edited by Ingemar Cox and Gordon Wilfong, 328–41. Springer, 1990. https://doi.org/10.1007/978-1-4613-8997-2_25.
View | DOI
 
[68]
1990 | Journal Article | IST-REx-ID: 4063
Edelsbrunner, Herbert, and Ernst Mücke. “Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms.” ACM Transactions on Graphics 9, no. 1 (1990): 66–104. https://doi.org/10.1145/77635.77639.
View | DOI
 
[67]
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 5, no. 1 (1990): 35–42. https://doi.org/ 10.1007/BF02187778.
View | DOI
 
[66]
1990 | Journal Article | IST-REx-ID: 4070
Edelsbrunner, Herbert, Mark Overmars, Emo Welzl, Irith Hartman, and Jack Feldman. “Ranking Intervals under Visibility Constraints.” International Journal of Computer Mathematics 34, no. 3–4 (1990): 129–44. https://doi.org/10.1080/00207169008803871.
View | DOI
 
[65]
1990 | Journal Article | IST-REx-ID: 4075
Dobkin, David, Herbert Edelsbrunner, and Mark Overmars. “Searching for Empty Convex Polygons.” Algorithmica 5, no. 4 (1990): 561–71. https://doi.org/10.1007/BF01840404.
View | DOI
 
[64]
1989 | Journal Article | IST-REx-ID: 4083
Yao, F., David Dobkin, Herbert Edelsbrunner, and Michael Paterson. “Partitioning Space for Range Queries.” SIAM Journal on Computing 18, no. 2 (1989): 371–84. https://doi.org/10.1137/0218025.
View | DOI
 
[63]
1989 | Journal Article | IST-REx-ID: 4088
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 4, no. 1 (1989): 433–66. https://doi.org/10.1007/BF02187742.
View | DOI
 
[62]
1989 | Journal Article | IST-REx-ID: 4084
Edelsbrunner, Herbert, Günter Rote, and Emo Welzl. “Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.” Theoretical Computer Science 66, no. 2 (1989): 157–80. https://doi.org/10.1016/0304-3975(89)90133-3.
View | DOI
 
[61]
1989 | Journal Article | IST-REx-ID: 4089
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 4, no. 1 (1989): 523–39. https://doi.org/10.1007/BF02187745.
View | DOI
 
[60]
1989 | Conference Paper | IST-REx-ID: 3549
Edelsbrunner, Herbert. “Spatial Triangulations with Dihedral Angle Conditions,” 83–89. Institute of the Electronics, Information and Communication Enginneers, 1989.
View
 
[59]
1989 | Journal Article | IST-REx-ID: 4080
Edelsbrunner, Herbert, Nany Hasan, Raimund Seidel, and Xiao Shen. “Circles through Two Points That Always Enclose Many Points.” Geometriae Dedicata 32, no. 1 (1989): 1–12. https://doi.org/10.1007/BF00181432.
View | DOI
 
[58]
1989 | Conference Paper | IST-REx-ID: 4085
Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension,” 145–51. ACM, 1989. https://doi.org/10.1145/73833.73850.
View | DOI
 
[57]
1989 | Conference Paper | IST-REx-ID: 4092
Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, and Micha Sharir. “A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications,” 372:179–93. Springer, 1989. https://doi.org/10.1007/BFb0035760.
View | DOI
 
[56]
1989 | Journal Article | IST-REx-ID: 4079
Edelsbrunner, Herbert, and Steven Skiena. “On the Number of Furthest Neighbor Pairs in a Point Set.” American Mathematical Monthly 96, no. 7 (1989): 614–18.
View | Download (ext.)
 
[55]
1989 | Journal Article | IST-REx-ID: 4081
Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.” Discrete & Computational Geometry 4, no. 1 (1989): 311–36. https://doi.org/10.1007/BF02187733.
View | DOI
 
[54]
1989 | Journal Article | IST-REx-ID: 4086
Edelsbrunner, Herbert. “The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces .” Discrete & Computational Geometry 4, no. 4 (1989): 337–43. https://doi.org/10.1007/BF02187734.
View | DOI
 
[53]
1989 | Journal Article | IST-REx-ID: 4093
Chazelle, Bernard, Herbert Edelsbrunner, and Leonidas Guibas. “The Complexity of Cutting Complexes.” Discrete & Computational Geometry 4, no. 1 (1989): 139–81. https://doi.org/10.1007/BF02187720.
View | DOI
 
[52]
1989 | Journal Article | IST-REx-ID: 4082
Edelsbrunner, Herbert, and Leonidas Guibas. “Topologically Sweeping an Arrangement.” Journal of Computer and System Sciences 38, no. 1 (1989): 165–94. https://doi.org/10.1016/0022-0000(89)90038-X.
View | DOI
 
[51]
1989 | Conference Paper | IST-REx-ID: 4087
Edelsbrunner, Herbert, Franco Preparata, and Douglas West. “Tetrahedrizing Point Sets in Three Dimensions,” 358:315–31. Springer, 1989. https://doi.org/10.1007/3-540-51084-2_31.
View | DOI
 
[50]
1988 | Journal Article | IST-REx-ID: 4090
Edelsbrunner, Herbert, and Franco Preparata. “Minimum Polygonal Separation.” Information and Computation 77, no. 3 (1988): 218–32. https://doi.org/10.1016/0890-5401(88)90049-1.
View | DOI
 
[49]
1988 | Journal Article | IST-REx-ID: 4091
Edelsbrunner, Herbert, and Steven Skiena. “Probing Convex Polygons with X-Rays.” SIAM Journal on Computing 17, no. 5 (1988): 870–82. https://doi.org/10.1137/0217054 .
View | DOI
 
[48]
1988 | Conference Paper | IST-REx-ID: 4096
Edelsbrunner, Herbert. “Geometric Structures in Computational Geometry,” 317:201–13. Springer, 1988. https://doi.org/10.1007/3-540-19488-6_117.
View | DOI
 
[47]
1988 | Conference Paper | IST-REx-ID: 4097
Edelsbrunner, Herbert, Leonidas Guibas, János Pach, Richard Pollack, Raimund Seidel, and Micha Sharir. “Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms,” 317:214–29. Springer, 1988. https://doi.org/10.1007/3-540-19488-6_118.
View | DOI
 
[46]
1987 | Journal Article | IST-REx-ID: 4095
Chazelle, Bernard, and Herbert Edelsbrunner. “An Improved Algorithm for Constructing Kth-Order Voronoi Diagrams.” IEEE Transactions on Computers 36, no. 11 (1987): 1349–54. https://doi.org/10.1109/TC.1987.5009474.
View | DOI
 
[45]
1987 | Journal Article | IST-REx-ID: 4100
Chazelle, Bernard, and Herbert Edelsbrunner. “Linear Space Data Structures for Two Types of Range Search.” Discrete & Computational Geometry 2, no. 1 (1987): 113–26. https://doi.org/10.1007/BF02187875.
View | DOI
 
[44]
1987 | Book | IST-REx-ID: 3900
Edelsbrunner, Herbert. Algorithms in Combinatorial Geometry. Vol. 10. Springer, 1987.
View | Files available
 
[43]
1987 | Conference Paper | IST-REx-ID: 3514
Edelsbrunner, Herbert, János Pach, Jacob Schwartz, and Micha Sharir. “On the Lower Envelope of Bivariate Functions and Its Applications,” 27–37. IEEE, 1987. https://doi.org/10.1109/SFCS.1987.44.
View | DOI
 
[42]
1987 | Journal Article | IST-REx-ID: 4101
Edelsbrunner, Herbert, and Mark Overmars. “Zooming by Repeated Range Detection.” Information Processing Letters 24, no. 6 (1987): 413–17. https://doi.org/10.1016/0020-0190(87)90120-7.
View | DOI
 
[41]
1987 | Journal Article | IST-REx-ID: 4094
Edelsbrunner, Herbert, and Xiaojun Shen. “A Tight Lower Bound on the Size of Visibility Graphs.” Information Processing Letters 26, no. 2 (1987): 61–64. https://doi.org/10.1016/0020-0190(87)90038-X.
View | DOI
 
[40]
1987 | Journal Article | IST-REx-ID: 4102
Dobkin, David, and Herbert Edelsbrunner. “Space Searching for Intersecting Objects.” Journal of Algorithms 8, no. 3 (1987): 348–61. https://doi.org/10.1016/0196-6774(87)90015-0.
View | DOI
 
[39]
1986 | Journal Article | IST-REx-ID: 3580
Edelsbrunner, Herbert. “Edge-Skeletons in Arrangements with Applications.” Algorithmica 1, no. 1–4 (1986): 93–109. https://doi.org/10.1007/BF01840438.
View | DOI
 
[38]
1986 | Journal Article | IST-REx-ID: 4103
Edelsbrunner, Herbert, and Emo Welzl. “On the Maximal Number of Edges of Many Faces in an Arrangement.” Journal of Combinatorial Theory Series A 41, no. 2 (1986): 159–66. https://doi.org/10.1016/0097-3165(86)90078-6.
View | DOI
 
[37]
1986 | Journal Article | IST-REx-ID: 4108
Edelsbrunner, Herbert, and Raimund Seidel. “Voronoi Diagrams and Arrangements.” Discrete & Computational Geometry 1, no. 1 (1986): 25–44. https://doi.org/10.1007/BF02187681.
View | DOI
 
[36]
1986 | Journal Article | IST-REx-ID: 4110
Edelsbrunner, Herbert, and Emo Welzl. “Constructing Belts in Two-Dimensional Arrangements with Applications.” SIAM Journal on Computing 15, no. 1 (1986): 271–84. https://doi.org/10.1137/0215019.
View | DOI
 
[35]
1986 | Journal Article | IST-REx-ID: 3579
Edelsbrunner, Herbert, and Jerzy Jaromczyk. “How Often Can You See Yourself in a Convex Configuration of Mirrors?” Congressus Numerantium 53 (1986): 193–200.
View
 
[34]
1986 | Journal Article | IST-REx-ID: 4104
Edelsbrunner, Herbert, Leonidas Guibas, and Jorge Stolfi. “Optimal Point Location in a Monotone Subdivision.” SIAM Journal on Computing 15, no. 2 (1986): 317–40. https://doi.org/10.1137/0215023.
View | DOI
 
[33]
1986 | Journal Article | IST-REx-ID: 4109
Edelsbrunner, Herbert, Günter Haring, and D Hilbert. “Rectangular Point Location in D-Dimensions with Applications.” Computer Journal 29, no. 1 (1986): 76–82. https://doi.org/10.1093/comjnl/29.1.76.
View | DOI
 
[32]
1986 | Journal Article | IST-REx-ID: 4105
Edelsbrunner, Herbert, Joseph O’Rourke, and Raimund Seidel. “Constructing Arrangements of Lines and Hyperplanes with Applications.” SIAM Journal on Computing 15, no. 2 (1986): 341–63. https://doi.org/10.1137/0215024.
View | DOI
 
[31]
1986 | Journal Article | IST-REx-ID: 4098
Edelsbrunner, Herbert, and Gerd Stöckl. “The Number of Extreme Pairs of Finite Point-Sets in Euclidean Spaces.” Journal of Combinatorial Theory Series A 43, no. 2 (1986): 344–49. https://doi.org/10.1016/0097-3165(86)90075-0.
View | DOI
 
[30]
1986 | Journal Article | IST-REx-ID: 4106
Edelsbrunner, Herbert, and Roman Waupotitsch. “Computing a Ham-Sandwich Cut in Two Dimensions.” Journal of Symbolic Computation 2, no. 2 (1986): 171–78. https://doi.org/10.1016/S0747-7171(86)80020-7.
View | DOI
 
[29]
1986 | Journal Article | IST-REx-ID: 4099
Edelsbrunner, Herbert, and Emo Welzl. “Halfplanar Range Search in Linear Space and O(N0.695) Query Time.” Information Processing Letters 23, no. 5 (1986): 289–93. https://doi.org/10.1016/0020-0190(86)90088-8.
View | DOI
 
[28]
1986 | Journal Article | IST-REx-ID: 4107
Edelsbrunner, Herbert, and David Haussler. “The Complexity of Cells in 3-Dimensional Arrangements.” Discrete Mathematics 60, no. C (1986): 139–46. https://doi.org/10.1016/0012-365X(86)90008-7.
View | DOI
 
[27]
1985 | Journal Article | IST-REx-ID: 4115
Edelsbrunner, Herbert. “Computing the Extreme Distances between Two Convex Polygons.” Journal of Algorithms 6, no. 2 (1985): 213–24. https://doi.org/10.1016/0196-6774(85)90039-2.
View | DOI
 
[26]
1985 | Journal Article | IST-REx-ID: 4111
Edelsbrunner, Herbert, and Hermann Maurer. “Finding Extreme-Points in 3-Dimensions and Solving the Post-Office Problem in the Plane.” Information Processing Letters 21, no. 1 (1985): 39–47. https://doi.org/10.1016/0020-0190(85)90107-3.
View | DOI
 
[25]
1985 | Journal Article | IST-REx-ID: 4116
Edelsbrunner, Herbert. “Finding Transversals for Sets of Simple Geometric-Figures.” Theoretical Computer Science 35, no. 1 (1985): 55–69. https://doi.org/10.1016/0304-3975(85)90005-2.
View | DOI
 
[24]
1985 | Journal Article | IST-REx-ID: 4112
Edelsbrunner, Herbert, and Mark Overmars. “Batched Dynamic Solutions to Decomposable Searching Problems.” Journal of Algorithms 6, no. 4 (1985): 515–42. https://doi.org/10.1016/0196-6774(85)90030-6.
View | DOI
 
[23]
1985 | Journal Article | IST-REx-ID: 4113
Edelsbrunner, Herbert, and Emo Welzl. “On the Number of Line Separations of a Finite Set in the Plane.” Journal of Combinatorial Theory Series A 38, no. 1 (1985): 15–29. https://doi.org/10.1016/0097-3165(85)90017-2.
View | DOI
 
[22]
1985 | Journal Article | IST-REx-ID: 4120
Chazelle, Bernard, and Herbert Edelsbrunner. “Optimal Solutions for a Class of Point Retrieval Problems.” Journal of Symbolic Computation 1, no. 1 (1985): 47–56. https://doi.org/10.1016/S0747-7171(85)80028-6.
View | DOI
 
[21]
1985 | Journal Article | IST-REx-ID: 4114
Day, William, and Herbert Edelsbrunner. “Investigation of Proportional Link Linkage Clustering Methods.” Journal of Classification 2, no. 2–3 (1985): 239–54. https://doi.org/10.1007/BF01908077.
View | DOI
 
[20]
1984 | Conference Paper | IST-REx-ID: 4122
Edelsbrunner, Herbert. “Key-Problems and Key-Methods in Computational Geometry,” 166:1–13. Springer, 1984. https://doi.org/10.1007/3-540-12920-0_1.
View | DOI
 
[19]
1984 | Journal Article | IST-REx-ID: 4123
Edelsbrunner, Herbert, Mark Overmars, and Raimund Seidel. “Some Methods of Computational Geometry Applied to Computer Graphics.” Computer Vision, Graphics, and Image Processing 28, no. 1 (1984): 92–108. https://doi.org/10.1016/0734-189X(84)90142-7.
View | DOI
 
[18]
1984 | Conference Paper | IST-REx-ID: 3513
Dobkin, David, and Herbert Edelsbrunner. “Ham-Sandwich Theorems Applied to Intersection Problems,” 88–99. Teubner, 1984.
View | Download (ext.)
 
[17]
1984 | Journal Article | IST-REx-ID: 4117
Edelsbrunner, Herbert, Jan Van Leeuwen, Thomas Ottmann, and Derick Wood. “Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space.” Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications 18, no. 2 (1984): 171–83.
View
 
[16]
1984 | Journal Article | IST-REx-ID: 4118
Edelsbrunner, Herbert, Joseph O’Rourke, and Emo Welzl. “Stationing Guards in Rectilinear Art Galleries.” Computer Vision, Graphics, and Image Processing 27, no. 2 (1984): 167–76. https://doi.org/10.1016/S0734-189X(84)80041-9.
View | DOI
 
[15]
1984 | Journal Article | IST-REx-ID: 4125
Aurenhammer, Franz, and Herbert Edelsbrunner. “An Optimal Algorithm for Constructing the Weighted Voronoi Diagram in the Plane.” Pattern Recognition 17, no. 2 (1984): 251–57. https://doi.org/10.1016/0031-3203(84)90064-5.
View | DOI
 
[14]
1984 | Conference Paper | IST-REx-ID: 4119
Edelsbrunner, Herbert, and Emo Welzl. “Monotone Edge Sequences in Line Arrangements and Applications,” 176:265–72. Springer, 1984. https://doi.org/10.1007/BFb0030307.
View | DOI
 
[13]
1984 | Journal Article | IST-REx-ID: 4121
Day, William, and Herbert Edelsbrunner. “Efficient Algorithms for Agglomerative Hierarchical Clustering Methods.” Journal of Classification 1, no. 1 (1984): 7–24. https://doi.org/10.1007/BF01890115.
View | DOI | Download (ext.)
 
[12]
1983 | Journal Article | IST-REx-ID: 4127
Edelsbrunner, Herbert. “A New Approach to Rectangle Intersections Part 2.” International Journal of Computer Mathematics 13, no. 3–4 (1983): 221–29. https://doi.org/10.1080/00207168308803365.
View | DOI
 
[11]
1983 | Book Chapter | IST-REx-ID: 3562
Bucher, W., and Herbert Edelsbrunner. “On Expected- and Worst-Case Segment Trees.” In Computational Geometry: Theory and Applications, edited by Franco Preparata, 1:109–25. Elsevier, 1983.
View | Download (ext.)
 
[10]
1983 | Journal Article | IST-REx-ID: 4128
Edelsbrunner, Herbert, David Kirkpatrick, and Raimund Seidel. “On the Shape of a Set of Points in the Plane.” IEEE Transactions on Information Theory 29, no. 4 (1983): 551–59. https://doi.org/10.1109/TIT.1983.1056714 .
View | DOI
 
[9]
1983 | Book Chapter | IST-REx-ID: 3563
Edelsbrunner, Herbert, Mark Overmars, and Derick Wood. “Graphics in Flatland: A Case Study.” In Computational Geometry: Theory and Applications, edited by Franco Preparata, 1:35–59. Elsevier, 1983.
View
 
[8]
1983 | Conference Paper | IST-REx-ID: 4124
Edelsbrunner, Herbert, and Emo Welzl. “On the Number of Equal-Sized Semispaces of a Set of Points in the Plane,” 154:182–87. Springer, 1983. https://doi.org/10.1007/BFb0036908.
View | DOI
 
[7]
1983 | Book Chapter | IST-REx-ID: 3564
Edelsbrunner, Herbert. “Neue Entwicklungen Im Bereich Datenstrukturen.” In Überblicke Informationsverarbeitung , edited by Hermann Maurer, 55–109. BI Wissenschaftsverlag, 1983.
View | Download (ext.)
 
[6]
1983 | Journal Article | IST-REx-ID: 4126
Edelsbrunner, Herbert. “A New Approach to Rectangle Intersections Part 1.” International Journal of Computer Mathematics 13, no. 3–4 (1983): 209–19. https://doi.org/10.1080/00207168308803364.
View | DOI
 
[5]
1982 | Journal Article | IST-REx-ID: 4130
Edelsbrunner, Herbert, Hermann Maurer, and David Kirkpatrick. “Polygonal Intersection Searching.” Information Processing Letters 14, no. 2 (1982): 74–79. https://doi.org/10.1016/0020-0190(82)90090-4.
View | DOI
 
[4]
1982 | Journal Article | IST-REx-ID: 4129
Edelsbrunner, Herbert, Hermann Maurer, Franco Preparata, Arnold Rosenberg, Emo Welzl, and Derick Wood. “Stabbing Line Segments.” Bit 22, no. 3 (1982): 274–81. https://doi.org/10.1007/BF01934440.
View | DOI
 
[3]
1982 | Journal Article | IST-REx-ID: 4131
Edelsbrunner, Herbert, and Mark Overmars. “On the Equivalence of Some Rectangle Problems.” Information Processing Letters 14, no. 3 (1982): 124–27. https://doi.org/10.1016/0020-0190(82)90068-0.
View | DOI
 
[2]
1981 | Journal Article | IST-REx-ID: 4132
Edelsbrunner, Herbert, and Hermann Maurer. “On the Intersection of Orthogonal Objects.” Information Processing Letters 13, no. 4–5 (1981): 177–81. https://doi.org/10.1016/0020-0190(81)90053-3.
View | DOI
 
[1]
1981 | Journal Article | IST-REx-ID: 4133
Edelsbrunner, Herbert, and Hermann Maurer. “A Space-Optimal Solution of General Region Location.” Theoretical Computer Science 16, no. 3 (1981): 329–36. https://doi.org/10.1016/0304-3975(81)90103-1.
View | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed

279 Publications

Mark all

[279]
2019 | Conference Paper | IST-REx-ID: 6648   OA
Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Topological Data Analysis in Information Space.” In 35th International Symposium on Computational Geometry, 129:31:1-31:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.SOCG.2019.31.
View | Files available | DOI | arXiv
 
[278]
2019 | Journal Article | IST-REx-ID: 6756   OA
Pranav, Pratyush, Robert J. Adler, Thomas Buchert, Herbert Edelsbrunner, Bernard J.T. Jones, Armin Schwartzman, Hubert Wagner, and Rien Van De Weygaert. “Unexpected Topology of the Temperature Fluctuations in the Cosmic Microwave Background.” Astronomy and Astrophysics 627 (2019). https://doi.org/10.1051/0004-6361/201834916.
View | Files available | DOI | arXiv
 
[277]
2019 | Journal Article | IST-REx-ID: 6608   OA
Edelsbrunner, Herbert, and Katharina Ölsböck. “Holes and Dependences in an Ordered Complex.” Computer Aided Geometric Design 73 (2019): 1–15. https://doi.org/10.1016/j.cagd.2019.06.003.
View | Files available | DOI
 
[276]
2018 | Journal Article | IST-REx-ID: 530   OA
Edelsbrunner, Herbert, and Mabel Iglesias Ham. “Multiple Covers with Balls I: Inclusion–Exclusion.” Computational Geometry: Theory and Applications 68 (2018): 119–33. https://doi.org/10.1016/j.comgeo.2017.06.014.
View | Files available | DOI
 
[275]
2018 | Conference Paper | IST-REx-ID: 187   OA
Edelsbrunner, Herbert, and Georg F Osang. “The Multi-Cover Persistence of Euclidean Balls,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.34.
View | Files available | DOI
 
[274]
2018 | Conference Paper | IST-REx-ID: 188   OA
Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Smallest Enclosing Spheres and Chernoff Points in Bregman Geometry,” 99:35:1-35:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.35.
View | Files available | DOI
 
[273]
2018 | Journal Article | IST-REx-ID: 87   OA
Edelsbrunner, Herbert, and Anton Nikitenko. “Random Inscribed Polytopes Have Similar Radius Functions as Poisson-Delaunay Mosaics.” Annals of Applied Probability 28, no. 5 (2018): 3215–38. https://doi.org/10.1214/18-AAP1389.
View | Files available | DOI | Download (ext.) | arXiv
 
[272]
2018 | Journal Article | IST-REx-ID: 312
Edelsbrunner, Herbert, and Mabel Iglesias Ham. “On the Optimality of the FCC Lattice for Soft Sphere Packing.” SIAM J Discrete Math 32, no. 1 (2018): 750–82. https://doi.org/10.1137/16M1097201.
View | DOI
 
[271]
2018 | Journal Article | IST-REx-ID: 5678   OA
Edelsbrunner, Herbert, and Anton Nikitenko. “Poisson–Delaunay Mosaics of Order K.” Discrete and Computational Geometry, 2018. https://doi.org/10.1007/s00454-018-0049-2.
View | Files available | DOI
 
[270]
2017 | Journal Article | IST-REx-ID: 1022   OA
Pranav, Pratyush, Herbert Edelsbrunner, Rien Van De Weygaert, Gert Vegter, Michael Kerber, Bernard Jones, and Mathijs Wintraecken. “The Topology of the Cosmic Web in Terms of Persistent Betti Numbers.” Monthly Notices of the Royal Astronomical Society 465, no. 4 (2017): 4281–4310. https://doi.org/10.1093/mnras/stw2862.
View | DOI | Download (ext.)
 
[269]
2017 | Journal Article | IST-REx-ID: 1173   OA
Edelsbrunner, Herbert, Alexey Glazyrin, Oleg Musin, and Anton Nikitenko. “The Voronoi Functional Is Maximized by the Delaunay Triangulation in the Plane.” Combinatorica 37, no. 5 (2017): 887–910. https://doi.org/10.1007/s00493-016-3308-y.
View | DOI | Download (ext.)
 
[268]
2017 | Journal Article | IST-REx-ID: 718   OA
Edelsbrunner, Herbert, Anton Nikitenko, and Matthias Reitzner. “Expected Sizes of Poisson Delaunay Mosaics and Their Discrete Morse Functions.” Advances in Applied Probability 49, no. 3 (2017): 745–67. https://doi.org/10.1017/apr.2017.20.
View | Files available | DOI | Download (ext.) | arXiv
 
[267]
2017 | Journal Article | IST-REx-ID: 1072   OA
Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Complexes.” Transactions of the American Mathematical Society 369, no. 5 (2017): 3741–62.
View | Download (ext.)
 
[266]
2017 | Conference Paper | IST-REx-ID: 688   OA
Edelsbrunner, Herbert, and Hubert Wagner. “Topological Data Analysis with Bregman Divergences,” 77:391–3916. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.SoCG.2017.39.
View | Files available | DOI
 
[265]
2017 | Preprint | IST-REx-ID: 6288   OA
Edelsbrunner, Herbert, and Anton Nikitenko. “Poisson-Delaunay Mosaics of Order K.” ArXiv:1709.09380, n.d.
View | Download (ext.) | arXiv
 
[264]
2017 | Book Chapter | IST-REx-ID: 84
Edelsbrunner, Herbert, and Patrice Koehl. “Computational Topology for Structural Molecular Biology.” In Handbook of Discrete and Computational Geometry, Third Edition, edited by Csaba Toth, Joseph O’Rourke, and Jacob Goodman, 1709–35. Handbook of Discrete and Computational Geometry. CRC Press, 2017. https://doi.org/10.1201/9781315119601.
View | DOI
 
[263]
2016 | Journal Article | IST-REx-ID: 1662   OA
Edelsbrunner, Herbert, and Florian Pausinger. “Approximation and Convergence of the Intrinsic Volume.” Advances in Mathematics 287 (2016): 674–703. https://doi.org/10.1016/j.aim.2015.10.004.
View | Files available | DOI
 
[262]
2016 | Journal Article | IST-REx-ID: 1295
Edelsbrunner, Herbert, and Mabel Iglesias Ham. “Multiple Covers with Balls II: Weighted Averages.” Electronic Notes in Discrete Mathematics 54 (2016): 169–74. https://doi.org/10.1016/j.endm.2016.09.030.
View | DOI
 
[261]
2016 | Journal Article | IST-REx-ID: 1289
Dunaeva, Olga, Herbert Edelsbrunner, Anton Lukyanov, Michael Machin, Daria Malkova, Roman Kuvaev, and Sergey Kashin. “The Classification of Endoscopy Images with Persistent Homology.” Pattern Recognition Letters 83, no. 1 (2016): 13–22. https://doi.org/10.1016/j.patrec.2015.12.012.
View | Files available | DOI
 
[260]
2015 | Journal Article | IST-REx-ID: 1793   OA
Symonova, Olga, Christopher Topp, and Herbert Edelsbrunner. “DynamicRoots: A Software Platform for the Reconstruction and Analysis of Growing Plant Roots.” PLoS One 10, no. 6 (2015). https://doi.org/10.1371/journal.pone.0127657.
View | Files available | DOI
 
[259]
2015 | Journal Article | IST-REx-ID: 3585
Cao, Thanh, Herbert Edelsbrunner, and Tiow Tan. “Proof of Correctness of the Digital Delaunay Triangulation Algorithm.” Computational Geometry: Theory and Applications 48, no. 7 (2015): 507–19. https://doi.org/10.1016/j.comgeo.2015.04.001.
View | DOI
 
[258]
2015 | Conference Paper | IST-REx-ID: 1495   OA
Edelsbrunner, Herbert, Mabel Iglesias Ham, and Vitaliy Kurlin. “Relaxed Disk Packing.” In Proceedings of the 27th Canadian Conference on Computational Geometry, 2015–August:128–35. Queen’s University, 2015.
View | Download (ext.)
 
[257]
2015 | Journal Article | IST-REx-ID: 1578
Cao, Thanhtung, Herbert Edelsbrunner, and Tiowseng Tan. “Triangulations from Topologically Correct Digital Voronoi Diagrams.” Computational Geometry 48, no. 7 (2015): 507–19. https://doi.org/10.1016/j.comgeo.2015.04.001.
View | DOI
 
[256]
2015 | Conference Paper | IST-REx-ID: 1567
Edelsbrunner, Herbert. “Shape, Homology, Persistence, and Stability.” Lecture Notes in Computer Science. Springer, 2015.
View
 
[255]
2015 | Conference Paper | IST-REx-ID: 1568
Dunaeva, Olga, Herbert Edelsbrunner, Anton Lukyanov, Michael Machin, and Daria Malkova. “The Classification of Endoscopy Images with Persistent Homology.” In Proceedings - 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 7034731. IEEE, 2015. https://doi.org/10.1109/SYNASC.2014.81.
View | Files available | DOI
 
[254]
2015 | Journal Article | IST-REx-ID: 2035   OA
Edelsbrunner, Herbert, Grzegorz Jablonski, and Marian Mrozek. “The Persistent Homology of a Self-Map.” Foundations of Computational Mathematics 15, no. 5 (2015): 1213–44. https://doi.org/10.1007/s10208-014-9223-y.
View | Files available | DOI
 
[253]
2014 | Conference Paper | IST-REx-ID: 2905   OA
Edelsbrunner, Herbert, and Dmitriy Morozovy. “Persistent Homology: Theory and Practice,” 31–50. European Mathematical Society Publishing House, 2014. https://doi.org/10.4171/120-1/3.
View | Files available | DOI
 
[252]
2014 | Journal Article | IST-REx-ID: 1876   OA
Dolbilin, Nikolai, Herbert Edelsbrunner, Alexey Glazyrin, and Oleg Musin. “Functionals on Triangulations of Delaunay Sets.” Moscow Mathematical Journal 14, no. 3 (2014): 491–504.
View | Download (ext.)
 
[251]
2014 | Conference Paper | IST-REx-ID: 2177
Edelsbrunner, Herbert, and Salman Parsa. “On the Computational Complexity of Betti Numbers Reductions from Matrix Rank.” In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 152–60. SIAM, 2014. https://doi.org/10.1137/1.9781611973402.11.
View | DOI
 
[250]
2014 | Journal Article | IST-REx-ID: 2255
Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.” Journal of Mathematical Imaging and Vision 50, no. 1 (2014): 164–77. https://doi.org/10.1007/s10851-013-0468-x.
View | Files available | DOI
 
[249]
2014 | Journal Article | IST-REx-ID: 1929
Alexeev, V V, V G Bogaevskaya, M M Preobrazhenskaya, A Y Ukhalov, Herbert Edelsbrunner, and Olga Yakimova. “An Algorithm for Cartographic Generalization That Preserves Global Topology.” Journal of Mathematical Sciences (United States) 203, no. 6 (2014): 754–60. https://doi.org/10.1007/s10958-014-2165-8.
View | DOI
 
[248]
2014 | Conference Paper | IST-REx-ID: 2155   OA
Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Filtrations.” In Proceedings of the Annual Symposium on Computational Geometry, 484–90. ACM, 2014. https://doi.org/10.1145/2582112.2582167.
View | DOI | Download (ext.)
 
[247]
2013 | Journal Article | IST-REx-ID: 2859   OA
Bendich, Paul, Herbert Edelsbrunner, Dmitriy Morozov, and Amit Patel. “Homology and Robustness of Level and Interlevel Sets.” Homology, Homotopy and Applications 15, no. 1 (2013): 51–72. https://doi.org/10.4310/HHA.2013.v15.n1.a3.
View | DOI | Download (ext.) | arXiv
 
[246]
2013 | Conference Paper | IST-REx-ID: 2843
Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.” In 17th IAPR International Conference on Discrete Geometry for Computer Imagery, 7749:XV–XIX. Springer, 2013. https://doi.org/10.1007/978-3-642-37067-0.
View | Files available | DOI
 
[245]
2013 | Conference Paper | IST-REx-ID: 2906   OA
Kerber, Michael, and Herbert Edelsbrunner. “3D Kinetic Alpha Complexes and Their Implementation.” In 2013 Proceedings of the 15th Workshop on Algorithm Engineering and Experiments, 70–77. Society of Industrial and Applied Mathematics, 2013. https://doi.org/10.1137/1.9781611972931.6.
View | Files available | DOI
 
[244]
2013 | Journal Article | IST-REx-ID: 2887   OA
Fang, Suqin, Randy Clark, Ying Zheng, Anjali Iyer Pascuzzi, Joshua Weitz, Leon Kochian, Herbert Edelsbrunner, Hong Liao, and Philip Benfey. “Genotypic Recognition and Spatial Responses by Rice Roots.” PNAS 110, no. 7 (2013): 2670–75. https://doi.org/10.1073/pnas.1222821110.
View | DOI | Download (ext.)
 
[243]
2013 | Journal Article | IST-REx-ID: 2822   OA
Topp, Christopher, Anjali Iyer Pascuzzi, Jill Anderson, Cheng Lee, Paul Zurek, Olga Symonova, Ying Zheng, et al. “3D Phenotyping and Quantitative Trait Locus Mapping Identify Core Regions of the Rice Genome Controlling Root Architecture.” PNAS 110, no. 18 (2013): E1695–1704. https://doi.org/10.1073/pnas.1304354110.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[242]
2013 | Journal Article | IST-REx-ID: 2815
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 49, no. 4 (2013): 797–822. https://doi.org/10.1007/s00454-013-9517-x.
View | Files available | DOI
 
[241]
2012 | Journal Article | IST-REx-ID: 2912
Edelsbrunner, Herbert, and Nataliya Strelkova. “Configuration Space for Shortest Networks .” Uspekhi Mat. Nauk 67, no. 6 (2012): 203–4. https://doi.org/10.4213/rm9503.
View | DOI
 
[240]
2012 | Journal Article | IST-REx-ID: 3256   OA
Edelsbrunner, Herbert, and Michael Kerber. “Dual Complexes of Cubical Subdivisions of ℝn.” Discrete & Computational Geometry 47, no. 2 (2012): 393–414. https://doi.org/10.1007/s00454-011-9382-4.
View | Files available | DOI
 
[239]
2012 | Journal Article | IST-REx-ID: 3310   OA
Bendich, Paul, Sergio Cabello, and Herbert Edelsbrunner. “A Point Calculus for Interlevel Set Homology.” Pattern Recognition Letters 33, no. 11 (2012): 1436–44. https://doi.org/10.1016/j.patrec.2011.10.007.
View | Files available | DOI
 
[238]
2012 | Journal Article | IST-REx-ID: 2849   OA
Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space of Steiner Minimal Trees.” Russian Mathematical Surveys 67, no. 6 (2012): 1167–68. https://doi.org/10.1070/RM2012v067n06ABEH004820.
View | Files available | DOI
 
[237]
2012 | Journal Article | IST-REx-ID: 2902
Edelsbrunner, Herbert, Oleg Musin, Alexey Ukhalov, Olga Yakimova, Vladislav Alexeev, Victoriya Bogaevskaya, Andrey Gorohov, and Margarita Preobrazhenskaya. “Fractal and Computational Geometry for Generalizing Cartographic Objects.” Modeling and Analysis of Information Systems 19, no. 6 (2012): 152–60.
View | Download (ext.)
 
[236]
2012 | Conference Paper | IST-REx-ID: 3133   OA
Edelsbrunner, Herbert, and Michael Kerber. “Alexander Duality for Functions: The Persistent Behavior of Land and Water and Shore.” In Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry , 249–58. ACM, 2012. https://doi.org/10.1145/2261250.2261287.
View | DOI | Download (ext.)
 
[235]
2012 | Conference Paper | IST-REx-ID: 2903   OA
Edelsbrunner, Herbert, and Olga Symonova. “The Adaptive Topology of a Digital Image,” 41–48. IEEE, 2012. https://doi.org/10.1109/ISVD.2012.11.
View | Files available | DOI
 
[234]
2012 | Journal Article | IST-REx-ID: 2941   OA
Dolbilin, Nikolai, Herbert Edelsbrunner, and Oleg Musin. “On the Optimality of Functionals over Triangulations of Delaunay Sets.” Russian Mathematical Surveys 67, no. 4 (2012): 781–83. https://doi.org/10.1070/RM2012v067n04ABEH004807.
View | Files available | DOI
 
[233]
2012 | Conference Paper | IST-REx-ID: 3134
Edelsbrunner, Herbert, Brittany Fasy, and Günter Rote. “Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.” In Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry , 91–100. ACM, 2012. https://doi.org/10.1145/2261250.2261265.
View | Files available | DOI
 
[232]
2012 | Journal Article | IST-REx-ID: 2911
Edelsbrunner, Herbert, Alexander Ivanov, and Roman Karasev. “Open Problems in Discrete and Computational Geometry.” Automatic Control and Computer Sciences in print (2012).
View
 
[231]
2012 | Journal Article | IST-REx-ID: 3159   OA
Mileyko, Yuriy, Herbert Edelsbrunner, Charles Price, and Joshua Weitz. “Hierarchical Ordering of Reticular Networks.” PLoS One 7, no. 6 (2012). https://doi.org/10.1371/journal.pone.0036715.
View | Files available | DOI
 
[230]
2011 | Journal Article | IST-REx-ID: 3965
Wang, Bei, Herbert Edelsbrunner, and Dmitriy Morozov. “Computing Elevation Maxima by Searching the Gauss Sphere.” Journal of Experimental Algorithmics 16, no. 2.2 (2011): 1–13. https://doi.org/10.1145/1963190.1970375.
View | DOI
 
[229]
2011 | Journal Article | IST-REx-ID: 3377   OA
Edelsbrunner, Herbert, Dmitriy Morozov, and Amit Patel. “Quantifying Transversality by Measuring the Robustness of Intersections.” Foundations of Computational Mathematics 11, no. 3 (2011): 345–61. https://doi.org/10.1007/s10208-011-9090-8.
View | DOI | Download (ext.)
 
[228]
2011 | Journal Article | IST-REx-ID: 3334
Edelsbrunner, Herbert, János Pach, and Günter Ziegler. “Letter from the New Editors-in-Chief.” Discrete & Computational Geometry 45, no. 1 (2011): 1–2. https://doi.org/10.1007/s00454-010-9313-9.
View | DOI
 
[227]
2011 | Book Chapter | IST-REx-ID: 3311
Edelsbrunner, Herbert. “Alpha Shapes - a Survey.” In Tessellations in the Sciences. Springer, 2011.
View
 
[226]
2011 | Book Chapter | IST-REx-ID: 3335   OA
Van De Weygaert, Rien, Gert Vegter, Herbert Edelsbrunner, Bernard Jones, Pratyush Pranav, Changbom Park, Wojciech Hellwing, et al. “Alpha, Betti and the Megaparsec Universe: On the Topology of the Cosmic Web.” In Transactions on Computational Science XIV, edited by Marina Gavrilova, Kenneth Tan, and Mir Mostafavi, 6970:60–101. Special Issue on Voronoi Diagrams and Delaunay Triangulation. Springer, 2011. https://doi.org/10.1007/978-3-642-25249-5_3.
View | DOI | Download (ext.) | arXiv
 
[225]
2011 | Book Chapter | IST-REx-ID: 3796   OA
Edelsbrunner, Herbert, and Michael Kerber. “Covering and Packing with Spheres by Diagonal Distortion in R^n.” In Rainbow of Computer Science, edited by Cristian Calude, Grzegorz Rozenberg, and Arto Salomaa, 6570:20–35. Dedicated to Hermann Maurer on the Occasion of His 70th Birthday. Springer, 2011. https://doi.org/10.1007/978-3-642-19391-0_2.
View | Files available | DOI
 
[224]
2011 | Conference Poster | IST-REx-ID: 3312   OA
Zheng, Ying, Steve Gu, Herbert Edelsbrunner, Carlo Tomasi, and Philip Benfey. Detailed Reconstruction of 3D Plant Root Shape. Proceedings of the IEEE International Conference on Computer Vision. IEEE, 2011. https://doi.org/10.1109/ICCV.2011.6126475.
View | Files available | DOI
 
[223]
2011 | Conference Paper | IST-REx-ID: 3313   OA
Chen, Chao, and Herbert Edelsbrunner. “Diffusion Runs Low on Persistence Fast.” In Proceedings of the IEEE International Conference on Computer Vision, 6126271. IEEE, 2011. https://doi.org/10.1109/ICCV.2011.6126271.
View | Files available | DOI
 
[222]
2010 | Book Chapter | IST-REx-ID: 3795   OA
Edelsbrunner, Herbert, Dmitriy Morozov, and Amit Patel. “The Stability of the Apparent Contour of an Orientable 2-Manifold.” In Topological Data Analysis and Visualization: Theory, Algorithms and Applications, 27–42. Springer, 2010. https://doi.org/10.1007/978-3-642-15014-2_3.
View | Files available | DOI
 
[221]
2010 | Conference Paper | IST-REx-ID: 3853   OA
Chatterjee, Krishnendu, Laurent Doyen, Herbert Edelsbrunner, Thomas A Henzinger, and Philippe Rannou. “Mean-Payoff Automaton Expressions,” 6269:269–83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. https://doi.org/10.1007/978-3-642-15375-4_19.
View | Files available | DOI
 
[220]
2010 | Conference Paper | IST-REx-ID: 3848
Bendich, Paul, Herbert Edelsbrunner, Dmitriy Morozov, and Amit Patel. “The Robustness of Level Sets,” 6346:1–10. Springer, 2010. https://doi.org/10.1007/978-3-642-15775-2_1.
View | DOI
 
[219]
2010 | Journal Article | IST-REx-ID: 3901   OA
Bendich, Paul, Herbert Edelsbrunner, and Michael Kerber. “Computing Robustness and Persistence for Images.” IEEE Transactions of Visualization and Computer Graphics 16, no. 6 (2010): 1251–60. https://doi.org/10.1109/TVCG.2010.139.
View | Files available | DOI
 
[218]
2010 | Conference Paper | IST-REx-ID: 3849   OA
Bendich, Paul, Herbert Edelsbrunner, Michael Kerber, and Amit Patel. “Persistent Homology under Non-Uniform Error,” 6281:12–23. Springer, 2010. https://doi.org/10.1007/978-3-642-15155-2_2.
View | Files available | DOI
 
[217]
2010 | Journal Article | IST-REx-ID: 3964
Cohen Steiner, David, Herbert Edelsbrunner, John Harer, and Yuriy Mileyko. “Lipschitz Functions Have L_p-Stable Persistence.” Foundations of Computational Mathematics 10, no. 2 (2010): 127–39. https://doi.org/10.1007/s10208-010-9060-6.
View | DOI
 
[216]
2010 | Book | IST-REx-ID: 3899
Edelsbrunner, Herbert, and John Harer. Computational Topology: An Introduction. American Mathematical Society, 2010.
View | Files available
 
[215]
2009 | Book Chapter | IST-REx-ID: 3578
Attali, Dominique, Jean Boissonnat, and Herbert Edelsbrunner. “Stability and Computation of Medial Axes: A State-of-the-Art Report.” In Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration, 109–25. Springer, 2009. https://doi.org/10.1007/b106657_6.
View | DOI | Download (ext.)
 
[214]
2009 | Journal Article | IST-REx-ID: 3966
Cohen Steiner, David, Herbert Edelsbrunner, and John Harer. “Extending Persistence Using Poincare and Lefschetz Duality.” Foundations of Computational Mathematics 9, no. 1 (2009): 79–103. https://doi.org/10.1007/s10208-008-9027-z.
View | DOI
 
[213]
2009 | Conference Paper | IST-REx-ID: 3967
Cohen Steiner, David, Herbert Edelsbrunner, John Harer, and Dmitriy Morozov. “Persistent Homology for Kernels, Images, and Cokernels,” 1011–20. SIAM, 2009.
View
 
[212]
2009 | Conference Paper | IST-REx-ID: 3968   OA
Edelsbrunner, Herbert, and John Harer. “The Persistent Morse Complex Segmentation of a 3-Manifold,” 5903:36–50. Springer, 2009. https://doi.org/10.1007/978-3-642-10470-1_4.
View | Files available | DOI
 
[211]
2008 | Conference Paper | IST-REx-ID: 3974
Edelsbrunner, Herbert, John Harer, and Amit Patel. “Reeb Spaces of Piecewise Linear Mappings,” 242–50. ACM, 2008. https://doi.org/10.1145/1377676.1377720.
View | DOI
 
[210]
2008 | Journal Article | IST-REx-ID: 3970
Dequéant, Mary, Sebastian Ahnert, Herbert Edelsbrunner, Thomas Fink, Earl Glynn, Gaye Hattem, Andrzej Kudlicki, et al. “Comparison of Pattern Detection Methods in Microarray Time Series of the Segmentation Clock.” PLoS One 3, no. 8 (2008). https://doi.org/10.1371/journal.pone.0002856.
View | DOI
 
[209]
2008 | Book Chapter | IST-REx-ID: 3577
Biasotti, Silvia, Dominique Attali, Jean Boissonnat, Herbert Edelsbrunner, Gershon Elber, Michela Mortara, Gabriella Sanniti Di Baja, Michela Spagnuolo, Mirela Tanase, and Remco Veltkam. “Skeletal Structures.” In Shape Analysis and Structuring, 145–83. Springer, 2008. https://doi.org/10.1007/978-3-540-33265-7_5.
View | DOI
 
[208]
2008 | Book Chapter | IST-REx-ID: 3969
Edelsbrunner, Herbert, and John Harer. “Persistent Homology - a Survey.” In Surveys on Discrete and Computational Geometry: Twenty Years Later, 257–82. American Mathematical Society, 2008.
View
 
[207]
2008 | Journal Article | IST-REx-ID: 3971
Edelsbrunner, Herbert, John Harer, Ajith Mascarenhas, Valerio Pascucci, and Jack Snoeyink. “Time-Varying Reeb Graphs for Continuous Space-Time Data.” Computational Geometry: Theory and Applications 41, no. 3 (2008): 149–66. https://doi.org/10.1016/j.comgeo.2007.11.001.
View | DOI
 
[206]
2007 | Conference Paper | IST-REx-ID: 3561   OA
Attali, Dominique, Herbert Edelsbrunner, and Yuriy Mileyko. “Weak Witnesses for Delaunay Triangulations of Submanifolds,” 143–50. ACM, 2007. https://doi.org/10.1145/1236246.1236267.
View | DOI | Download (ext.)
 
[205]
2007 | Journal Article | IST-REx-ID: 3972
Cohen Steiner, David, Herbert Edelsbrunner, and John Harer. “Stability of Persistence Diagrams.” Discrete & Computational Geometry 37, no. 1 (2007): 103–20. https://doi.org/10.1007/s00454-006-1276-5.
View | DOI
 
[204]
2007 | Journal Article | IST-REx-ID: 3977
Attali, Dominique, and Herbert Edelsbrunner. “Inclusion-Exclusion Formulas from Independent Complexes.” Discrete & Computational Geometry 37, no. 1 (2007): 59–77. https://doi.org/10.1007/s00454-006-1274-7.
View | DOI
 
[203]
2007 | Journal Article | IST-REx-ID: 3973
Cohen Steiner, David, and Herbert Edelsbrunner. “Inequalities for the Curvature of Curves and Surfaces.” Foundations of Computational Mathematics 7, no. 4 (2007): 391–404. https://doi.org/10.1007/s10208-005-0200-3.
View | DOI
 
[202]
2007 | Conference Paper | IST-REx-ID: 3981
Attali, Dominique, Herbert Edelsbrunner, John Harer, and Yuriy Mileyko. “Alpha-Beta Witness Complexes,” 4619:386–97. Springer, 2007. https://doi.org/10.1007/978-3-540-73951-7_34.
View | DOI
 
[201]
2007 | Conference Paper | IST-REx-ID: 3975
Bendich, Paul, David Cohen Steiner, Herbert Edelsbrunner, John Harer, and Dmitriy Morozov. “Inferring Local Homology from Sampled Stratified Spaces,” 536–46. IEEE, 2007. https://doi.org/10.1109/FOCS.2007.33.
View | DOI
 
[200]
2007 | Journal Article | IST-REx-ID: 3976
Headd, Jeffrey, Y E Andrew Ban, Paul Brown, Herbert Edelsbrunner, Madhuwanti Vaidya, and Johannes Rudolph. “Protein-Protein Interfaces: Properties, Preferences, and Projections.” Journal of Proteome Research 6, no. 7 (2007): 2576–86. https://doi.org/10.1021/pr070018+.
View | DOI
 
[199]
2006 | Patent | IST-REx-ID: 3511
Fu, Ping, Dmitry Nekhayev, and Herbert Edelsbrunner. “Manufacturing Methods and Systems for Rapid Production of Hearing-Aid Shells.” Elsevier, 2006. https://doi.org/US 7,050,876 B1.
View | DOI | Download (ext.)
 
[198]
2006 | Conference Paper | IST-REx-ID: 3559
Cohen Steiner, David, Herbert Edelsbrunner, and Dmitriy Morozov. “Vines and Vineyards by Updating Persistence in Linear Time,” 119–26. ACM, 2006. https://doi.org/10.1145/1137856.1137877.
View | DOI
 
[197]
2006 | Patent | IST-REx-ID: 3512
Fletcher, Yates, Tobias Gloth, Herbert Edelsbrunner, and Ping Fu. “Method, Apparatus and Computer Products That Reconstruct Surfaces from Data Points.” Elsevier, 2006. https://doi.org/US 7,023,432 B2.
View | DOI | Download (ext.)
 
[196]
2006 | Journal Article | IST-REx-ID: 3978
Ban, Yih, Johannes Rudolph, Pei Zhou, and Herbert Edelsbrunner. “Evaluating the Quality of NMR Structures by Local Density of Protons.” Proteins: Structure, Function and Bioinformatics 62, no. 4 (2006): 852–64. https://doi.org/10.1002/prot.20811.
View | DOI
 
[195]
2006 | Journal Article | IST-REx-ID: 3980
Agarwal, Pankaj, Herbert Edelsbrunner, John Harer, and Yusu Wang. “Extreme Elevation on a 2-Manifold.” Discrete & Computational Geometry 36, no. 4 (2006): 553–72. https://doi.org/10.1007/s00454-006-1265-8.
View | DOI
 
[194]
2006 | Journal Article | IST-REx-ID: 3979
Ban, Yih, Herbert Edelsbrunner, and Johannes Rudolph. “Interface Surfaces for Protein-Protein Complexes.” Journal of the ACM 53, no. 3 (2006): 361–78. https://doi.org/10.1145/1147954.1147957.
View | DOI
 
[193]
2006 | Patent | IST-REx-ID: 3510
Edelsbrunner, Herbert, Ping Fu, Dmitry Nekhayev, Michael Facello, and Steven Williams. “Method, Apparatus and Computer Program Products for Automatically Generating NURBS Models of Triangulated Surfaces Using Homeomorphism.” Elsevier, 2006. https://doi.org/US 6,996,505 B1.
View | DOI | Download (ext.)
 
[192]
2006 | Conference Paper | IST-REx-ID: 3560
Edelsbrunner, Herbert, Dmitriy Morozov, and Valerio Pascucci. “Persistence-Sensitive Simplification of Functions on 2-Manifolds,” 127–34. ACM, 2006. https://doi.org/10.1145/1137856.1137878.
View | DOI | Download (ext.)
 
[191]
2005 | Patent | IST-REx-ID: 3509
Williams, Steven, Herbert Edelsbrunner, and Ping Fu. “Methods, Apparatus and Computer Program Products for Modeling Three-Dimensional Colored Objects.” Elsevier, 2005. https://doi.org/US 6,853,373 B2.
View | DOI | Download (ext.)
 
[190]
2005 | Conference Paper | IST-REx-ID: 3557
Edelsbrunner, Herbert. “Surface Tiling with Differential Topology,” 9–11. ACM, 2005. http://dx.doi.org/10.2312/SGP/SGP05/009-011.
View | DOI | Download (ext.)
 
[189]
2005 | Book Chapter | IST-REx-ID: 3576
Edelsbrunner, Herbert, and Patrice Koehl. “The Geometry of Biomolecular Solvation.” In Combinatorial and Computational Geometry, 52:243–75. Cambridge University Press, 2005.
View | Download (ext.)
 
[188]
2005 | Conference Paper | IST-REx-ID: 3982
Wang, Yusu, Pankaj Agarwal, Paul Brown, Herbert Edelsbrunner, and Johannes Rudolph. “Coarse and Reliable Geometric Alignment for Protein Docking,” 64–75. World Scientific Publishing, 2005. https://doi.org/10.1142/9789812702456_0007.
View | DOI
 
[187]
2005 | Conference Paper | IST-REx-ID: 3558
Attali, Dominique, David Cohen Steiner, and Herbert Edelsbrunner. “Extraction and Simplification of Iso-Surfaces in Tandem,” 139–48. ACM, 2005.
View | Download (ext.)
 
[186]
2005 | Journal Article | IST-REx-ID: 3983
Sohn, Jungsan, Jerry Parks, Gregory Buhrman, Paul Brown, Kolbrun Kristjánsdóttir, Alexias Safi, Herbert Edelsbrunner, Weitao Yang, and Johannes Rudolph. “Experimental Validation of the Docking Orientation of Cdc25 with Its Cdk2-CycA Protein Substrate.” Biochemistry 44, no. 50 (2005): 16563–73. https://doi.org/10.1021/bi0516879.
View | DOI
 
[185]
2004 | Journal Article | IST-REx-ID: 3984
Bremer, Peer, Herbert Edelsbrunner, Bernd Hamann, and Valerio Pascucci. “A Topological Hierarchy for Functions on Triangulated Surfaces.” IEEE Transactions on Visualization and Computer Graphics 10, no. 4 (2004): 385–96. https://doi.org/10.1109/TVCG.2004.3.
View | DOI
 
[184]
2004 | Conference Paper | IST-REx-ID: 3989
Edelsbrunner, Herbert, John Harer, Vijay Natarajan, and Valerio Pascucci. “Local and Global Comparison of Continuous Functions,” 275–80. IEEE, 2004. https://doi.org/10.1109/VISUAL.2004.68.
View | DOI
 
[183]
2004 | Book Chapter | IST-REx-ID: 3574
Edelsbrunner, Herbert. “Biological Applications of Computational Topology.” In Handbook of Discrete and Computational Geometry, 1395–1412. CRC Press, 2004.
View | Download (ext.)
 
[182]
2004 | Journal Article | IST-REx-ID: 3985
Cole Mclaughlin, Kree, Herbert Edelsbrunner, John Harer, Vijay Natarajan, and Valerio Pascucci. “Loops in Reeb Graphs of 2-Manifolds.” Discrete & Computational Geometry 32, no. 2 (2004): 231–44. https://doi.org/10.1007/s00454-004-1122-6.
View | DOI
 
[181]
2004 | Book Chapter | IST-REx-ID: 3575
Edelsbrunner, Herbert, and John Harer. “Jacobi Sets of Multiple Morse Functions.” In Foundations of Computational Mathematics, 312:37–57. Springer, 2004. https://doi.org/10.1017/CBO9781139106962.003.
View | DOI
 
[180]
2004 | Journal Article | IST-REx-ID: 3986
Bryant, Robert, Herbert Edelsbrunner, Patrice Koehl, and Michael Levitt. “The Area Derivative of a Space-Filling Diagram.” Discrete & Computational Geometry 32, no. 3 (2004): 293–308. https://doi.org/10.1007/s00454-004-1099-1.
View | DOI
 
[179]
2004 | Journal Article | IST-REx-ID: 3987
Natarajan, Vijay, and Herbert Edelsbrunner. “Simplification of Three-Dimensional Density Maps.” IEEE Transactions on Visualization and Computer Graphics 10, no. 5 (2004): 587–97. https://doi.org/10.1109/TVCG.2004.32.
View | DOI
 
[178]
2004 | Conference Paper | IST-REx-ID: 3988
Choi, Vicky, Pankaj Agarwal, Herbert Edelsbrunner, and Johannes Rudolph. “Local Search Heuristic for Rigid Protein Docking,” 3240:218–29. Springer, 2004. https://doi.org/10.1007/978-3-540-30219-3_19.
View | DOI
 
[177]
2004 | Journal Article | IST-REx-ID: 3990
Agarwal, Pankaj, Herbert Edelsbrunner, and Yusu Wang. “Computing the Writhing Number of a Polygonal Knot.” Discrete & Computational Geometry 32, no. 1 (2004): 37–53. https://doi.org/10.1007/s00454-004-2864-x.
View | DOI
 
[176]
2003 | Book Chapter | IST-REx-ID: 3573
Edelsbrunner, Herbert. “Surface Reconstruction by Wrapping Finite Sets in Space.” In Discrete & Computational Geometry, 379–404. Springer, 2003. https://doi.org/10.1007/978-3-642-55566-4_17.
View | DOI | Download (ext.)
 
[175]
2003 | Book Chapter | IST-REx-ID: 3991
Cheng, Ho, and Herbert Edelsbrunner. “Area and Perimeter Derivatives of a Union of Disks.” In Computer Science in Perspective: Essays Dedicated to Thomas Ottmann, 2598:88–97. Springer, 2003. https://doi.org/10.1007/3-540-36477-3_7.
View | DOI
 
[174]
2003 | Journal Article | IST-REx-ID: 3992
Edelsbrunner, Herbert, and Patrice Koehl. “The Weighted-Volume Derivative of a Space-Filling Diagram.” PNAS 100, no. 5 (2003): 2203–8. https://doi.org/10.1073/pnas.0537830100.
View | DOI
 
[173]
2003 | Conference Paper | IST-REx-ID: 3997
Bremer, Peer, Herbert Edelsbrunner, Bernd Hamann, and Valerio Pascucci. “A Multi-Resolution Data Structure for Two-Dimensional Morse-Smale Functions,” 139–46. IEEE, 2003. https://doi.org/10.1109/VISUAL.2003.1250365.
View | DOI
 
[172]
2003 | Conference Paper | IST-REx-ID: 3556
Edelsbrunner, Herbert, John Harer, Vijay Natarajan, and Valerio Pascucci. “Morse-Smale Complexes for Piecewise Linear 3-Manifolds,” 361–70. ACM, 2003. https://doi.org/10.1145/777792.777846.
View | DOI | Download (ext.)
 
[171]
2003 | Journal Article | IST-REx-ID: 3993
Edelsbrunner, Herbert, John Harer, and Afra Zomorodian. “Hierarchical Morse-Smale Complexes for Piecewise Linear 2-Manifolds.” Discrete & Computational Geometry 30, no. 1 (2003): 87–107. https://doi.org/10.1007/s00454-003-2926-5.
View | DOI
 
[170]
2003 | Journal Article | IST-REx-ID: 3994
Cheng, Ho, and Herbert Edelsbrunner. “Area, Perimeter and Derivatives of a Skin Curve.” Computational Geometry: Theory and Applications 26, no. 2 (2003): 173–92. https://doi.org/10.1016/S0925-7721(02)00124-4.
View | DOI
 
[169]
2003 | Conference Paper | IST-REx-ID: 3999
Edelsbrunner, Herbert, and Alper Üngör. “Relaxed Scheduling in Dynamic Skin Triangulation,” 2866:135–51. Springer, 2003. https://doi.org/10.1007/978-3-540-44400-8_14.
View | DOI
 
[168]
2003 | Journal Article | IST-REx-ID: 3584
Edelsbrunner, Herbert, and Afra Zomorodian. “Computing Linking Numbers of a Filtration.” Homology, Homotopy and Applications 5, no. 2 (2003): 19–37.
View | Download (ext.)
 
[167]
2002 | Journal Article | IST-REx-ID: 3996
Edelsbrunner, Herbert, David Letscher, and Afra Zomorodian. “Topological Persistence and Simplification.” Discrete & Computational Geometry 28, no. 4 (2002): 511–33. https://doi.org/10.1007/s00454-002-2885-2.
View | DOI
 
[166]
2002 | Conference Paper | IST-REx-ID: 4003
Agarwal, Pankaj, Herbert Edelsbrunner, and Yusu Wang. “Computing the Writhing Number of a Polygonal Knot,” 791–99. SIAM, 2002.
View
 
[165]
2002 | Journal Article | IST-REx-ID: 3998
Edelsbrunner, Herbert, and Damrong Guoy. “An Experimental Study of Sliver Exudation.” Engineering with Computers 18, no. 3 (2002): 229–40. https://doi.org/10.1007/s003660200020.
View | DOI
 
[164]
2002 | Journal Article | IST-REx-ID: 4000
Zomorodian, Afra, and Herbert Edelsbrunner. “Fast Software for Box Intersections.” International Journal of Computational Geometry and Applications 12, no. 1–2 (2002): 143–72. https://doi.org/10.1142/S0218195902000785.
View | DOI
 
[163]
2002 | Patent | IST-REx-ID: 3508
Edelsbrunner, Herbert, and Ping Fu. “Methods of Generating Three-Dimensional Digital Models of Objects by Wrapping Point Cloud Data Points.” Elsevier, 2002. https://doi.org/US 6,377,865 B1.
View | DOI | Download (ext.)
 
[162]
2002 | Journal Article | IST-REx-ID: 3995
Agarwal, Pankaj, Leonidas Guibas, Herbert Edelsbrunner, Jeff Erickson, Michael Isard, Sariel Har Peled, John Hershberger, et al. “Algorithmic Issues in Modeling Motion.” ACM Computing Surveys 34, no. 4 (2002): 550–72. https://doi.org/10.1145/592642.592647.
View | DOI
 
[161]
2001 | Journal Article | IST-REx-ID: 4002
Cheng, Siu, Herbert Edelsbrunner, Ping Fu, and Ka Lam. “Design and Analysis of Planar Shape Deformation.” Computational Geometry: Theory and Applications 19, no. 2–3 (2001): 205–18. https://doi.org/10.1016/S0925-7721(01)00020-7.
View | DOI
 
[160]
2001 | Journal Article | IST-REx-ID: 4007
Cheng, Ho, Tamal Dey, Herbert Edelsbrunner, and John Sullivan. “Dynamic Skin Triangulation.” Discrete & Computational Geometry 25, no. 4 (2001): 525–68. https://doi.org/10.1007/s00454-001-0007-1.
View | DOI
 
[159]
2001 | Book | IST-REx-ID: 3586
Edelsbrunner, Herbert. Geometry and Topology for Mesh Generation. Vol. 7. Cambridge Monographs on Applied and Computational Mathematics. Cambridge University Press, 2001. https://doi.org/10.1017/CBO9780511530067.
View | Files available | DOI
 
[158]
2001 | Patent | IST-REx-ID: 3507
Liang, Jie, and Herbert Edelsbrunner. “Molecular Classification for Property Prediction.” Elsevier, 2001. https://doi.org/US 6,182,016 B1.
View | DOI | Download (ext.)
 
[157]
2001 | Conference Paper | IST-REx-ID: 4005
Cheng, Ho, Tamal Dey, Herbert Edelsbrunner, and John Sullivan. “Dynamic Skin Triangulation,” 47–56. SIAM, 2001.
View
 
[156]
2001 | Journal Article | IST-REx-ID: 4001
Cheng, Ho, Herbert Edelsbrunner, and Ping Fu. “Shape Space from Deformation.” Computational Geometry: Theory and Applications 19, no. 2–3 (2001): 191–204. https://doi.org/10.1016/S0925-7721(01)00021-9.
View | DOI
 
[155]
2001 | Journal Article | IST-REx-ID: 4006
Edelsbrunner, Herbert. “180 Wrapped Tubes.” Journal of Universal Computer Science 7, no. 5 (2001): 379–99. https://doi.org/10.3217/jucs-007-05-0379.
View | DOI
 
[154]
2000 | Conference Paper | IST-REx-ID: 3555
Edelsbrunner, Herbert, Xiang Li, Gary Miller, Andreas Stathopoulos, Dafna Talmor, Shang Teng, Alper Üngör, and Noel Walkington. “Smoothing and Cleaning up Slivers,” 273–77. ACM, 2000. https://doi.org/10.1145/335305.335338.
View | DOI | Download (ext.)
 
[153]
2000 | Conference Paper | IST-REx-ID: 4008
Edelsbrunner, Herbert, David Letscher, and Afra Zomorodian. “Topological Persistance and Simplification,” 454–63. IEEE, 2000. https://doi.org/10.1109/SFCS.2000.892133.
View | DOI
 
[152]
2000 | Journal Article | IST-REx-ID: 4010
Cheng, Siu, Tamal Dey, Herbert Edelsbrunner, Michael Facello, and Shang Teng. “Sliver Exudation.” Journal of the ACM 47, no. 5 (2000): 883–904. https://doi.org/10.1145/355483.355487.
View | DOI
 
[151]
2000 | Journal Article | IST-REx-ID: 4004
Edelsbrunner, Herbert, and Daniel Grayson. “Edgewise Subdivision of a Simplex.” Discrete & Computational Geometry 24, no. 4 (2000): 707–19. https://doi.org/10.1007/s004540010063.
View | DOI
 
[150]
2000 | Journal Article | IST-REx-ID: 4009
Edelsbrunner, Herbert, and Roman Waupotitsch. “Adaptive Simplicial Grids from Cross-Sections of Monotone Complexes.” International Journal of Computational Geometry and Applications 10, no. 3 (2000): 267–84. https://doi.org/10.1142/S0218195900000164.
View | DOI
 
[149]
2000 | Journal Article | IST-REx-ID: 3583
Edelsbrunner, Herbert. “Triangulations and Meshes in Computational Geometry.” Acta Numerica 9 (2000): 133–213.
View | Download (ext.)
 
[148]
2000 | Book Chapter | IST-REx-ID: 3572
Edelsbrunner, Herbert. “Spielereien Mit Kreisen Und Kugeln. Zum Thema Form Und Verformung.” In Zur Kunst Des Formalen Denkens, 153–71. Passagen Verlag, 2000.
View | Download (ext.)
 
[147]
1999 | Conference Paper | IST-REx-ID: 3554
Jiao, Xiangmin, Herbert Edelsbrunner, and Michael Heath. “Mesh Association: Formulation and Algorithms,” 75–82. Elsevier, 1999.
View | Download (ext.)
 
[146]
1999 | Journal Article | IST-REx-ID: 4014
Edelsbrunner, Herbert. “Deformable Smooth Surface Design.” Discrete & Computational Geometry 21, no. 1 (1999): 87–115. https://doi.org/10.1007/PL00009412.
View | DOI
 
[145]
1999 | Journal Article | IST-REx-ID: 3582
Dey, Tamal, Herbert Edelsbrunner, Sumanta Guha, and Dmitry Nekhayev. “Topology Preserving Edge Contraction.” Publications de l’Institut Mathématique 66 (1999): 23–45.
View | Download (ext.)
 
[144]
1999 | Book Chapter | IST-REx-ID: 3571
Dey, Tamal, Herbert Edelsbrunner, and Sumanta Guha. “Computational Topology.” In Advances in Discrete and Computational Geometry, 223:109–43. American Mathematical Society, 1999.
View | Download (ext.)
 
[143]
1998 | Conference Paper | IST-REx-ID: 4019
Cheng, Ho, Herbert Edelsbrunner, and Ping Fu. “Shape Space from Deformation,” 104–13. IEEE, 1998. https://doi.org/10.1109/PCCGA.1998.732056.
View | DOI
 
[142]
1998 | Conference Paper | IST-REx-ID: 4015
Edelsbrunner, Herbert. “Shape Reconstruction with Delaunay Complex,” 1380:119–32. Springer, 1998. https://doi.org/10.1007/BFb0054315.
View | DOI
 
[141]
1998 | Patent | IST-REx-ID: 3506
Edelsbrunner, Herbert, and Ping Fu. “Apparatus and Method for Geometric Morphing.” Elsevier, 1998. https://doi.org/US 5,850,229.
View | DOI | Download (ext.)
 
[140]
1998 | Book Chapter | IST-REx-ID: 3570
Axen, Ulrike, and Herbert Edelsbrunner. “Auditory Morse Analysis of Triangulated Manifolds.” In Mathematical Visualization, 223–36. Springer, 1998. https://doi.org/10.1007/978-3-662-03567-2_17.
View | DOI
 
[139]
1998 | Journal Article | IST-REx-ID: 4011
Liang, Jie, Herbert Edelsbrunner, Ping Fu, Pamidighantam Sudhakar, and Shankar Subramaniam. “Analytical Shape Computation of Macromolecules: I. Molecular Area and Volume through Alpha Shape.” Proteins: Structure, Function and Bioinformatics 33, no. 1 (1998): 1–17. https://doi.org/10.1002/(SICI)1097-0134(19981001)33:1<1::AID-PROT1>3.0.CO;2-O.
View | DOI
 
[138]
1998 | Conference Paper | IST-REx-ID: 4016
Edelsbrunner, Herbert, Michael Facello, Ping Fu, Jiang Qian, and Dmitry Nekhayev. “Wrapping 3D Scanning Data,” 3313:148–58. SPIE, 1998. https://doi.org/10.1117/12.302448.
View | DOI
 
[137]
1998 | Journal Article | IST-REx-ID: 4012
Liang, Jie, Herbert Edelsbrunner, Ping Fu, Pamidighantam Sudhakar, and Shankar Subramaniam. “Analytical Shape Computation of Macromolecules: II. Inaccessible Cavities in Proteins.” Proteins: Structure, Function and Bioinformatics 33, no. 1 (1998): 18–29. https://doi.org/10.1002/(SICI)1097-0134(19981001)33:1<18::AID-PROT2>3.0.CO;2-H.
View | DOI
 
[136]
1998 | Journal Article | IST-REx-ID: 4017   OA
Liang, Jie, Herbert Edelsbrunner, and Clare Woodward. “Anatomy of Protein Pockets and Cavities: Measurement of Binding Site Geometry and Implications for Ligand Design.” Protein Science 7, no. 9 (1998): 1884–97. https://doi.org/10.1002/pro.5560070905.
View | DOI | Download (ext.)
 
[135]
1998 | Journal Article | IST-REx-ID: 4013
Edelsbrunner, Herbert, Michael Facello, and Jie Liang. “On the Definition and the Construction of Pockets in Macromolecules.” Discrete Applied Mathematics 88, no. 1–3 (1998): 83–102. https://doi.org/10.1016/S0166-218X(98)00067-5.
View | DOI
 
[134]
1998 | Book Chapter | IST-REx-ID: 4020
Edelsbrunner, Herbert. “Geometry for Modeling Biomolecules.” In Robotics: The Algorithmic Perspective, 265–77. AK Peters, 1998.
View
 
[133]
1997 | Journal Article | IST-REx-ID: 4021
Edelsbrunner, Herbert, and Roman Waupotitsch. “A Combinatorial Approach to Cartograms.” Computational Geometry: Theory and Applications 7, no. 5–6 (1997): 343–60. https://doi.org/387910.1016/S0925-7721(96)00006-5.
View | DOI
 
[132]
1997 | Journal Article | IST-REx-ID: 4022
Edelsbrunner, Herbert, Pavel Valtr, and Emo Welzl. “Cutting Dense Point Sets in Half.” Discrete & Computational Geometry 17, no. 3 (1997): 243–55. https://doi.org/10.1007/PL00009291.
View | DOI
 
[131]
1997 | Journal Article | IST-REx-ID: 4023
Edelsbrunner, Herbert, and Edgar Ramos. “Inclusion-Exclusion Complexes for Pseudodisk Collections.” Discrete & Computational Geometry 17, no. 3 (1997): 287–306. https://doi.org/10.1007/PL00009295.
View | DOI
 
[130]
1997 | Journal Article | IST-REx-ID: 4018
Edelsbrunner, Herbert, and Nimish Shah. “Triangulating Topological Spaces.” International Journal of Computational Geometry and Applications 7, no. 4 (1997): 365–78. https://doi.org/10.1142/S0218195997000223.
View | DOI
 
[129]
1996 | Journal Article | IST-REx-ID: 4026
Edelsbrunner, Herbert, and Nimish Shah. “Incremental Topological Flipping Works for Regular Triangulations.” Algorithmica 15, no. 3 (1996): 223–41. https://doi.org/10.1007/BF01975867.
View | DOI
 
[128]
1996 | Journal Article | IST-REx-ID: 4027
Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Jorge Stolfi. “Lines in Space: Combinatorics and Algorithms.” Algorithmica 15, no. 5 (1996): 428–47. https://doi.org/10.1007/BF01955043.
View | DOI
 
[127]
1996 | Conference Poster | IST-REx-ID: 4030
Liang, Jie, Herbert Edelsbrunner, and Shankar Subramaniam. Effects of Molecular Shape Representations on Boundary Element Method for Protein Electrostatics Computations. Fortieth Annual Meeting. Vol. 70. Cell Press, 1996. https://doi.org/10.1016/S0006-3495(96)79664-9.
View | DOI
 
[126]
1996 | Journal Article | IST-REx-ID: 4024
Akkiraju, Nataraj, Herbert Edelsbrunner, Ping Fu, and Jiang Qian. “Viewing Geometric Protein Structures from inside a CAVE.” IEEE Computer Graphics and Applications 16, no. 4 (1996): 58–61. https://doi.org/10.1109/38.511855.
View | DOI
 
[125]
1996 | Conference Poster | IST-REx-ID: 4031
Liang, Jie, Herbert Edelsbrunner, Sudhakar Pamidghantam, and Shankar Subramaniam. Analytical Method for Molecular Shapes: Area, Volume, Cavities, Interface and Pockets. Fortieth Annual Meeting. Vol. 70. Cell Press, 1996. https://doi.org/10.1016/S0006-3495(96)79670-4.
View | DOI
 
[124]
1996 | Conference Paper | IST-REx-ID: 3553
Edelsbrunner, Herbert, Ping Fu, and Jiang Quian. “Geometric Modeling in CAVE,” 35-41 and-193–94. ACM, 1996.
View | Download (ext.)
 
[123]
1996 | Journal Article | IST-REx-ID: 4025
Akkiraju, Nataraj, and Herbert Edelsbrunner. “Triangulating the Surface of a Molecule.” Discrete Applied Mathematics 71, no. 1–3 (1996): 5–22. https://doi.org/10.1016/S0166-218X(96)00054-6.
View | DOI
 
[122]
1995 | Conference Paper | IST-REx-ID: 4034
Edelsbrunner, Herbert. “Algebraic Decomposition of Non-Convex Polyhedra,” 248–57. IEEE, 1995.
View
 
[121]
1995 | Conference Paper | IST-REx-ID: 3551
Edelsbrunner, Herbert, Michael Facello, Ping Fu, and Jie Liang. “Measuring Proteins and Voids in Proteins,” 256–64. IEEE, 1995. https://doi.org/10.1109/HICSS.1995.375331.
View | DOI
 
[120]
1995 | Journal Article | IST-REx-ID: 4028
Edelsbrunner, Herbert. “The Union of Balls and Its Dual Shape.” Discrete & Computational Geometry 13, no. 1 (1995): 415–40. https://doi.org/10.1007/BF02574053.
View | DOI
 
[119]
1995 | Journal Article | IST-REx-ID: 4035
Chazelle, Bernard, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas Guibas, Micha Sharir, and Emo Welzl. “Improved Bounds on Weak ε-Nets for Convex Sets.” Discrete & Computational Geometry 13, no. 1 (1995): 1–15. https://doi.org/10.1007/BF02574025.
View | DOI
 
[118]
1995 | Conference Paper | IST-REx-ID: 3552
Akkiraju, Nataraj, Herbert Edelsbrunner, Michael Facello, Ping Fu, Ernst Mücke, and Carlos Varela. “Alpha Shapes: Definition and Software,” 63–66. Elsevier, 1995.
View | Download (ext.)
 
[117]
1995 | Journal Article | IST-REx-ID: 4029
Delfinado, Cecil, and Herbert Edelsbrunner. “An Incremental Algorithm for Betti Numbers of Simplicial Complexes on the 3-Sphere.” Computer Aided Geometric Design 12, no. 7 (1995): 771–84. https://doi.org/10.1016/0167-8396(95)00016-Y.
View | DOI
 
[116]
1994 | Journal Article | IST-REx-ID: 4033
Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, John Hershberger, Raimund Seidel, and Micha Sharir. “Selecting Heavily Covered Points.” SIAM Journal on Computing 23, no. 6 (1994): 1138–51. https://doi.org/10.1137/S0097539790179919 .
View | DOI
 
[115]
1994 | Journal Article | IST-REx-ID: 4038
Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, and Micha Sharir. “Algorithms for Bichromatic Line-Segment Problems and Polyhedral Terrains.” Algorithmica 11, no. 2 (1994): 116–32. https://doi.org/10.1007/BF01182771.
View | DOI
 
[114]
1994 | Conference Paper | IST-REx-ID: 3550
Edelsbrunner, Herbert. “Modeling with Simplicial Complexes (Topology, Geometry and Algorithms),” 36–44. Unknown, 1994.
View | Download (ext.)
 
[113]
1994 | Journal Article | IST-REx-ID: 4039
Chazelle, Bernard, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas Guibas, John Hershberger, Micha Sharir, and Jack Snoeyink. “Ray Shooting in Polygons Using Geodesic Triangulations.” Algorithmica 12, no. 1 (1994): 54–68. https://doi.org/10.1007/BF01377183.
View | DOI
 
[112]
1994 | Journal Article | IST-REx-ID: 4032
Dey, Tamal, and Herbert Edelsbrunner. “Counting Triangle Crossings and Halving Planes.” Discrete & Computational Geometry 12, no. 1 (1994): 281–89. https://doi.org/10.1007/BF02574381.
View | DOI
 
[111]
1994 | Journal Article | IST-REx-ID: 4037
Edelsbrunner, Herbert, and Ernst Mücke. “Three-Dimensional Alpha Shapes.” ACM Transactions on Graphics 13, no. 1 (1994): 43–72. https://doi.org/10.1145/174462.156635.
View | DOI
 
[110]
1993 | Journal Article | IST-REx-ID: 4040
Edelsbrunner, Herbert, and Tiow Tan. “An Upper Bound for Conforming Delaunay Triangulations.” Discrete & Computational Geometry 10, no. 1 (1993): 197–213. https://doi.org/10.1007/BF02573974.
View | DOI
 
[109]
1993 | Journal Article | IST-REx-ID: 4045
Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, and Micha Sharir. “Diameter, Width, Closest Line Pair, and Parametric Searching.” Discrete & Computational Geometry 10, no. 1 (1993): 183–96. https://doi.org/10.1007/BF02573973.
View | DOI
 
[108]
1993 | Journal Article | IST-REx-ID: 4041
Edelsbrunner, Herbert, Raimund Seidel, and Micha Sharir. “On the Zone Theorem for Hyperplane Arrangements.” SIAM Journal on Computing 22, no. 2 (1993): 418–29. https://doi.org/10.1137/0222031.
View | DOI
 
[107]
1993 | Book Chapter | IST-REx-ID: 3568
Edelsbrunner, Herbert. “Geometric Algorithms.” In Handbook of Convex Geometry, 699–735. North Holland, 1993.
View | Download (ext.)
 
[106]
1993 | Journal Article | IST-REx-ID: 4042
Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the Minmax Length Triangulation.” SIAM Journal on Computing 22, no. 3 (1993): 527–51. https://doi.org/10.1137/0222036 .
View | DOI
 
[105]
1993 | Book Chapter | IST-REx-ID: 3569
Edelsbrunner, Herbert. “Computational Geometry.” In Current Trends in Theoretical Computer Science, Essays and Tutorials, 1–48. World Scientific Publishing, 1993. https://doi.org/10.1007/978-3-662-04245-8_1.
View | DOI
 
[104]
1993 | Journal Article | IST-REx-ID: 4036
Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Jack Snoeyink. “Computing a Face in an Arrangement of Line Segments and Related Problems.” SIAM Journal on Computing 22, no. 6 (1993): 1286–1302. https://doi.org/10.1137/0222077 .
View | DOI
 
[103]
1993 | Journal Article | IST-REx-ID: 4044
Bern, Marshall, Herbert Edelsbrunner, David Eppstein, Stephen Mitchell, and Tiow Tan. “Edge Insertion for Optimal Triangulations.” Discrete & Computational Geometry 10, no. 1 (1993): 47–65. https://doi.org/10.1007/BF02573962.
View | DOI
 
[102]
1992 | Journal Article | IST-REx-ID: 3581
Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, and Jack Snoeyink. “Counting and Cutting Cycles of Lines and Rods in Space.” Computational Geometry: Theory and Applications 1, no. 6 (1992): 305–23. https://doi.org/10.1016/0925-7721(92)90009-H.
View | DOI
 
[101]
1992 | Journal Article | IST-REx-ID: 4046
Chazelle, Bernard, and Herbert Edelsbrunner. “An Optimal Algorithm for Intersecting Line Segments in the Plane.” Journal of the ACM 39, no. 1 (1992): 1–54. https://doi.org/10.1145/147508.147511.
View | DOI
 
[100]
1992 | Journal Article | IST-REx-ID: 4053
Aronov, Boris, Herbert Edelsbrunner, Leonidas Guibas, and Micha Sharir. “The Number of Edges of Many Faces in a Line Segment Arrangement.” Combinatorica 12, no. 3 (1992): 261–74. https://doi.org/10.1007/BF01285815.
View | DOI
 
[99]
1992 | Journal Article | IST-REx-ID: 4047
Edelsbrunner, Herbert, Leonidas Guibas, János Pach, Richard Pollack, Raimund Seidel, and Micha Sharir. “Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms.” Theoretical Computer Science 92, no. 2 (1992): 319–36. https://doi.org/10.1016/0304-3975(92)90319-B.
View | DOI
 
[98]
1992 | Journal Article | IST-REx-ID: 4043
Edelsbrunner, Herbert, Tiow Tan, and Roman Waupotitsch. “An O(N^2 Log n) Time Algorithm for the MinMax Angle Triangulation.” SIAM Journal on Scientific Computing 13, no. 4 (1992): 994–1008. https://doi.org/10.1137/0913058.
View | DOI
 
[97]
1992 | Journal Article | IST-REx-ID: 4048
Aggarwal, Alok, Herbert Edelsbrunner, Prabhakar Raghavan, and Prasoon Tiwari. “Optimal Time Bounds for Some Proximity Problems in the Plane.” Information Processing Letters 42, no. 1 (1992): 55–60. https://doi.org/10.1016/0020-0190(92)90133-G.
View | DOI
 
[96]
1992 | Journal Article | IST-REx-ID: 4050
Edelsbrunner, Herbert. “Guest Editor’s Foreword.” Discrete & Computational Geometry 8, no. 1 (1992): 217–217. https://doi.org/10.1007/BF02293046.
View | DOI
 
[95]
1992 | Conference Paper | IST-REx-ID: 4049
Bern, Marshall, Herbert Edelsbrunner, David Eppstein, Stephen Mitchell, and Tiow Tan. “Edge Insertion for Optimal Triangulations,” 583:46–60. Springer, 1992. https://doi.org/10.1007/BFb0023816.
View | DOI
 
[94]
1991 | Book Chapter | IST-REx-ID: 3566
Edelsbrunner, Herbert, and Micha Sharir. “A Hyperplane Incidence Problem with Applications to Counting Distances.” In Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift, 4:253–63. American Mathematical Society, 1991.
View | Download (ext.)
 
[93]
1991 | Journal Article | IST-REx-ID: 4052
Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, and Micha Sharir. “A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications.” Theoretical Computer Science 84, no. 1 (1991): 77–105. https://doi.org/10.1016/0304-3975(91)90261-Y.
View | DOI
 
[92]
1991 | Journal Article | IST-REx-ID: 4057
Edelsbrunner, Herbert. “Corrigendum.” Journal of Computer and System Sciences 42, no. 2 (1991): 249–51. https://doi.org/10.1016/0022-0000(91)90013-U.
View | DOI
 
[91]
1991 | Book Chapter | IST-REx-ID: 3567
Edelsbrunner, Herbert. “Lines in Space – A Collection of Results.” In Discrete & Computational Geometry, 6:77–93. Springer, 1991.
View | Download (ext.)
 
[90]
1991 | Conference Paper | IST-REx-ID: 4058
Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Jack Snoeyink. “Computing a Face in an Arrangement of Line Segments,” 441–48. SIAM, 1991.
View
 
[89]
1991 | Conference Paper | IST-REx-ID: 4054
Edelsbrunner, Herbert, Raimund Seidel, and Micha Sharir. “On the Zone Theorem for Hyperplane Arrangements,” 555:108–23. Springer, 1991. https://doi.org/10.1007/BFb0038185.
View | DOI
 
[88]
1991 | Conference Paper | IST-REx-ID: 4059
Chazelle, Bernard, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas Guibas, John Hershberger, Micha Sharir, and Jack Snoeyink. “Ray Shooting in Polygons Using Geodesic Triangulations,” 510:661–73. Springer, 1991. https://doi.org/10.1007/3-540-54233-7_172.
View | DOI
 
[87]
1991 | Journal Article | IST-REx-ID: 4061
Agarwal, Pankaj, Herbert Edelsbrunner, Otfried Schwarzkopf, and Emo Welzl. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.” Discrete & Computational Geometry 6, no. 1 (1991): 407–22. https://doi.org/10.1007/BF02574698.
View | DOI
 
[86]
1991 | Conference Paper | IST-REx-ID: 4055
Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the Minmax Length Triangulation,” 414–23. IEEE, 1991. https://doi.org/10.1109/SFCS.1991.185400.
View | DOI
 
[85]
1991 | Journal Article | IST-REx-ID: 4062
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 6, no. 1 (1991): 435–42. https://doi.org/10.1007/BF02574700.
View | DOI
 
[84]
1991 | Journal Article | IST-REx-ID: 4051
Edelsbrunner, Herbert, and Weiping Shi. “An O(n Log^2 h) Time Algorithm for the Three-Dimensional Convex Hull Problem.” SIAM Journal on Computing 20, no. 2 (1991): 259–69. https://doi.org/10.1137/0220016 .
View | DOI
 
[83]
1991 | Journal Article | IST-REx-ID: 4056
Edelsbrunner, Herbert, and Péter Hajnal. “A Lower Bound on the Number of Unit Distances between the Vertices of a Convex Polygon.” Journal of Combinatorial Theory Series A 56, no. 2 (1991): 312–16. https://doi.org/10.1016/0097-3165(91)90042-F.
View | DOI
 
[82]
1990 | Journal Article | IST-REx-ID: 4064
Edelsbrunner, Herbert, and Diane Souvaine. “Computing Least Median of Squares Regression Lines and Guided Topological Sweep.” Journal of the American Statistical Association 85, no. 409 (1990): 115–19. https://doi.org/10.1080/01621459.1990.10475313.
View | DOI
 
[81]
1990 | Journal Article | IST-REx-ID: 4069
Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.” Combinatorica 10, no. 3 (1990): 251–60. https://doi.org/10.1007/BF02122779.
View | DOI
 
[80]
1990 | Conference Paper | IST-REx-ID: 4071
Edelsbrunner, Herbert, Tiow Tan, and Roman Waupotitsch. “An O(N^2log n) Time Algorithm for the MinMax Angle Triangulation,” 44–52. ACM, 1990. https://doi.org/10.1145/98524.98535.
View | DOI
 
[79]
1990 | Conference Paper | IST-REx-ID: 4076
Agarwal, Pankaj, Herbert Edelsbrunner, Otfried Schwarzkopf, and Emo Welzl. “ Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs,” 203–10. ACM, 1990. https://doi.org/10.1145/98524.98567.
View | DOI
 
[78]
1990 | Journal Article | IST-REx-ID: 4060
Edelsbrunner, Herbert, Franco Preparata, and Douglas West. “Tetrahedrizing Point Sets in Three Dimensions.” Journal of Symbolic Computation 10, no. 3–4 (1990): 335–47. https://doi.org/10.1016/S0747-7171(08)80068-5.
View | DOI | Download (ext.)
 
[77]
1990 | Journal Article | IST-REx-ID: 4065
Edelsbrunner, Herbert, Arch Robison, and Xiao Shen. “Covering Convex Sets with Non-Overlapping Polygons.” Discrete Mathematics 81, no. 2 (1990): 153–64. https://doi.org/10.1016/0012-365X(90)90147-A.
View | DOI
 
[76]
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 5, no. 1 (1990): 161–96. https://doi.org/ 10.1007/BF02187784.
View | DOI
 
[75]
1990 | Conference Paper | IST-REx-ID: 4077
Aronov, Boris, Bernard Chazelle, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Rephael Wenger. “Points and Triangles in the Plane and Halving Planes in Space,” 112–15. ACM, 1990. https://doi.org/10.1145/98524.98548.
View | DOI
 
[74]
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 5, no. 1 (1990): 197–216. https://doi.org/10.1007/BF02187785.
View | DOI
 
[73]
1990 | Conference Paper | IST-REx-ID: 4073
Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, and Jack Snoeyink. “Counting and Cutting Cycles of Lines and Rods in Space,” 242–51. IEEE, 1990. https://doi.org/10.1109/FSCS.1990.89543.
View | DOI
 
[72]
1990 | Conference Paper | IST-REx-ID: 4078
Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, John Hershberger, Raimund Seidel, and Micha Sharir. “Slimming down by Adding; Selecting Heavily Covered Points,” 116–27. ACM, 1990. https://doi.org/10.1145/98524.98551.
View | DOI
 
[71]
1990 | Conference Paper | IST-REx-ID: 4067
Edelsbrunner, Herbert, and Micha Sharir. “A Hyperplane Incidence Problem with Applications to Counting Distances,” 450:419–28. Springer, 1990. https://doi.org/10.1007/3-540-52921-7_91.
View | DOI
 
[70]
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 5, no. 1 (1990): 99–160. https://doi.org/10.1007/BF02187783.
View | DOI
 
[69]
1990 | Book Chapter | IST-REx-ID: 3565
Dobkin, David, Herbert Edelsbrunner, and Chee Yap. “Probing Convex Polytopes.” In Autonomous Robot Vehicles, edited by Ingemar Cox and Gordon Wilfong, 328–41. Springer, 1990. https://doi.org/10.1007/978-1-4613-8997-2_25.
View | DOI
 
[68]
1990 | Journal Article | IST-REx-ID: 4063
Edelsbrunner, Herbert, and Ernst Mücke. “Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms.” ACM Transactions on Graphics 9, no. 1 (1990): 66–104. https://doi.org/10.1145/77635.77639.
View | DOI
 
[67]
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 5, no. 1 (1990): 35–42. https://doi.org/ 10.1007/BF02187778.
View | DOI
 
[66]
1990 | Journal Article | IST-REx-ID: 4070
Edelsbrunner, Herbert, Mark Overmars, Emo Welzl, Irith Hartman, and Jack Feldman. “Ranking Intervals under Visibility Constraints.” International Journal of Computer Mathematics 34, no. 3–4 (1990): 129–44. https://doi.org/10.1080/00207169008803871.
View | DOI
 
[65]
1990 | Journal Article | IST-REx-ID: 4075
Dobkin, David, Herbert Edelsbrunner, and Mark Overmars. “Searching for Empty Convex Polygons.” Algorithmica 5, no. 4 (1990): 561–71. https://doi.org/10.1007/BF01840404.
View | DOI
 
[64]
1989 | Journal Article | IST-REx-ID: 4083
Yao, F., David Dobkin, Herbert Edelsbrunner, and Michael Paterson. “Partitioning Space for Range Queries.” SIAM Journal on Computing 18, no. 2 (1989): 371–84. https://doi.org/10.1137/0218025.
View | DOI
 
[63]
1989 | Journal Article | IST-REx-ID: 4088
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 4, no. 1 (1989): 433–66. https://doi.org/10.1007/BF02187742.
View | DOI
 
[62]
1989 | Journal Article | IST-REx-ID: 4084
Edelsbrunner, Herbert, Günter Rote, and Emo Welzl. “Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.” Theoretical Computer Science 66, no. 2 (1989): 157–80. https://doi.org/10.1016/0304-3975(89)90133-3.
View | DOI
 
[61]
1989 | Journal Article | IST-REx-ID: 4089
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 4, no. 1 (1989): 523–39. https://doi.org/10.1007/BF02187745.
View | DOI
 
[60]
1989 | Conference Paper | IST-REx-ID: 3549
Edelsbrunner, Herbert. “Spatial Triangulations with Dihedral Angle Conditions,” 83–89. Institute of the Electronics, Information and Communication Enginneers, 1989.
View
 
[59]
1989 | Journal Article | IST-REx-ID: 4080
Edelsbrunner, Herbert, Nany Hasan, Raimund Seidel, and Xiao Shen. “Circles through Two Points That Always Enclose Many Points.” Geometriae Dedicata 32, no. 1 (1989): 1–12. https://doi.org/10.1007/BF00181432.
View | DOI
 
[58]
1989 | Conference Paper | IST-REx-ID: 4085
Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension,” 145–51. ACM, 1989. https://doi.org/10.1145/73833.73850.
View | DOI
 
[57]
1989 | Conference Paper | IST-REx-ID: 4092
Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, and Micha Sharir. “A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications,” 372:179–93. Springer, 1989. https://doi.org/10.1007/BFb0035760.
View | DOI
 
[56]
1989 | Journal Article | IST-REx-ID: 4079
Edelsbrunner, Herbert, and Steven Skiena. “On the Number of Furthest Neighbor Pairs in a Point Set.” American Mathematical Monthly 96, no. 7 (1989): 614–18.
View | Download (ext.)
 
[55]
1989 | Journal Article | IST-REx-ID: 4081
Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.” Discrete & Computational Geometry 4, no. 1 (1989): 311–36. https://doi.org/10.1007/BF02187733.
View | DOI
 
[54]
1989 | Journal Article | IST-REx-ID: 4086
Edelsbrunner, Herbert. “The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces .” Discrete & Computational Geometry 4, no. 4 (1989): 337–43. https://doi.org/10.1007/BF02187734.
View | DOI
 
[53]
1989 | Journal Article | IST-REx-ID: 4093
Chazelle, Bernard, Herbert Edelsbrunner, and Leonidas Guibas. “The Complexity of Cutting Complexes.” Discrete & Computational Geometry 4, no. 1 (1989): 139–81. https://doi.org/10.1007/BF02187720.
View | DOI
 
[52]
1989 | Journal Article | IST-REx-ID: 4082
Edelsbrunner, Herbert, and Leonidas Guibas. “Topologically Sweeping an Arrangement.” Journal of Computer and System Sciences 38, no. 1 (1989): 165–94. https://doi.org/10.1016/0022-0000(89)90038-X.
View | DOI
 
[51]
1989 | Conference Paper | IST-REx-ID: 4087
Edelsbrunner, Herbert, Franco Preparata, and Douglas West. “Tetrahedrizing Point Sets in Three Dimensions,” 358:315–31. Springer, 1989. https://doi.org/10.1007/3-540-51084-2_31.
View | DOI
 
[50]
1988 | Journal Article | IST-REx-ID: 4090
Edelsbrunner, Herbert, and Franco Preparata. “Minimum Polygonal Separation.” Information and Computation 77, no. 3 (1988): 218–32. https://doi.org/10.1016/0890-5401(88)90049-1.
View | DOI
 
[49]
1988 | Journal Article | IST-REx-ID: 4091
Edelsbrunner, Herbert, and Steven Skiena. “Probing Convex Polygons with X-Rays.” SIAM Journal on Computing 17, no. 5 (1988): 870–82. https://doi.org/10.1137/0217054 .
View | DOI
 
[48]
1988 | Conference Paper | IST-REx-ID: 4096
Edelsbrunner, Herbert. “Geometric Structures in Computational Geometry,” 317:201–13. Springer, 1988. https://doi.org/10.1007/3-540-19488-6_117.
View | DOI
 
[47]
1988 | Conference Paper | IST-REx-ID: 4097
Edelsbrunner, Herbert, Leonidas Guibas, János Pach, Richard Pollack, Raimund Seidel, and Micha Sharir. “Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms,” 317:214–29. Springer, 1988. https://doi.org/10.1007/3-540-19488-6_118.
View | DOI
 
[46]
1987 | Journal Article | IST-REx-ID: 4095
Chazelle, Bernard, and Herbert Edelsbrunner. “An Improved Algorithm for Constructing Kth-Order Voronoi Diagrams.” IEEE Transactions on Computers 36, no. 11 (1987): 1349–54. https://doi.org/10.1109/TC.1987.5009474.
View | DOI
 
[45]
1987 | Journal Article | IST-REx-ID: 4100
Chazelle, Bernard, and Herbert Edelsbrunner. “Linear Space Data Structures for Two Types of Range Search.” Discrete & Computational Geometry 2, no. 1 (1987): 113–26. https://doi.org/10.1007/BF02187875.
View | DOI
 
[44]
1987 | Book | IST-REx-ID: 3900
Edelsbrunner, Herbert. Algorithms in Combinatorial Geometry. Vol. 10. Springer, 1987.
View | Files available
 
[43]
1987 | Conference Paper | IST-REx-ID: 3514
Edelsbrunner, Herbert, János Pach, Jacob Schwartz, and Micha Sharir. “On the Lower Envelope of Bivariate Functions and Its Applications,” 27–37. IEEE, 1987. https://doi.org/10.1109/SFCS.1987.44.
View | DOI
 
[42]
1987 | Journal Article | IST-REx-ID: 4101
Edelsbrunner, Herbert, and Mark Overmars. “Zooming by Repeated Range Detection.” Information Processing Letters 24, no. 6 (1987): 413–17. https://doi.org/10.1016/0020-0190(87)90120-7.
View | DOI
 
[41]
1987 | Journal Article | IST-REx-ID: 4094
Edelsbrunner, Herbert, and Xiaojun Shen. “A Tight Lower Bound on the Size of Visibility Graphs.” Information Processing Letters 26, no. 2 (1987): 61–64. https://doi.org/10.1016/0020-0190(87)90038-X.
View | DOI
 
[40]
1987 | Journal Article | IST-REx-ID: 4102
Dobkin, David, and Herbert Edelsbrunner. “Space Searching for Intersecting Objects.” Journal of Algorithms 8, no. 3 (1987): 348–61. https://doi.org/10.1016/0196-6774(87)90015-0.
View | DOI
 
[39]
1986 | Journal Article | IST-REx-ID: 3580
Edelsbrunner, Herbert. “Edge-Skeletons in Arrangements with Applications.” Algorithmica 1, no. 1–4 (1986): 93–109. https://doi.org/10.1007/BF01840438.
View | DOI
 
[38]
1986 | Journal Article | IST-REx-ID: 4103
Edelsbrunner, Herbert, and Emo Welzl. “On the Maximal Number of Edges of Many Faces in an Arrangement.” Journal of Combinatorial Theory Series A 41, no. 2 (1986): 159–66. https://doi.org/10.1016/0097-3165(86)90078-6.
View | DOI
 
[37]
1986 | Journal Article | IST-REx-ID: 4108
Edelsbrunner, Herbert, and Raimund Seidel. “Voronoi Diagrams and Arrangements.” Discrete & Computational Geometry 1, no. 1 (1986): 25–44. https://doi.org/10.1007/BF02187681.
View | DOI
 
[36]
1986 | Journal Article | IST-REx-ID: 4110
Edelsbrunner, Herbert, and Emo Welzl. “Constructing Belts in Two-Dimensional Arrangements with Applications.” SIAM Journal on Computing 15, no. 1 (1986): 271–84. https://doi.org/10.1137/0215019.
View | DOI
 
[35]
1986 | Journal Article | IST-REx-ID: 3579
Edelsbrunner, Herbert, and Jerzy Jaromczyk. “How Often Can You See Yourself in a Convex Configuration of Mirrors?” Congressus Numerantium 53 (1986): 193–200.
View
 
[34]
1986 | Journal Article | IST-REx-ID: 4104
Edelsbrunner, Herbert, Leonidas Guibas, and Jorge Stolfi. “Optimal Point Location in a Monotone Subdivision.” SIAM Journal on Computing 15, no. 2 (1986): 317–40. https://doi.org/10.1137/0215023.
View | DOI
 
[33]
1986 | Journal Article | IST-REx-ID: 4109
Edelsbrunner, Herbert, Günter Haring, and D Hilbert. “Rectangular Point Location in D-Dimensions with Applications.” Computer Journal 29, no. 1 (1986): 76–82. https://doi.org/10.1093/comjnl/29.1.76.
View | DOI
 
[32]
1986 | Journal Article | IST-REx-ID: 4105
Edelsbrunner, Herbert, Joseph O’Rourke, and Raimund Seidel. “Constructing Arrangements of Lines and Hyperplanes with Applications.” SIAM Journal on Computing 15, no. 2 (1986): 341–63. https://doi.org/10.1137/0215024.
View | DOI
 
[31]
1986 | Journal Article | IST-REx-ID: 4098
Edelsbrunner, Herbert, and Gerd Stöckl. “The Number of Extreme Pairs of Finite Point-Sets in Euclidean Spaces.” Journal of Combinatorial Theory Series A 43, no. 2 (1986): 344–49. https://doi.org/10.1016/0097-3165(86)90075-0.
View | DOI
 
[30]
1986 | Journal Article | IST-REx-ID: 4106
Edelsbrunner, Herbert, and Roman Waupotitsch. “Computing a Ham-Sandwich Cut in Two Dimensions.” Journal of Symbolic Computation 2, no. 2 (1986): 171–78. https://doi.org/10.1016/S0747-7171(86)80020-7.
View | DOI
 
[29]
1986 | Journal Article | IST-REx-ID: 4099
Edelsbrunner, Herbert, and Emo Welzl. “Halfplanar Range Search in Linear Space and O(N0.695) Query Time.” Information Processing Letters 23, no. 5 (1986): 289–93. https://doi.org/10.1016/0020-0190(86)90088-8.
View | DOI
 
[28]
1986 | Journal Article | IST-REx-ID: 4107
Edelsbrunner, Herbert, and David Haussler. “The Complexity of Cells in 3-Dimensional Arrangements.” Discrete Mathematics 60, no. C (1986): 139–46. https://doi.org/10.1016/0012-365X(86)90008-7.
View | DOI
 
[27]
1985 | Journal Article | IST-REx-ID: 4115
Edelsbrunner, Herbert. “Computing the Extreme Distances between Two Convex Polygons.” Journal of Algorithms 6, no. 2 (1985): 213–24. https://doi.org/10.1016/0196-6774(85)90039-2.
View | DOI
 
[26]
1985 | Journal Article | IST-REx-ID: 4111
Edelsbrunner, Herbert, and Hermann Maurer. “Finding Extreme-Points in 3-Dimensions and Solving the Post-Office Problem in the Plane.” Information Processing Letters 21, no. 1 (1985): 39–47. https://doi.org/10.1016/0020-0190(85)90107-3.
View | DOI
 
[25]
1985 | Journal Article | IST-REx-ID: 4116
Edelsbrunner, Herbert. “Finding Transversals for Sets of Simple Geometric-Figures.” Theoretical Computer Science 35, no. 1 (1985): 55–69. https://doi.org/10.1016/0304-3975(85)90005-2.
View | DOI
 
[24]
1985 | Journal Article | IST-REx-ID: 4112
Edelsbrunner, Herbert, and Mark Overmars. “Batched Dynamic Solutions to Decomposable Searching Problems.” Journal of Algorithms 6, no. 4 (1985): 515–42. https://doi.org/10.1016/0196-6774(85)90030-6.
View | DOI
 
[23]
1985 | Journal Article | IST-REx-ID: 4113
Edelsbrunner, Herbert, and Emo Welzl. “On the Number of Line Separations of a Finite Set in the Plane.” Journal of Combinatorial Theory Series A 38, no. 1 (1985): 15–29. https://doi.org/10.1016/0097-3165(85)90017-2.
View | DOI
 
[22]
1985 | Journal Article | IST-REx-ID: 4120
Chazelle, Bernard, and Herbert Edelsbrunner. “Optimal Solutions for a Class of Point Retrieval Problems.” Journal of Symbolic Computation 1, no. 1 (1985): 47–56. https://doi.org/10.1016/S0747-7171(85)80028-6.
View | DOI
 
[21]
1985 | Journal Article | IST-REx-ID: 4114
Day, William, and Herbert Edelsbrunner. “Investigation of Proportional Link Linkage Clustering Methods.” Journal of Classification 2, no. 2–3 (1985): 239–54. https://doi.org/10.1007/BF01908077.
View | DOI
 
[20]
1984 | Conference Paper | IST-REx-ID: 4122
Edelsbrunner, Herbert. “Key-Problems and Key-Methods in Computational Geometry,” 166:1–13. Springer, 1984. https://doi.org/10.1007/3-540-12920-0_1.
View | DOI
 
[19]
1984 | Journal Article | IST-REx-ID: 4123
Edelsbrunner, Herbert, Mark Overmars, and Raimund Seidel. “Some Methods of Computational Geometry Applied to Computer Graphics.” Computer Vision, Graphics, and Image Processing 28, no. 1 (1984): 92–108. https://doi.org/10.1016/0734-189X(84)90142-7.
View | DOI
 
[18]
1984 | Conference Paper | IST-REx-ID: 3513
Dobkin, David, and Herbert Edelsbrunner. “Ham-Sandwich Theorems Applied to Intersection Problems,” 88–99. Teubner, 1984.
View | Download (ext.)
 
[17]
1984 | Journal Article | IST-REx-ID: 4117
Edelsbrunner, Herbert, Jan Van Leeuwen, Thomas Ottmann, and Derick Wood. “Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space.” Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications 18, no. 2 (1984): 171–83.
View
 
[16]
1984 | Journal Article | IST-REx-ID: 4118
Edelsbrunner, Herbert, Joseph O’Rourke, and Emo Welzl. “Stationing Guards in Rectilinear Art Galleries.” Computer Vision, Graphics, and Image Processing 27, no. 2 (1984): 167–76. https://doi.org/10.1016/S0734-189X(84)80041-9.
View | DOI
 
[15]
1984 | Journal Article | IST-REx-ID: 4125
Aurenhammer, Franz, and Herbert Edelsbrunner. “An Optimal Algorithm for Constructing the Weighted Voronoi Diagram in the Plane.” Pattern Recognition 17, no. 2 (1984): 251–57. https://doi.org/10.1016/0031-3203(84)90064-5.
View | DOI
 
[14]
1984 | Conference Paper | IST-REx-ID: 4119
Edelsbrunner, Herbert, and Emo Welzl. “Monotone Edge Sequences in Line Arrangements and Applications,” 176:265–72. Springer, 1984. https://doi.org/10.1007/BFb0030307.
View | DOI
 
[13]
1984 | Journal Article | IST-REx-ID: 4121
Day, William, and Herbert Edelsbrunner. “Efficient Algorithms for Agglomerative Hierarchical Clustering Methods.” Journal of Classification 1, no. 1 (1984): 7–24. https://doi.org/10.1007/BF01890115.
View | DOI | Download (ext.)
 
[12]
1983 | Journal Article | IST-REx-ID: 4127
Edelsbrunner, Herbert. “A New Approach to Rectangle Intersections Part 2.” International Journal of Computer Mathematics 13, no. 3–4 (1983): 221–29. https://doi.org/10.1080/00207168308803365.
View | DOI
 
[11]
1983 | Book Chapter | IST-REx-ID: 3562
Bucher, W., and Herbert Edelsbrunner. “On Expected- and Worst-Case Segment Trees.” In Computational Geometry: Theory and Applications, edited by Franco Preparata, 1:109–25. Elsevier, 1983.
View | Download (ext.)
 
[10]
1983 | Journal Article | IST-REx-ID: 4128
Edelsbrunner, Herbert, David Kirkpatrick, and Raimund Seidel. “On the Shape of a Set of Points in the Plane.” IEEE Transactions on Information Theory 29, no. 4 (1983): 551–59. https://doi.org/10.1109/TIT.1983.1056714 .
View | DOI
 
[9]
1983 | Book Chapter | IST-REx-ID: 3563
Edelsbrunner, Herbert, Mark Overmars, and Derick Wood. “Graphics in Flatland: A Case Study.” In Computational Geometry: Theory and Applications, edited by Franco Preparata, 1:35–59. Elsevier, 1983.
View
 
[8]
1983 | Conference Paper | IST-REx-ID: 4124
Edelsbrunner, Herbert, and Emo Welzl. “On the Number of Equal-Sized Semispaces of a Set of Points in the Plane,” 154:182–87. Springer, 1983. https://doi.org/10.1007/BFb0036908.
View | DOI
 
[7]
1983 | Book Chapter | IST-REx-ID: 3564
Edelsbrunner, Herbert. “Neue Entwicklungen Im Bereich Datenstrukturen.” In Überblicke Informationsverarbeitung , edited by Hermann Maurer, 55–109. BI Wissenschaftsverlag, 1983.
View | Download (ext.)
 
[6]
1983 | Journal Article | IST-REx-ID: 4126
Edelsbrunner, Herbert. “A New Approach to Rectangle Intersections Part 1.” International Journal of Computer Mathematics 13, no. 3–4 (1983): 209–19. https://doi.org/10.1080/00207168308803364.
View | DOI
 
[5]
1982 | Journal Article | IST-REx-ID: 4130
Edelsbrunner, Herbert, Hermann Maurer, and David Kirkpatrick. “Polygonal Intersection Searching.” Information Processing Letters 14, no. 2 (1982): 74–79. https://doi.org/10.1016/0020-0190(82)90090-4.
View | DOI
 
[4]
1982 | Journal Article | IST-REx-ID: 4129
Edelsbrunner, Herbert, Hermann Maurer, Franco Preparata, Arnold Rosenberg, Emo Welzl, and Derick Wood. “Stabbing Line Segments.” Bit 22, no. 3 (1982): 274–81. https://doi.org/10.1007/BF01934440.
View | DOI
 
[3]
1982 | Journal Article | IST-REx-ID: 4131
Edelsbrunner, Herbert, and Mark Overmars. “On the Equivalence of Some Rectangle Problems.” Information Processing Letters 14, no. 3 (1982): 124–27. https://doi.org/10.1016/0020-0190(82)90068-0.
View | DOI
 
[2]
1981 | Journal Article | IST-REx-ID: 4132
Edelsbrunner, Herbert, and Hermann Maurer. “On the Intersection of Orthogonal Objects.” Information Processing Letters 13, no. 4–5 (1981): 177–81. https://doi.org/10.1016/0020-0190(81)90053-3.
View | DOI
 
[1]
1981 | Journal Article | IST-REx-ID: 4133
Edelsbrunner, Herbert, and Hermann Maurer. “A Space-Optimal Solution of General Region Location.” Theoretical Computer Science 16, no. 3 (1981): 329–36. https://doi.org/10.1016/0304-3975(81)90103-1.
View | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed