279 Publications

Mark all

[279]
2019 | Conference Paper | IST-REx-ID: 6648   OA
Edelsbrunner, Herbert, et al. “Topological Data Analysis in Information Space.” 35th International Symposium on Computational Geometry, vol. 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 31:1-31:14, doi:10.4230/LIPICS.SOCG.2019.31.
View | Files available | DOI | arXiv
 
[278]
2019 | Journal Article | IST-REx-ID: 6756   OA
Pranav, Pratyush, et al. “Unexpected Topology of the Temperature Fluctuations in the Cosmic Microwave Background.” Astronomy and Astrophysics, vol. 627, A163, EDP Sciences, 2019, doi: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, vol. 73, Elsevier, 2019, pp. 1–15, doi: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, vol. 68, Elsevier, 2018, pp. 119–33, doi: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, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.SoCG.2018.34.
View | Files available | DOI
 
[274]
2018 | Conference Paper | IST-REx-ID: 188   OA
Edelsbrunner, Herbert, et al. Smallest Enclosing Spheres and Chernoff Points in Bregman Geometry. Vol. 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 35:1-35:13, doi: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, vol. 28, no. 5, Institute of Mathematical Statistics, 2018, pp. 3215–38, doi: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, vol. 32, no. 1, Society for Industrial and Applied Mathematics , 2018, pp. 750–82, doi: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, Springer, 2018, doi:10.1007/s00454-018-0049-2.
View | Files available | DOI
 
[270]
2017 | Journal Article | IST-REx-ID: 1022   OA
Pranav, Pratyush, et al. “The Topology of the Cosmic Web in Terms of Persistent Betti Numbers.” Monthly Notices of the Royal Astronomical Society, vol. 465, no. 4, Oxford University Press, 2017, pp. 4281–310, doi:10.1093/mnras/stw2862.
View | DOI | Download (ext.)
 
[269]
2017 | Journal Article | IST-REx-ID: 1173   OA
Edelsbrunner, Herbert, et al. “The Voronoi Functional Is Maximized by the Delaunay Triangulation in the Plane.” Combinatorica, vol. 37, no. 5, Springer, 2017, pp. 887–910, doi:10.1007/s00493-016-3308-y.
View | DOI | Download (ext.)
 
[268]
2017 | Journal Article | IST-REx-ID: 718   OA
Edelsbrunner, Herbert, et al. “Expected Sizes of Poisson Delaunay Mosaics and Their Discrete Morse Functions.” Advances in Applied Probability, vol. 49, no. 3, Cambridge University Press, 2017, pp. 745–67, doi: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, vol. 369, no. 5, American Mathematical Society, 2017, pp. 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. Vol. 77, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, pp. 391–3916, doi: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.
View | Download (ext.) | arXiv
 
[264]
2017 | Book Chapter | IST-REx-ID: 84
Edelsbrunner, Herbert, and Patrice Koehl. “Computational Topology for Structural Molecular Biology.” Handbook of Discrete and Computational Geometry, Third Edition, edited by Csaba Toth et al., CRC Press, 2017, pp. 1709–35, doi: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, vol. 287, Academic Press, 2016, pp. 674–703, doi: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, vol. 54, Elsevier, 2016, pp. 169–74, doi:10.1016/j.endm.2016.09.030.
View | DOI
 
[261]
2016 | Journal Article | IST-REx-ID: 1289
Dunaeva, Olga, et al. “The Classification of Endoscopy Images with Persistent Homology.” Pattern Recognition Letters, vol. 83, no. 1, Elsevier, 2016, pp. 13–22, doi:10.1016/j.patrec.2015.12.012.
View | Files available | DOI
 
[260]
2015 | Journal Article | IST-REx-ID: 1793   OA
Symonova, Olga, et al. “DynamicRoots: A Software Platform for the Reconstruction and Analysis of Growing Plant Roots.” PLoS One, vol. 10, no. 6, e0127657, Public Library of Science, 2015, doi:10.1371/journal.pone.0127657.
View | Files available | DOI
 
[259]
2015 | Journal Article | IST-REx-ID: 3585
Cao, Thanh, et al. “Proof of Correctness of the Digital Delaunay Triangulation Algorithm.” Computational Geometry: Theory and Applications, vol. 48, no. 7, Elsevier, 2015, pp. 507–19, doi:10.1016/j.comgeo.2015.04.001.
View | DOI
 
[258]
2015 | Conference Paper | IST-REx-ID: 1495   OA
Edelsbrunner, Herbert, et al. “Relaxed Disk Packing.” Proceedings of the 27th Canadian Conference on Computational Geometry, vol. 2015–August, Queen’s University, 2015, pp. 128–35.
View | Download (ext.)
 
[257]
2015 | Journal Article | IST-REx-ID: 1578
Cao, Thanhtung, et al. “Triangulations from Topologically Correct Digital Voronoi Diagrams.” Computational Geometry, vol. 48, no. 7, Elsevier, 2015, pp. 507–19, doi:10.1016/j.comgeo.2015.04.001.
View | DOI
 
[256]
2015 | Conference Paper | IST-REx-ID: 1567
Edelsbrunner, Herbert. Shape, Homology, Persistence, and Stability. Vol. 9411, Springer, 2015.
View
 
[255]
2015 | Conference Paper | IST-REx-ID: 1568
Dunaeva, Olga, et al. “The Classification of Endoscopy Images with Persistent Homology.” Proceedings - 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, IEEE, 2015, p. 7034731, doi:10.1109/SYNASC.2014.81.
View | Files available | DOI
 
[254]
2015 | Journal Article | IST-REx-ID: 2035   OA
Edelsbrunner, Herbert, et al. “The Persistent Homology of a Self-Map.” Foundations of Computational Mathematics, vol. 15, no. 5, Springer, 2015, pp. 1213–44, doi: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. European Mathematical Society Publishing House, 2014, pp. 31–50, doi:10.4171/120-1/3.
View | Files available | DOI
 
[252]
2014 | Journal Article | IST-REx-ID: 1876   OA
Dolbilin, Nikolai, et al. “Functionals on Triangulations of Delaunay Sets.” Moscow Mathematical Journal, vol. 14, no. 3, Independent University of Moscow, 2014, pp. 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.” Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2014, pp. 152–60, doi: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, vol. 50, no. 1, Springer, 2014, pp. 164–77, doi:10.1007/s10851-013-0468-x.
View | Files available | DOI
 
[249]
2014 | Journal Article | IST-REx-ID: 1929
Alexeev, V. V., et al. “An Algorithm for Cartographic Generalization That Preserves Global Topology.” Journal of Mathematical Sciences (United States), vol. 203, no. 6, Springer, 2014, pp. 754–60, doi: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.” Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 484–90, doi:10.1145/2582112.2582167.
View | DOI | Download (ext.)
 
[247]
2013 | Journal Article | IST-REx-ID: 2859   OA
Bendich, Paul, et al. “Homology and Robustness of Level and Interlevel Sets.” Homology, Homotopy and Applications, vol. 15, no. 1, International Press, 2013, pp. 51–72, doi: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.” 17th IAPR International Conference on Discrete Geometry for Computer Imagery, vol. 7749, Springer, 2013, pp. XV–XIX, doi: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.” 2013 Proceedings of the 15th Workshop on Algorithm Engineering and Experiments, Society of Industrial and Applied Mathematics, 2013, pp. 70–77, doi:10.1137/1.9781611972931.6.
View | Files available | DOI
 
[244]
2013 | Journal Article | IST-REx-ID: 2887   OA
Fang, Suqin, et al. “Genotypic Recognition and Spatial Responses by Rice Roots.” PNAS, vol. 110, no. 7, National Academy of Sciences, 2013, pp. 2670–75, doi:10.1073/pnas.1222821110.
View | DOI | Download (ext.)
 
[243]
2013 | Journal Article | IST-REx-ID: 2822   OA
Topp, Christopher, et al. “3D Phenotyping and Quantitative Trait Locus Mapping Identify Core Regions of the Rice Genome Controlling Root Architecture.” PNAS, vol. 110, no. 18, National Academy of Sciences, 2013, pp. E1695–704, doi:10.1073/pnas.1304354110.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[242]
2013 | Journal Article | IST-REx-ID: 2815
Edelsbrunner, Herbert, et al. “Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.” Discrete & Computational Geometry, vol. 49, no. 4, Springer, 2013, pp. 797–822, doi: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, vol. 67, no. 6, Moscow Mathematical Society , 2012, pp. 203–04, doi: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, vol. 47, no. 2, Springer, 2012, pp. 393–414, doi:10.1007/s00454-011-9382-4.
View | Files available | DOI
 
[239]
2012 | Journal Article | IST-REx-ID: 3310   OA
Bendich, Paul, et al. “A Point Calculus for Interlevel Set Homology.” Pattern Recognition Letters, vol. 33, no. 11, Elsevier, 2012, pp. 1436–44, doi: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, vol. 67, no. 6, IOP Publishing Ltd., 2012, pp. 1167–68, doi:10.1070/RM2012v067n06ABEH004820.
View | Files available | DOI
 
[237]
2012 | Journal Article | IST-REx-ID: 2902
Edelsbrunner, Herbert, et al. “Fractal and Computational Geometry for Generalizing Cartographic Objects.” Modeling and Analysis of Information Systems, vol. 19, no. 6, Technische Universität Darmstadt, 2012, pp. 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.” Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry , ACM, 2012, pp. 249–58, doi: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. IEEE, 2012, pp. 41–48, doi:10.1109/ISVD.2012.11.
View | Files available | DOI
 
[234]
2012 | Journal Article | IST-REx-ID: 2941   OA
Dolbilin, Nikolai, et al. “On the Optimality of Functionals over Triangulations of Delaunay Sets.” Russian Mathematical Surveys, vol. 67, no. 4, IOP Publishing, 2012, pp. 781–83, doi:10.1070/RM2012v067n04ABEH004807.
View | Files available | DOI
 
[233]
2012 | Conference Paper | IST-REx-ID: 3134
Edelsbrunner, Herbert, et al. “Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.” Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry , ACM, 2012, pp. 91–100, doi:10.1145/2261250.2261265.
View | Files available | DOI
 
[232]
2012 | Journal Article | IST-REx-ID: 2911
Edelsbrunner, Herbert, et al. “Open Problems in Discrete and Computational Geometry.” Automatic Control and Computer Sciences, vol. in print, Springer, 2012.
View
 
[231]
2012 | Journal Article | IST-REx-ID: 3159   OA
Mileyko, Yuriy, et al. “Hierarchical Ordering of Reticular Networks.” PLoS One, vol. 7, no. 6, e36715, Public Library of Science, 2012, doi:10.1371/journal.pone.0036715.
View | Files available | DOI
 
[230]
2011 | Journal Article | IST-REx-ID: 3965
Wang, Bei, et al. “Computing Elevation Maxima by Searching the Gauss Sphere.” Journal of Experimental Algorithmics, vol. 16, no. 2.2, ACM, 2011, pp. 1–13, doi:10.1145/1963190.1970375.
View | DOI
 
[229]
2011 | Journal Article | IST-REx-ID: 3377   OA
Edelsbrunner, Herbert, et al. “Quantifying Transversality by Measuring the Robustness of Intersections.” Foundations of Computational Mathematics, vol. 11, no. 3, Springer, 2011, pp. 345–61, doi:10.1007/s10208-011-9090-8.
View | DOI | Download (ext.)
 
[228]
2011 | Journal Article | IST-REx-ID: 3334
Edelsbrunner, Herbert, et al. “Letter from the New Editors-in-Chief.” Discrete & Computational Geometry, vol. 45, no. 1, Springer, 2011, pp. 1–2, doi:10.1007/s00454-010-9313-9.
View | DOI
 
[227]
2011 | Book Chapter | IST-REx-ID: 3311
Edelsbrunner, Herbert. “Alpha Shapes - a Survey.” Tessellations in the Sciences, Springer, 2011.
View
 
[226]
2011 | Book Chapter | IST-REx-ID: 3335   OA
Van De Weygaert, Rien, et al. “Alpha, Betti and the Megaparsec Universe: On the Topology of the Cosmic Web.” Transactions on Computational Science XIV, edited by Marina Gavrilova et al., vol. 6970, Springer, 2011, pp. 60–101, doi: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.” Rainbow of Computer Science, edited by Cristian Calude et al., vol. 6570, Springer, 2011, pp. 20–35, doi:10.1007/978-3-642-19391-0_2.
View | Files available | DOI
 
[224]
2011 | Conference Poster | IST-REx-ID: 3312   OA
Zheng, Ying, et al. “ Detailed Reconstruction of 3D Plant Root Shape.” Proceedings of the IEEE International Conference on Computer Vision, IEEE, 2011, p. 6126475, doi: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.” Proceedings of the IEEE International Conference on Computer Vision, IEEE, 2011, p. 6126271, doi:10.1109/ICCV.2011.6126271.
View | Files available | DOI
 
[222]
2010 | Book Chapter | IST-REx-ID: 3795   OA
Edelsbrunner, Herbert, et al. “The Stability of the Apparent Contour of an Orientable 2-Manifold.” Topological Data Analysis and Visualization: Theory, Algorithms and Applications, Springer, 2010, pp. 27–42, doi:10.1007/978-3-642-15014-2_3.
View | Files available | DOI
 
[221]
2010 | Conference Paper | IST-REx-ID: 3853   OA
Chatterjee, Krishnendu, et al. Mean-Payoff Automaton Expressions. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–83, doi:10.1007/978-3-642-15375-4_19.
View | Files available | DOI
 
[220]
2010 | Conference Paper | IST-REx-ID: 3848
Bendich, Paul, et al. The Robustness of Level Sets. Vol. 6346, Springer, 2010, pp. 1–10, doi:10.1007/978-3-642-15775-2_1.
View | DOI
 
[219]
2010 | Journal Article | IST-REx-ID: 3901   OA
Bendich, Paul, et al. “Computing Robustness and Persistence for Images.” IEEE Transactions of Visualization and Computer Graphics, vol. 16, no. 6, IEEE, 2010, pp. 1251–60, doi:10.1109/TVCG.2010.139.
View | Files available | DOI
 
[218]
2010 | Conference Paper | IST-REx-ID: 3849   OA
Bendich, Paul, et al. Persistent Homology under Non-Uniform Error. Vol. 6281, Springer, 2010, pp. 12–23, doi:10.1007/978-3-642-15155-2_2.
View | Files available | DOI
 
[217]
2010 | Journal Article | IST-REx-ID: 3964
Cohen Steiner, David, et al. “Lipschitz Functions Have L_p-Stable Persistence.” Foundations of Computational Mathematics, vol. 10, no. 2, Springer, 2010, pp. 127–39, doi: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, et al. “Stability and Computation of Medial Axes: A State-of-the-Art Report.” Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration, Springer, 2009, pp. 109–25, doi:10.1007/b106657_6.
View | DOI | Download (ext.)
 
[214]
2009 | Journal Article | IST-REx-ID: 3966
Cohen Steiner, David, et al. “Extending Persistence Using Poincare and Lefschetz Duality.” Foundations of Computational Mathematics, vol. 9, no. 1, Springer, 2009, pp. 79–103, doi:10.1007/s10208-008-9027-z.
View | DOI
 
[213]
2009 | Conference Paper | IST-REx-ID: 3967
Cohen Steiner, David, et al. Persistent Homology for Kernels, Images, and Cokernels. SIAM, 2009, pp. 1011–20.
View
 
[212]
2009 | Conference Paper | IST-REx-ID: 3968   OA
Edelsbrunner, Herbert, and John Harer. The Persistent Morse Complex Segmentation of a 3-Manifold. Vol. 5903, Springer, 2009, pp. 36–50, doi:10.1007/978-3-642-10470-1_4.
View | Files available | DOI
 
[211]
2008 | Conference Paper | IST-REx-ID: 3974
Edelsbrunner, Herbert, et al. Reeb Spaces of Piecewise Linear Mappings. ACM, 2008, pp. 242–50, doi:10.1145/1377676.1377720.
View | DOI
 
[210]
2008 | Journal Article | IST-REx-ID: 3970
Dequéant, Mary, et al. “Comparison of Pattern Detection Methods in Microarray Time Series of the Segmentation Clock.” PLoS One, vol. 3, no. 8, Public Library of Science, 2008, doi:10.1371/journal.pone.0002856.
View | DOI
 
[209]
2008 | Book Chapter | IST-REx-ID: 3577
Biasotti, Silvia, et al. “Skeletal Structures.” Shape Analysis and Structuring, Springer, 2008, pp. 145–83, doi: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.” Surveys on Discrete and Computational Geometry: Twenty Years Later, American Mathematical Society, 2008, pp. 257–82.
View
 
[207]
2008 | Journal Article | IST-REx-ID: 3971
Edelsbrunner, Herbert, et al. “Time-Varying Reeb Graphs for Continuous Space-Time Data.” Computational Geometry: Theory and Applications, vol. 41, no. 3, Elsevier, 2008, pp. 149–66, doi:10.1016/j.comgeo.2007.11.001.
View | DOI
 
[206]
2007 | Conference Paper | IST-REx-ID: 3561   OA
Attali, Dominique, et al. Weak Witnesses for Delaunay Triangulations of Submanifolds. ACM, 2007, pp. 143–50, doi:10.1145/1236246.1236267.
View | DOI | Download (ext.)
 
[205]
2007 | Journal Article | IST-REx-ID: 3972
Cohen Steiner, David, et al. “Stability of Persistence Diagrams.” Discrete & Computational Geometry, vol. 37, no. 1, Springer, 2007, pp. 103–20, doi: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, vol. 37, no. 1, Springer, 2007, pp. 59–77, doi: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, vol. 7, no. 4, Springer, 2007, pp. 391–404, doi:10.1007/s10208-005-0200-3.
View | DOI
 
[202]
2007 | Conference Paper | IST-REx-ID: 3981
Attali, Dominique, et al. Alpha-Beta Witness Complexes. Vol. 4619, Springer, 2007, pp. 386–97, doi:10.1007/978-3-540-73951-7_34.
View | DOI
 
[201]
2007 | Conference Paper | IST-REx-ID: 3975
Bendich, Paul, et al. Inferring Local Homology from Sampled Stratified Spaces. IEEE, 2007, pp. 536–46, doi:10.1109/FOCS.2007.33.
View | DOI
 
[200]
2007 | Journal Article | IST-REx-ID: 3976
Headd, Jeffrey, et al. “Protein-Protein Interfaces: Properties, Preferences, and Projections.” Journal of Proteome Research, vol. 6, no. 7, American Chemical Society, 2007, pp. 2576–86, doi:10.1021/pr070018+.
View | DOI
 
[199]
2006 | Patent | IST-REx-ID: 3511
Fu, Ping, et al. Manufacturing Methods and Systems for Rapid Production of Hearing-Aid Shells. Elsevier, 2006, doi:US 7,050,876 B1.
View | DOI | Download (ext.)
 
[198]
2006 | Conference Paper | IST-REx-ID: 3559
Cohen Steiner, David, et al. Vines and Vineyards by Updating Persistence in Linear Time. ACM, 2006, pp. 119–26, doi:10.1145/1137856.1137877.
View | DOI
 
[197]
2006 | Patent | IST-REx-ID: 3512
Fletcher, Yates, et al. Method, Apparatus and Computer Products That Reconstruct Surfaces from Data Points. Elsevier, 2006, doi:US 7,023,432 B2.
View | DOI | Download (ext.)
 
[196]
2006 | Journal Article | IST-REx-ID: 3978
Ban, Yih, et al. “Evaluating the Quality of NMR Structures by Local Density of Protons.” Proteins: Structure, Function and Bioinformatics, vol. 62, no. 4, Wiley-Blackwell, 2006, pp. 852–64, doi:10.1002/prot.20811.
View | DOI
 
[195]
2006 | Journal Article | IST-REx-ID: 3980
Agarwal, Pankaj, et al. “Extreme Elevation on a 2-Manifold.” Discrete & Computational Geometry, vol. 36, no. 4, Springer, 2006, pp. 553–72, doi:10.1007/s00454-006-1265-8.
View | DOI
 
[194]
2006 | Journal Article | IST-REx-ID: 3979
Ban, Yih, et al. “Interface Surfaces for Protein-Protein Complexes.” Journal of the ACM, vol. 53, no. 3, ACM, 2006, pp. 361–78, doi:10.1145/1147954.1147957.
View | DOI
 
[193]
2006 | Patent | IST-REx-ID: 3510
Edelsbrunner, Herbert, et al. Method, Apparatus and Computer Program Products for Automatically Generating NURBS Models of Triangulated Surfaces Using Homeomorphism. Elsevier, 2006, doi:US 6,996,505 B1.
View | DOI | Download (ext.)
 
[192]
2006 | Conference Paper | IST-REx-ID: 3560
Edelsbrunner, Herbert, et al. Persistence-Sensitive Simplification of Functions on 2-Manifolds. ACM, 2006, pp. 127–34, doi:10.1145/1137856.1137878.
View | DOI | Download (ext.)
 
[191]
2005 | Patent | IST-REx-ID: 3509
Williams, Steven, et al. Methods, Apparatus and Computer Program Products for Modeling Three-Dimensional Colored Objects. Elsevier, 2005, doi:US 6,853,373 B2.
View | DOI | Download (ext.)
 
[190]
2005 | Conference Paper | IST-REx-ID: 3557
Edelsbrunner, Herbert. Surface Tiling with Differential Topology. ACM, 2005, pp. 9–11, doi: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.” Combinatorial and Computational Geometry, vol. 52, Cambridge University Press, 2005, pp. 243–75.
View | Download (ext.)
 
[188]
2005 | Conference Paper | IST-REx-ID: 3982
Wang, Yusu, et al. Coarse and Reliable Geometric Alignment for Protein Docking. World Scientific Publishing, 2005, pp. 64–75, doi:10.1142/9789812702456_0007.
View | DOI
 
[187]
2005 | Conference Paper | IST-REx-ID: 3558
Attali, Dominique, et al. Extraction and Simplification of Iso-Surfaces in Tandem. ACM, 2005, pp. 139–48.
View | Download (ext.)
 
[186]
2005 | Journal Article | IST-REx-ID: 3983
Sohn, Jungsan, et al. “Experimental Validation of the Docking Orientation of Cdc25 with Its Cdk2-CycA Protein Substrate.” Biochemistry, vol. 44, no. 50, ACS, 2005, pp. 16563–73, doi:10.1021/bi0516879.
View | DOI
 
[185]
2004 | Journal Article | IST-REx-ID: 3984
Bremer, Peer, et al. “A Topological Hierarchy for Functions on Triangulated Surfaces.” IEEE Transactions on Visualization and Computer Graphics, vol. 10, no. 4, IEEE, 2004, pp. 385–96, doi:10.1109/TVCG.2004.3.
View | DOI
 
[184]
2004 | Conference Paper | IST-REx-ID: 3989
Edelsbrunner, Herbert, et al. Local and Global Comparison of Continuous Functions. IEEE, 2004, pp. 275–80, doi:10.1109/VISUAL.2004.68.
View | DOI
 
[183]
2004 | Book Chapter | IST-REx-ID: 3574
Edelsbrunner, Herbert. “Biological Applications of Computational Topology.” Handbook of Discrete and Computational Geometry, CRC Press, 2004, pp. 1395–412.
View | Download (ext.)
 
[182]
2004 | Journal Article | IST-REx-ID: 3985
Cole Mclaughlin, Kree, et al. “Loops in Reeb Graphs of 2-Manifolds.” Discrete & Computational Geometry, vol. 32, no. 2, Springer, 2004, pp. 231–44, doi: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.” Foundations of Computational Mathematics, vol. 312, Springer, 2004, pp. 37–57, doi:10.1017/CBO9781139106962.003.
View | DOI
 
[180]
2004 | Journal Article | IST-REx-ID: 3986
Bryant, Robert, et al. “The Area Derivative of a Space-Filling Diagram.” Discrete & Computational Geometry, vol. 32, no. 3, Springer, 2004, pp. 293–308, doi: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, vol. 10, no. 5, IEEE, 2004, pp. 587–97, doi:10.1109/TVCG.2004.32.
View | DOI
 
[178]
2004 | Conference Paper | IST-REx-ID: 3988
Choi, Vicky, et al. Local Search Heuristic for Rigid Protein Docking. Vol. 3240, Springer, 2004, pp. 218–29, doi:10.1007/978-3-540-30219-3_19.
View | DOI
 
[177]
2004 | Journal Article | IST-REx-ID: 3990
Agarwal, Pankaj, et al. “Computing the Writhing Number of a Polygonal Knot.” Discrete & Computational Geometry, vol. 32, no. 1, Springer, 2004, pp. 37–53, doi: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.” Discrete & Computational Geometry, Springer, 2003, pp. 379–404, doi: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.” Computer Science in Perspective: Essays Dedicated to Thomas Ottmann, vol. 2598, Springer, 2003, pp. 88–97, doi: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, vol. 100, no. 5, National Academy of Sciences, 2003, pp. 2203–08, doi:10.1073/pnas.0537830100.
View | DOI
 
[173]
2003 | Conference Paper | IST-REx-ID: 3997
Bremer, Peer, et al. A Multi-Resolution Data Structure for Two-Dimensional Morse-Smale Functions. IEEE, 2003, pp. 139–46, doi:10.1109/VISUAL.2003.1250365.
View | DOI
 
[172]
2003 | Conference Paper | IST-REx-ID: 3556
Edelsbrunner, Herbert, et al. Morse-Smale Complexes for Piecewise Linear 3-Manifolds. ACM, 2003, pp. 361–70, doi:10.1145/777792.777846.
View | DOI | Download (ext.)
 
[171]
2003 | Journal Article | IST-REx-ID: 3993
Edelsbrunner, Herbert, et al. “Hierarchical Morse-Smale Complexes for Piecewise Linear 2-Manifolds.” Discrete & Computational Geometry, vol. 30, no. 1, Springer, 2003, pp. 87–107, doi: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, vol. 26, no. 2, Elsevier, 2003, pp. 173–92, doi: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. Vol. 2866, Springer, 2003, pp. 135–51, doi: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, vol. 5, no. 2, International Press, 2003, pp. 19–37.
View | Download (ext.)
 
[167]
2002 | Journal Article | IST-REx-ID: 3996
Edelsbrunner, Herbert, et al. “Topological Persistence and Simplification.” Discrete & Computational Geometry, vol. 28, no. 4, Springer, 2002, pp. 511–33, doi:10.1007/s00454-002-2885-2.
View | DOI
 
[166]
2002 | Conference Paper | IST-REx-ID: 4003
Agarwal, Pankaj, et al. Computing the Writhing Number of a Polygonal Knot. SIAM, 2002, pp. 791–99.
View
 
[165]
2002 | Journal Article | IST-REx-ID: 3998
Edelsbrunner, Herbert, and Damrong Guoy. “An Experimental Study of Sliver Exudation.” Engineering with Computers, vol. 18, no. 3, Springer, 2002, pp. 229–40, doi: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, vol. 12, no. 1–2, World Scientific Publishing, 2002, pp. 143–72, doi: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, doi:US 6,377,865 B1.
View | DOI | Download (ext.)
 
[162]
2002 | Journal Article | IST-REx-ID: 3995
Agarwal, Pankaj, et al. “Algorithmic Issues in Modeling Motion.” ACM Computing Surveys, vol. 34, no. 4, ACM, 2002, pp. 550–72, doi:10.1145/592642.592647.
View | DOI
 
[161]
2001 | Journal Article | IST-REx-ID: 4002
Cheng, Siu, et al. “Design and Analysis of Planar Shape Deformation.” Computational Geometry: Theory and Applications, vol. 19, no. 2–3, Elsevier, 2001, pp. 205–18, doi:10.1016/S0925-7721(01)00020-7.
View | DOI
 
[160]
2001 | Journal Article | IST-REx-ID: 4007
Cheng, Ho, et al. “Dynamic Skin Triangulation.” Discrete & Computational Geometry, vol. 25, no. 4, Springer, 2001, pp. 525–68, doi: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 University Press, 2001, doi: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, doi:US 6,182,016 B1.
View | DOI | Download (ext.)
 
[157]
2001 | Conference Paper | IST-REx-ID: 4005
Cheng, Ho, et al. Dynamic Skin Triangulation. SIAM, 2001, pp. 47–56.
View
 
[156]
2001 | Journal Article | IST-REx-ID: 4001
Cheng, Ho, et al. “Shape Space from Deformation.” Computational Geometry: Theory and Applications, vol. 19, no. 2–3, Elsevier, 2001, pp. 191–204, doi: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, vol. 7, no. 5, Springer, 2001, pp. 379–99, doi:10.3217/jucs-007-05-0379.
View | DOI
 
[154]
2000 | Conference Paper | IST-REx-ID: 3555
Edelsbrunner, Herbert, et al. Smoothing and Cleaning up Slivers. ACM, 2000, pp. 273–77, doi:10.1145/335305.335338.
View | DOI | Download (ext.)
 
[153]
2000 | Conference Paper | IST-REx-ID: 4008
Edelsbrunner, Herbert, et al. Topological Persistance and Simplification. IEEE, 2000, pp. 454–63, doi:10.1109/SFCS.2000.892133.
View | DOI
 
[152]
2000 | Journal Article | IST-REx-ID: 4010
Cheng, Siu, et al. “Sliver Exudation.” Journal of the ACM, vol. 47, no. 5, ACM, 2000, pp. 883–904, doi: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, vol. 24, no. 4, Springer, 2000, pp. 707–19, doi: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, vol. 10, no. 3, World Scientific Publishing, 2000, pp. 267–84, doi:10.1142/S0218195900000164.
View | DOI
 
[149]
2000 | Journal Article | IST-REx-ID: 3583
Edelsbrunner, Herbert. “Triangulations and Meshes in Computational Geometry.” Acta Numerica, vol. 9, Cambridge University Press, 2000, pp. 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.” Zur Kunst Des Formalen Denkens, Passagen Verlag, 2000, pp. 153–71.
View | Download (ext.)
 
[147]
1999 | Conference Paper | IST-REx-ID: 3554
Jiao, Xiangmin, et al. Mesh Association: Formulation and Algorithms. Elsevier, 1999, pp. 75–82.
View | Download (ext.)
 
[146]
1999 | Journal Article | IST-REx-ID: 4014
Edelsbrunner, Herbert. “Deformable Smooth Surface Design.” Discrete & Computational Geometry, vol. 21, no. 1, Springer, 1999, pp. 87–115, doi:10.1007/PL00009412.
View | DOI
 
[145]
1999 | Journal Article | IST-REx-ID: 3582
Dey, Tamal, et al. “Topology Preserving Edge Contraction.” Publications de l’Institut Mathématique, vol. 66, Jugostampa, 1999, pp. 23–45.
View | Download (ext.)
 
[144]
1999 | Book Chapter | IST-REx-ID: 3571
Dey, Tamal, et al. “Computational Topology.” Advances in Discrete and Computational Geometry, vol. 223, American Mathematical Society, 1999, pp. 109–43.
View | Download (ext.)
 
[143]
1998 | Conference Paper | IST-REx-ID: 4019
Cheng, Ho, et al. Shape Space from Deformation. IEEE, 1998, pp. 104–13, doi:10.1109/PCCGA.1998.732056.
View | DOI
 
[142]
1998 | Conference Paper | IST-REx-ID: 4015
Edelsbrunner, Herbert. Shape Reconstruction with Delaunay Complex. Vol. 1380, Springer, 1998, pp. 119–32, doi: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, doi: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.” Mathematical Visualization, Springer, 1998, pp. 223–36, doi:10.1007/978-3-662-03567-2_17.
View | DOI
 
[139]
1998 | Journal Article | IST-REx-ID: 4011
Liang, Jie, et al. “Analytical Shape Computation of Macromolecules: I. Molecular Area and Volume through Alpha Shape.” Proteins: Structure, Function and Bioinformatics, vol. 33, no. 1, Wiley-Blackwell, 1998, pp. 1–17, doi: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, et al. Wrapping 3D Scanning Data. Vol. 3313, SPIE, 1998, pp. 148–58, doi:10.1117/12.302448.
View | DOI
 
[137]
1998 | Journal Article | IST-REx-ID: 4012
Liang, Jie, et al. “Analytical Shape Computation of Macromolecules: II. Inaccessible Cavities in Proteins.” Proteins: Structure, Function and Bioinformatics, vol. 33, no. 1, Wiley-Blackwell, 1998, pp. 18–29, doi: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, et al. “Anatomy of Protein Pockets and Cavities: Measurement of Binding Site Geometry and Implications for Ligand Design.” Protein Science, vol. 7, no. 9, Wiley-Blackwell, 1998, pp. 1884–97, doi:10.1002/pro.5560070905.
View | DOI | Download (ext.)
 
[135]
1998 | Journal Article | IST-REx-ID: 4013
Edelsbrunner, Herbert, et al. “On the Definition and the Construction of Pockets in Macromolecules.” Discrete Applied Mathematics, vol. 88, no. 1–3, Elsevier, 1998, pp. 83–102, doi:10.1016/S0166-218X(98)00067-5.
View | DOI
 
[134]
1998 | Book Chapter | IST-REx-ID: 4020
Edelsbrunner, Herbert. “Geometry for Modeling Biomolecules.” Robotics: The Algorithmic Perspective, AK Peters, 1998, pp. 265–77.
View
 
[133]
1997 | Journal Article | IST-REx-ID: 4021
Edelsbrunner, Herbert, and Roman Waupotitsch. “A Combinatorial Approach to Cartograms.” Computational Geometry: Theory and Applications, vol. 7, no. 5–6, Elsevier, 1997, pp. 343–60, doi:387910.1016/S0925-7721(96)00006-5.
View | DOI
 
[132]
1997 | Journal Article | IST-REx-ID: 4022
Edelsbrunner, Herbert, et al. “Cutting Dense Point Sets in Half.” Discrete & Computational Geometry, vol. 17, no. 3, Springer, 1997, pp. 243–55, doi: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, vol. 17, no. 3, Springer, 1997, pp. 287–306, doi: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, vol. 7, no. 4, World Scientific Publishing, 1997, pp. 365–78, doi: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, vol. 15, no. 3, Springer, 1996, pp. 223–41, doi:10.1007/BF01975867.
View | DOI
 
[128]
1996 | Journal Article | IST-REx-ID: 4027
Chazelle, Bernard, et al. “Lines in Space: Combinatorics and Algorithms.” Algorithmica, vol. 15, no. 5, Springer, 1996, pp. 428–47, doi:10.1007/BF01955043.
View | DOI
 
[127]
1996 | Conference Poster | IST-REx-ID: 4030
Liang, Jie, et al. “Effects of Molecular Shape Representations on Boundary Element Method for Protein Electrostatics Computations.” Fortieth Annual Meeting, vol. 70, no. 2, Part 2, Cell Press, 1996, pp. A224–A224, doi:10.1016/S0006-3495(96)79664-9.
View | DOI
 
[126]
1996 | Journal Article | IST-REx-ID: 4024
Akkiraju, Nataraj, et al. “Viewing Geometric Protein Structures from inside a CAVE.” IEEE Computer Graphics and Applications, vol. 16, no. 4, IEEE, 1996, pp. 58–61, doi:10.1109/38.511855.
View | DOI
 
[125]
1996 | Conference Poster | IST-REx-ID: 4031
Liang, Jie, et al. “Analytical Method for Molecular Shapes: Area, Volume, Cavities, Interface and Pockets.” Fortieth Annual Meeting, vol. 70, no. 2, Part 2, Cell Press, 1996, pp. A377–A377, doi:10.1016/S0006-3495(96)79670-4.
View | DOI
 
[124]
1996 | Conference Paper | IST-REx-ID: 3553
Edelsbrunner, Herbert, et al. Geometric Modeling in CAVE. ACM, 1996, pp. 35-41 and-193–94.
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, vol. 71, no. 1–3, Elsevier, 1996, pp. 5–22, doi: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. IEEE, 1995, pp. 248–57.
View
 
[121]
1995 | Conference Paper | IST-REx-ID: 3551
Edelsbrunner, Herbert, et al. Measuring Proteins and Voids in Proteins. IEEE, 1995, pp. 256–64, doi: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, vol. 13, no. 1, Springer, 1995, pp. 415–40, doi:10.1007/BF02574053.
View | DOI
 
[119]
1995 | Journal Article | IST-REx-ID: 4035
Chazelle, Bernard, et al. “Improved Bounds on Weak ε-Nets for Convex Sets.” Discrete & Computational Geometry, vol. 13, no. 1, Springer, 1995, pp. 1–15, doi:10.1007/BF02574025.
View | DOI
 
[118]
1995 | Conference Paper | IST-REx-ID: 3552
Akkiraju, Nataraj, et al. Alpha Shapes: Definition and Software. Elsevier, 1995, pp. 63–66.
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, vol. 12, no. 7, Elsevier, 1995, pp. 771–84, doi:10.1016/0167-8396(95)00016-Y.
View | DOI
 
[116]
1994 | Journal Article | IST-REx-ID: 4033
Chazelle, Bernard, et al. “Selecting Heavily Covered Points.” SIAM Journal on Computing, vol. 23, no. 6, SIAM, 1994, pp. 1138–51, doi:10.1137/S0097539790179919 .
View | DOI
 
[115]
1994 | Journal Article | IST-REx-ID: 4038
Chazelle, Bernard, et al. “Algorithms for Bichromatic Line-Segment Problems and Polyhedral Terrains.” Algorithmica, vol. 11, no. 2, Springer, 1994, pp. 116–32, doi:10.1007/BF01182771.
View | DOI
 
[114]
1994 | Conference Paper | IST-REx-ID: 3550
Edelsbrunner, Herbert. Modeling with Simplicial Complexes (Topology, Geometry and Algorithms). Unknown, 1994, pp. 36–44.
View | Download (ext.)
 
[113]
1994 | Journal Article | IST-REx-ID: 4039
Chazelle, Bernard, et al. “Ray Shooting in Polygons Using Geodesic Triangulations.” Algorithmica, vol. 12, no. 1, Springer, 1994, pp. 54–68, doi: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, vol. 12, no. 1, Springer, 1994, pp. 281–89, doi: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, vol. 13, no. 1, ACM, 1994, pp. 43–72, doi: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, vol. 10, no. 1, Springer, 1993, pp. 197–213, doi:10.1007/BF02573974.
View | DOI
 
[109]
1993 | Journal Article | IST-REx-ID: 4045
Chazelle, Bernard, et al. “Diameter, Width, Closest Line Pair, and Parametric Searching.” Discrete & Computational Geometry, vol. 10, no. 1, Springer, 1993, pp. 183–96, doi:10.1007/BF02573973.
View | DOI
 
[108]
1993 | Journal Article | IST-REx-ID: 4041
Edelsbrunner, Herbert, et al. “On the Zone Theorem for Hyperplane Arrangements.” SIAM Journal on Computing, vol. 22, no. 2, SIAM, 1993, pp. 418–29, doi:10.1137/0222031.
View | DOI
 
[107]
1993 | Book Chapter | IST-REx-ID: 3568
Edelsbrunner, Herbert. “Geometric Algorithms.” Handbook of Convex Geometry, North Holland, 1993, pp. 699–735.
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, vol. 22, no. 3, SIAM, 1993, pp. 527–51, doi:10.1137/0222036 .
View | DOI
 
[105]
1993 | Book Chapter | IST-REx-ID: 3569
Edelsbrunner, Herbert. “Computational Geometry.” Current Trends in Theoretical Computer Science, Essays and Tutorials, World Scientific Publishing, 1993, pp. 1–48, doi:10.1007/978-3-662-04245-8_1.
View | DOI
 
[104]
1993 | Journal Article | IST-REx-ID: 4036
Chazelle, Bernard, et al. “Computing a Face in an Arrangement of Line Segments and Related Problems.” SIAM Journal on Computing, vol. 22, no. 6, SIAM, 1993, pp. 1286–302, doi:10.1137/0222077 .
View | DOI
 
[103]
1993 | Journal Article | IST-REx-ID: 4044
Bern, Marshall, et al. “Edge Insertion for Optimal Triangulations.” Discrete & Computational Geometry, vol. 10, no. 1, Springer, 1993, pp. 47–65, doi:10.1007/BF02573962.
View | DOI
 
[102]
1992 | Journal Article | IST-REx-ID: 3581
Chazelle, Bernard, et al. “Counting and Cutting Cycles of Lines and Rods in Space.” Computational Geometry: Theory and Applications, vol. 1, no. 6, Elsevier, 1992, pp. 305–23, doi: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, vol. 39, no. 1, ACM, 1992, pp. 1–54, doi:10.1145/147508.147511.
View | DOI
 
[100]
1992 | Journal Article | IST-REx-ID: 4053
Aronov, Boris, et al. “The Number of Edges of Many Faces in a Line Segment Arrangement.” Combinatorica, vol. 12, no. 3, Springer, 1992, pp. 261–74, doi:10.1007/BF01285815.
View | DOI
 
[99]
1992 | Journal Article | IST-REx-ID: 4047
Edelsbrunner, Herbert, et al. “Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms.” Theoretical Computer Science, vol. 92, no. 2, Elsevier, 1992, pp. 319–36, doi:10.1016/0304-3975(92)90319-B.
View | DOI
 
[98]
1992 | Journal Article | IST-REx-ID: 4043
Edelsbrunner, Herbert, et al. “An O(N^2 Log n) Time Algorithm for the MinMax Angle Triangulation.” SIAM Journal on Scientific Computing, vol. 13, no. 4, Society for Industrial and Applied Mathematics , 1992, pp. 994–1008, doi:10.1137/0913058.
View | DOI
 
[97]
1992 | Journal Article | IST-REx-ID: 4048
Aggarwal, Alok, et al. “Optimal Time Bounds for Some Proximity Problems in the Plane.” Information Processing Letters, vol. 42, no. 1, Elsevier, 1992, pp. 55–60, doi: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, vol. 8, no. 1, Springer, 1992, pp. 217–217, doi:10.1007/BF02293046.
View | DOI
 
[95]
1992 | Conference Paper | IST-REx-ID: 4049
Bern, Marshall, et al. Edge Insertion for Optimal Triangulations. Vol. 583, Springer, 1992, pp. 46–60, doi: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.” Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift, vol. 4, American Mathematical Society, 1991, pp. 253–63.
View | Download (ext.)
 
[93]
1991 | Journal Article | IST-REx-ID: 4052
Chazelle, Bernard, et al. “A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications.” Theoretical Computer Science, vol. 84, no. 1, Elsevier, 1991, pp. 77–105, doi: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, vol. 42, no. 2, Elsevier, 1991, pp. 249–51, doi: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.” Discrete & Computational Geometry, vol. 6, Springer, 1991, pp. 77–93.
View | Download (ext.)
 
[90]
1991 | Conference Paper | IST-REx-ID: 4058
Chazelle, Bernard, et al. Computing a Face in an Arrangement of Line Segments. SIAM, 1991, pp. 441–48.
View
 
[89]
1991 | Conference Paper | IST-REx-ID: 4054
Edelsbrunner, Herbert, et al. On the Zone Theorem for Hyperplane Arrangements. Vol. 555, Springer, 1991, pp. 108–23, doi:10.1007/BFb0038185.
View | DOI
 
[88]
1991 | Conference Paper | IST-REx-ID: 4059
Chazelle, Bernard, et al. Ray Shooting in Polygons Using Geodesic Triangulations. Vol. 510, Springer, 1991, pp. 661–73, doi:10.1007/3-540-54233-7_172.
View | DOI
 
[87]
1991 | Journal Article | IST-REx-ID: 4061
Agarwal, Pankaj, et al. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.” Discrete & Computational Geometry, vol. 6, no. 1, Springer, 1991, pp. 407–22, doi: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. IEEE, 1991, pp. 414–23, doi:10.1109/SFCS.1991.185400.
View | DOI
 
[85]
1991 | Journal Article | IST-REx-ID: 4062
Aronov, Boris, et al. “Points and Triangles in the Plane and Halving Planes in Space.” Discrete & Computational Geometry, vol. 6, no. 1, Springer, 1991, pp. 435–42, doi: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, vol. 20, no. 2, SIAM, 1991, pp. 259–69, doi: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, vol. 56, no. 2, Elsevier, 1991, pp. 312–16, doi: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, vol. 85, no. 409, American Statistical Association, 1990, pp. 115–19, doi: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, vol. 10, no. 3, Springer, 1990, pp. 251–60, doi:10.1007/BF02122779.
View | DOI
 
[80]
1990 | Conference Paper | IST-REx-ID: 4071
Edelsbrunner, Herbert, et al. An O(N^2log n) Time Algorithm for the MinMax Angle Triangulation. ACM, 1990, pp. 44–52, doi:10.1145/98524.98535.
View | DOI
 
[79]
1990 | Conference Paper | IST-REx-ID: 4076
Agarwal, Pankaj, et al. Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. ACM, 1990, pp. 203–10, doi:10.1145/98524.98567.
View | DOI
 
[78]
1990 | Journal Article | IST-REx-ID: 4060
Edelsbrunner, Herbert, et al. “Tetrahedrizing Point Sets in Three Dimensions.” Journal of Symbolic Computation, vol. 10, no. 3–4, Elsevier, 1990, pp. 335–47, doi:10.1016/S0747-7171(08)80068-5.
View | DOI | Download (ext.)
 
[77]
1990 | Journal Article | IST-REx-ID: 4065
Edelsbrunner, Herbert, et al. “Covering Convex Sets with Non-Overlapping Polygons.” Discrete Mathematics, vol. 81, no. 2, Elsevier, 1990, pp. 153–64, doi:10.1016/0012-365X(90)90147-A.
View | DOI
 
[76]
1990 | Journal Article | IST-REx-ID: 4072
Edelsbrunner, Herbert, et al. “The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.” Discrete & Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 161–96, doi: 10.1007/BF02187784.
View | DOI
 
[75]
1990 | Conference Paper | IST-REx-ID: 4077
Aronov, Boris, et al. Points and Triangles in the Plane and Halving Planes in Space. ACM, 1990, pp. 112–15, doi:10.1145/98524.98548.
View | DOI
 
[74]
1990 | Journal Article | IST-REx-ID: 4066
Edelsbrunner, Herbert, et al. “The Complexity of Many Cells in Arrangements of Planes and Related Problems.” Discrete & Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 197–216, doi:10.1007/BF02187785.
View | DOI
 
[73]
1990 | Conference Paper | IST-REx-ID: 4073
Chazelle, Bernard, et al. Counting and Cutting Cycles of Lines and Rods in Space. IEEE, 1990, pp. 242–51, doi:10.1109/FSCS.1990.89543.
View | DOI
 
[72]
1990 | Conference Paper | IST-REx-ID: 4078
Chazelle, Bernard, et al. Slimming down by Adding; Selecting Heavily Covered Points. ACM, 1990, pp. 116–27, doi: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. Vol. 450, Springer, 1990, pp. 419–28, doi:10.1007/3-540-52921-7_91.
View | DOI
 
[70]
1990 | Journal Article | IST-REx-ID: 4074
Clarkson, Kenneth, et al. “Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.” Discrete & Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 99–160, doi:10.1007/BF02187783.
View | DOI
 
[69]
1990 | Book Chapter | IST-REx-ID: 3565
Dobkin, David, et al. “Probing Convex Polytopes.” Autonomous Robot Vehicles, edited by Ingemar Cox and Gordon Wilfong, Springer, 1990, pp. 328–41, doi: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, vol. 9, no. 1, ACM, 1990, pp. 66–104, doi: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, vol. 5, no. 1, Springer, 1990, pp. 35–42, doi: 10.1007/BF02187778.
View | DOI
 
[66]
1990 | Journal Article | IST-REx-ID: 4070
Edelsbrunner, Herbert, et al. “Ranking Intervals under Visibility Constraints.” International Journal of Computer Mathematics, vol. 34, no. 3–4, Taylor & Francis, 1990, pp. 129–44, doi:10.1080/00207169008803871.
View | DOI
 
[65]
1990 | Journal Article | IST-REx-ID: 4075
Dobkin, David, et al. “Searching for Empty Convex Polygons.” Algorithmica, vol. 5, no. 4, Springer, 1990, pp. 561–71, doi:10.1007/BF01840404.
View | DOI
 
[64]
1989 | Journal Article | IST-REx-ID: 4083
Yao, F., et al. “Partitioning Space for Range Queries.” SIAM Journal on Computing, vol. 18, no. 2, SIAM, 1989, pp. 371–84, doi:10.1137/0218025.
View | DOI
 
[63]
1989 | Journal Article | IST-REx-ID: 4088
Edelsbrunner, Herbert, et al. “Implicitly Representing Arrangements of Lines or Segments.” Discrete & Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 433–66, doi:10.1007/BF02187742.
View | DOI
 
[62]
1989 | Journal Article | IST-REx-ID: 4084
Edelsbrunner, Herbert, et al. “Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.” Theoretical Computer Science, vol. 66, no. 2, Elsevier, 1989, pp. 157–80, doi:10.1016/0304-3975(89)90133-3.
View | DOI
 
[61]
1989 | Journal Article | IST-REx-ID: 4089
Edelsbrunner, Herbert, et al. “On Arrangements of Jordan Arcs with Three Intersections per Pair.” Discrete & Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 523–39, doi:10.1007/BF02187745.
View | DOI
 
[60]
1989 | Conference Paper | IST-REx-ID: 3549
Edelsbrunner, Herbert. Spatial Triangulations with Dihedral Angle Conditions. Institute of the Electronics, Information and Communication Enginneers, 1989, pp. 83–89.
View
 
[59]
1989 | Journal Article | IST-REx-ID: 4080
Edelsbrunner, Herbert, et al. “Circles through Two Points That Always Enclose Many Points.” Geometriae Dedicata, vol. 32, no. 1, Kluwer, 1989, pp. 1–12, doi:10.1007/BF00181432.
View | DOI
 
[58]
1989 | Conference Paper | IST-REx-ID: 4085
Edelsbrunner, Herbert. An Acyclicity Theorem for Cell Complexes in d Dimension. ACM, 1989, pp. 145–51, doi:10.1145/73833.73850.
View | DOI
 
[57]
1989 | Conference Paper | IST-REx-ID: 4092
Chazelle, Bernard, et al. A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications. Vol. 372, Springer, 1989, pp. 179–93, doi: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, vol. 96, no. 7, Mathematical Association of America, 1989, pp. 614–18.
View | Download (ext.)
 
[55]
1989 | Journal Article | IST-REx-ID: 4081
Edelsbrunner, Herbert, et al. “The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.” Discrete & Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 311–36, doi: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, vol. 4, no. 4, Springer, 1989, pp. 337–43, doi:10.1007/BF02187734.
View | DOI
 
[53]
1989 | Journal Article | IST-REx-ID: 4093
Chazelle, Bernard, et al. “The Complexity of Cutting Complexes.” Discrete & Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 139–81, doi: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, vol. 38, no. 1, Elsevier, 1989, pp. 165–94, doi:10.1016/0022-0000(89)90038-X.
View | DOI
 
[51]
1989 | Conference Paper | IST-REx-ID: 4087
Edelsbrunner, Herbert, et al. Tetrahedrizing Point Sets in Three Dimensions. Vol. 358, Springer, 1989, pp. 315–31, doi: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, vol. 77, no. 3, Elsevier, 1988, pp. 218–32, doi: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, vol. 17, no. 5, SIAM, 1988, pp. 870–82, doi:10.1137/0217054 .
View | DOI
 
[48]
1988 | Conference Paper | IST-REx-ID: 4096
Edelsbrunner, Herbert. Geometric Structures in Computational Geometry. Vol. 317, Springer, 1988, pp. 201–13, doi:10.1007/3-540-19488-6_117.
View | DOI
 
[47]
1988 | Conference Paper | IST-REx-ID: 4097
Edelsbrunner, Herbert, et al. Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms. Vol. 317, Springer, 1988, pp. 214–29, doi: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, vol. 36, no. 11, IEEE, 1987, pp. 1349–54, doi: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, vol. 2, no. 1, Springer, 1987, pp. 113–26, doi: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, et al. On the Lower Envelope of Bivariate Functions and Its Applications. IEEE, 1987, pp. 27–37, doi: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, vol. 24, no. 6, Elsevier, 1987, pp. 413–17, doi: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, vol. 26, no. 2, Elsevier, 1987, pp. 61–64, doi: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, vol. 8, no. 3, Academic Press, 1987, pp. 348–61, doi: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, vol. 1, no. 1–4, Springer, 1986, pp. 93–109, doi: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, vol. 41, no. 2, Elsevier, 1986, pp. 159–66, doi: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, vol. 1, no. 1, Springer, 1986, pp. 25–44, doi: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, vol. 15, no. 1, SIAM, 1986, pp. 271–84, doi: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, vol. 53, Utilitas Mathemtica Publ. Inc., 1986, pp. 193–200.
View
 
[34]
1986 | Journal Article | IST-REx-ID: 4104
Edelsbrunner, Herbert, et al. “Optimal Point Location in a Monotone Subdivision.” SIAM Journal on Computing, vol. 15, no. 2, SIAM, 1986, pp. 317–40, doi:10.1137/0215023.
View | DOI
 
[33]
1986 | Journal Article | IST-REx-ID: 4109
Edelsbrunner, Herbert, et al. “Rectangular Point Location in D-Dimensions with Applications.” Computer Journal, vol. 29, no. 1, Oxford University Press, 1986, pp. 76–82, doi:10.1093/comjnl/29.1.76.
View | DOI
 
[32]
1986 | Journal Article | IST-REx-ID: 4105
Edelsbrunner, Herbert, et al. “Constructing Arrangements of Lines and Hyperplanes with Applications.” SIAM Journal on Computing, vol. 15, no. 2, SIAM, 1986, pp. 341–63, doi: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, vol. 43, no. 2, Elsevier, 1986, pp. 344–49, doi: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, vol. 2, no. 2, Elsevier, 1986, pp. 171–78, doi: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, vol. 23, no. 5, Elsevier, 1986, pp. 289–93, doi: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, vol. 60, no. C, Elsevier, 1986, pp. 139–46, doi: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, vol. 6, no. 2, Academic Press, 1985, pp. 213–24, doi: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, vol. 21, no. 1, Elsevier, 1985, pp. 39–47, doi: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, vol. 35, no. 1, Elsevier, 1985, pp. 55–69, doi: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, vol. 6, no. 4, Academic Press, 1985, pp. 515–42, doi: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, vol. 38, no. 1, Elsevier, 1985, pp. 15–29, doi: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, vol. 1, no. 1, Elsevier, 1985, pp. 47–56, doi: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, vol. 2, no. 2–3, Springer, 1985, pp. 239–54, doi:10.1007/BF01908077.
View | DOI
 
[20]
1984 | Conference Paper | IST-REx-ID: 4122
Edelsbrunner, Herbert. Key-Problems and Key-Methods in Computational Geometry. Vol. 166, Springer, 1984, pp. 1–13, doi:10.1007/3-540-12920-0_1.
View | DOI
 
[19]
1984 | Journal Article | IST-REx-ID: 4123
Edelsbrunner, Herbert, et al. “Some Methods of Computational Geometry Applied to Computer Graphics.” Computer Vision, Graphics, and Image Processing, vol. 28, no. 1, Academic Press, 1984, pp. 92–108, doi: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. Teubner, 1984, pp. 88–99.
View | Download (ext.)
 
[17]
1984 | Journal Article | IST-REx-ID: 4117
Edelsbrunner, Herbert, et al. “Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space.” Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications, vol. 18, no. 2, Cambridge University Press, 1984, pp. 171–83.
View
 
[16]
1984 | Journal Article | IST-REx-ID: 4118
Edelsbrunner, Herbert, et al. “Stationing Guards in Rectilinear Art Galleries.” Computer Vision, Graphics, and Image Processing, vol. 27, no. 2, Academic Press, 1984, pp. 167–76, doi: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, vol. 17, no. 2, Springer, 1984, pp. 251–57, doi: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. Vol. 176, Springer, 1984, pp. 265–72, doi: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, vol. 1, no. 1, Springer, 1984, pp. 7–24, doi: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, vol. 13, no. 3–4, Taylor & Francis, 1983, pp. 221–29, doi: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.” Computational Geometry: Theory and Applications, edited by Franco Preparata, vol. 1, Elsevier, 1983, pp. 109–25.
View | Download (ext.)
 
[10]
1983 | Journal Article | IST-REx-ID: 4128
Edelsbrunner, Herbert, et al. “On the Shape of a Set of Points in the Plane.” IEEE Transactions on Information Theory, vol. 29, no. 4, IEEE, 1983, pp. 551–59, doi:10.1109/TIT.1983.1056714 .
View | DOI
 
[9]
1983 | Book Chapter | IST-REx-ID: 3563
Edelsbrunner, Herbert, et al. “Graphics in Flatland: A Case Study.” Computational Geometry: Theory and Applications, edited by Franco Preparata, vol. 1, Elsevier, 1983, pp. 35–59.
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. Vol. 154, Springer, 1983, pp. 182–87, doi:10.1007/BFb0036908.
View | DOI
 
[7]
1983 | Book Chapter | IST-REx-ID: 3564
Edelsbrunner, Herbert. “Neue Entwicklungen Im Bereich Datenstrukturen.” Überblicke Informationsverarbeitung , edited by Hermann Maurer, BI Wissenschaftsverlag, 1983, pp. 55–109.
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, vol. 13, no. 3–4, Taylor & Francis, 1983, pp. 209–19, doi:10.1080/00207168308803364.
View | DOI
 
[5]
1982 | Journal Article | IST-REx-ID: 4130
Edelsbrunner, Herbert, et al. “Polygonal Intersection Searching.” Information Processing Letters, vol. 14, no. 2, Elsevier, 1982, pp. 74–79, doi:10.1016/0020-0190(82)90090-4.
View | DOI
 
[4]
1982 | Journal Article | IST-REx-ID: 4129
Edelsbrunner, Herbert, et al. “Stabbing Line Segments.” Bit, vol. 22, no. 3, Springer, 1982, pp. 274–81, doi: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, vol. 14, no. 3, Elsevier, 1982, pp. 124–27, doi: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, vol. 13, no. 4–5, Elsevier, 1981, pp. 177–81, doi: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, vol. 16, no. 3, Elsevier, 1981, pp. 329–36, doi:10.1016/0304-3975(81)90103-1.
View | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed

279 Publications

Mark all

[279]
2019 | Conference Paper | IST-REx-ID: 6648   OA
Edelsbrunner, Herbert, et al. “Topological Data Analysis in Information Space.” 35th International Symposium on Computational Geometry, vol. 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 31:1-31:14, doi:10.4230/LIPICS.SOCG.2019.31.
View | Files available | DOI | arXiv
 
[278]
2019 | Journal Article | IST-REx-ID: 6756   OA
Pranav, Pratyush, et al. “Unexpected Topology of the Temperature Fluctuations in the Cosmic Microwave Background.” Astronomy and Astrophysics, vol. 627, A163, EDP Sciences, 2019, doi: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, vol. 73, Elsevier, 2019, pp. 1–15, doi: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, vol. 68, Elsevier, 2018, pp. 119–33, doi: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, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.SoCG.2018.34.
View | Files available | DOI
 
[274]
2018 | Conference Paper | IST-REx-ID: 188   OA
Edelsbrunner, Herbert, et al. Smallest Enclosing Spheres and Chernoff Points in Bregman Geometry. Vol. 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 35:1-35:13, doi: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, vol. 28, no. 5, Institute of Mathematical Statistics, 2018, pp. 3215–38, doi: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, vol. 32, no. 1, Society for Industrial and Applied Mathematics , 2018, pp. 750–82, doi: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, Springer, 2018, doi:10.1007/s00454-018-0049-2.
View | Files available | DOI
 
[270]
2017 | Journal Article | IST-REx-ID: 1022   OA
Pranav, Pratyush, et al. “The Topology of the Cosmic Web in Terms of Persistent Betti Numbers.” Monthly Notices of the Royal Astronomical Society, vol. 465, no. 4, Oxford University Press, 2017, pp. 4281–310, doi:10.1093/mnras/stw2862.
View | DOI | Download (ext.)
 
[269]
2017 | Journal Article | IST-REx-ID: 1173   OA
Edelsbrunner, Herbert, et al. “The Voronoi Functional Is Maximized by the Delaunay Triangulation in the Plane.” Combinatorica, vol. 37, no. 5, Springer, 2017, pp. 887–910, doi:10.1007/s00493-016-3308-y.
View | DOI | Download (ext.)
 
[268]
2017 | Journal Article | IST-REx-ID: 718   OA
Edelsbrunner, Herbert, et al. “Expected Sizes of Poisson Delaunay Mosaics and Their Discrete Morse Functions.” Advances in Applied Probability, vol. 49, no. 3, Cambridge University Press, 2017, pp. 745–67, doi: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, vol. 369, no. 5, American Mathematical Society, 2017, pp. 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. Vol. 77, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, pp. 391–3916, doi: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.
View | Download (ext.) | arXiv
 
[264]
2017 | Book Chapter | IST-REx-ID: 84
Edelsbrunner, Herbert, and Patrice Koehl. “Computational Topology for Structural Molecular Biology.” Handbook of Discrete and Computational Geometry, Third Edition, edited by Csaba Toth et al., CRC Press, 2017, pp. 1709–35, doi: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, vol. 287, Academic Press, 2016, pp. 674–703, doi: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, vol. 54, Elsevier, 2016, pp. 169–74, doi:10.1016/j.endm.2016.09.030.
View | DOI
 
[261]
2016 | Journal Article | IST-REx-ID: 1289
Dunaeva, Olga, et al. “The Classification of Endoscopy Images with Persistent Homology.” Pattern Recognition Letters, vol. 83, no. 1, Elsevier, 2016, pp. 13–22, doi:10.1016/j.patrec.2015.12.012.
View | Files available | DOI
 
[260]
2015 | Journal Article | IST-REx-ID: 1793   OA
Symonova, Olga, et al. “DynamicRoots: A Software Platform for the Reconstruction and Analysis of Growing Plant Roots.” PLoS One, vol. 10, no. 6, e0127657, Public Library of Science, 2015, doi:10.1371/journal.pone.0127657.
View | Files available | DOI
 
[259]
2015 | Journal Article | IST-REx-ID: 3585
Cao, Thanh, et al. “Proof of Correctness of the Digital Delaunay Triangulation Algorithm.” Computational Geometry: Theory and Applications, vol. 48, no. 7, Elsevier, 2015, pp. 507–19, doi:10.1016/j.comgeo.2015.04.001.
View | DOI
 
[258]
2015 | Conference Paper | IST-REx-ID: 1495   OA
Edelsbrunner, Herbert, et al. “Relaxed Disk Packing.” Proceedings of the 27th Canadian Conference on Computational Geometry, vol. 2015–August, Queen’s University, 2015, pp. 128–35.
View | Download (ext.)
 
[257]
2015 | Journal Article | IST-REx-ID: 1578
Cao, Thanhtung, et al. “Triangulations from Topologically Correct Digital Voronoi Diagrams.” Computational Geometry, vol. 48, no. 7, Elsevier, 2015, pp. 507–19, doi:10.1016/j.comgeo.2015.04.001.
View | DOI
 
[256]
2015 | Conference Paper | IST-REx-ID: 1567
Edelsbrunner, Herbert. Shape, Homology, Persistence, and Stability. Vol. 9411, Springer, 2015.
View
 
[255]
2015 | Conference Paper | IST-REx-ID: 1568
Dunaeva, Olga, et al. “The Classification of Endoscopy Images with Persistent Homology.” Proceedings - 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, IEEE, 2015, p. 7034731, doi:10.1109/SYNASC.2014.81.
View | Files available | DOI
 
[254]
2015 | Journal Article | IST-REx-ID: 2035   OA
Edelsbrunner, Herbert, et al. “The Persistent Homology of a Self-Map.” Foundations of Computational Mathematics, vol. 15, no. 5, Springer, 2015, pp. 1213–44, doi: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. European Mathematical Society Publishing House, 2014, pp. 31–50, doi:10.4171/120-1/3.
View | Files available | DOI
 
[252]
2014 | Journal Article | IST-REx-ID: 1876   OA
Dolbilin, Nikolai, et al. “Functionals on Triangulations of Delaunay Sets.” Moscow Mathematical Journal, vol. 14, no. 3, Independent University of Moscow, 2014, pp. 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.” Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2014, pp. 152–60, doi: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, vol. 50, no. 1, Springer, 2014, pp. 164–77, doi:10.1007/s10851-013-0468-x.
View | Files available | DOI
 
[249]
2014 | Journal Article | IST-REx-ID: 1929
Alexeev, V. V., et al. “An Algorithm for Cartographic Generalization That Preserves Global Topology.” Journal of Mathematical Sciences (United States), vol. 203, no. 6, Springer, 2014, pp. 754–60, doi: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.” Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 484–90, doi:10.1145/2582112.2582167.
View | DOI | Download (ext.)
 
[247]
2013 | Journal Article | IST-REx-ID: 2859   OA
Bendich, Paul, et al. “Homology and Robustness of Level and Interlevel Sets.” Homology, Homotopy and Applications, vol. 15, no. 1, International Press, 2013, pp. 51–72, doi: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.” 17th IAPR International Conference on Discrete Geometry for Computer Imagery, vol. 7749, Springer, 2013, pp. XV–XIX, doi: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.” 2013 Proceedings of the 15th Workshop on Algorithm Engineering and Experiments, Society of Industrial and Applied Mathematics, 2013, pp. 70–77, doi:10.1137/1.9781611972931.6.
View | Files available | DOI
 
[244]
2013 | Journal Article | IST-REx-ID: 2887   OA
Fang, Suqin, et al. “Genotypic Recognition and Spatial Responses by Rice Roots.” PNAS, vol. 110, no. 7, National Academy of Sciences, 2013, pp. 2670–75, doi:10.1073/pnas.1222821110.
View | DOI | Download (ext.)
 
[243]
2013 | Journal Article | IST-REx-ID: 2822   OA
Topp, Christopher, et al. “3D Phenotyping and Quantitative Trait Locus Mapping Identify Core Regions of the Rice Genome Controlling Root Architecture.” PNAS, vol. 110, no. 18, National Academy of Sciences, 2013, pp. E1695–704, doi:10.1073/pnas.1304354110.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
[242]
2013 | Journal Article | IST-REx-ID: 2815
Edelsbrunner, Herbert, et al. “Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.” Discrete & Computational Geometry, vol. 49, no. 4, Springer, 2013, pp. 797–822, doi: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, vol. 67, no. 6, Moscow Mathematical Society , 2012, pp. 203–04, doi: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, vol. 47, no. 2, Springer, 2012, pp. 393–414, doi:10.1007/s00454-011-9382-4.
View | Files available | DOI
 
[239]
2012 | Journal Article | IST-REx-ID: 3310   OA
Bendich, Paul, et al. “A Point Calculus for Interlevel Set Homology.” Pattern Recognition Letters, vol. 33, no. 11, Elsevier, 2012, pp. 1436–44, doi: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, vol. 67, no. 6, IOP Publishing Ltd., 2012, pp. 1167–68, doi:10.1070/RM2012v067n06ABEH004820.
View | Files available | DOI
 
[237]
2012 | Journal Article | IST-REx-ID: 2902
Edelsbrunner, Herbert, et al. “Fractal and Computational Geometry for Generalizing Cartographic Objects.” Modeling and Analysis of Information Systems, vol. 19, no. 6, Technische Universität Darmstadt, 2012, pp. 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.” Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry , ACM, 2012, pp. 249–58, doi: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. IEEE, 2012, pp. 41–48, doi:10.1109/ISVD.2012.11.
View | Files available | DOI
 
[234]
2012 | Journal Article | IST-REx-ID: 2941   OA
Dolbilin, Nikolai, et al. “On the Optimality of Functionals over Triangulations of Delaunay Sets.” Russian Mathematical Surveys, vol. 67, no. 4, IOP Publishing, 2012, pp. 781–83, doi:10.1070/RM2012v067n04ABEH004807.
View | Files available | DOI
 
[233]
2012 | Conference Paper | IST-REx-ID: 3134
Edelsbrunner, Herbert, et al. “Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.” Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry , ACM, 2012, pp. 91–100, doi:10.1145/2261250.2261265.
View | Files available | DOI
 
[232]
2012 | Journal Article | IST-REx-ID: 2911
Edelsbrunner, Herbert, et al. “Open Problems in Discrete and Computational Geometry.” Automatic Control and Computer Sciences, vol. in print, Springer, 2012.
View
 
[231]
2012 | Journal Article | IST-REx-ID: 3159   OA
Mileyko, Yuriy, et al. “Hierarchical Ordering of Reticular Networks.” PLoS One, vol. 7, no. 6, e36715, Public Library of Science, 2012, doi:10.1371/journal.pone.0036715.
View | Files available | DOI
 
[230]
2011 | Journal Article | IST-REx-ID: 3965
Wang, Bei, et al. “Computing Elevation Maxima by Searching the Gauss Sphere.” Journal of Experimental Algorithmics, vol. 16, no. 2.2, ACM, 2011, pp. 1–13, doi:10.1145/1963190.1970375.
View | DOI
 
[229]
2011 | Journal Article | IST-REx-ID: 3377   OA
Edelsbrunner, Herbert, et al. “Quantifying Transversality by Measuring the Robustness of Intersections.” Foundations of Computational Mathematics, vol. 11, no. 3, Springer, 2011, pp. 345–61, doi:10.1007/s10208-011-9090-8.
View | DOI | Download (ext.)
 
[228]
2011 | Journal Article | IST-REx-ID: 3334
Edelsbrunner, Herbert, et al. “Letter from the New Editors-in-Chief.” Discrete & Computational Geometry, vol. 45, no. 1, Springer, 2011, pp. 1–2, doi:10.1007/s00454-010-9313-9.
View | DOI
 
[227]
2011 | Book Chapter | IST-REx-ID: 3311
Edelsbrunner, Herbert. “Alpha Shapes - a Survey.” Tessellations in the Sciences, Springer, 2011.
View
 
[226]
2011 | Book Chapter | IST-REx-ID: 3335   OA
Van De Weygaert, Rien, et al. “Alpha, Betti and the Megaparsec Universe: On the Topology of the Cosmic Web.” Transactions on Computational Science XIV, edited by Marina Gavrilova et al., vol. 6970, Springer, 2011, pp. 60–101, doi: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.” Rainbow of Computer Science, edited by Cristian Calude et al., vol. 6570, Springer, 2011, pp. 20–35, doi:10.1007/978-3-642-19391-0_2.
View | Files available | DOI
 
[224]
2011 | Conference Poster | IST-REx-ID: 3312   OA
Zheng, Ying, et al. “ Detailed Reconstruction of 3D Plant Root Shape.” Proceedings of the IEEE International Conference on Computer Vision, IEEE, 2011, p. 6126475, doi: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.” Proceedings of the IEEE International Conference on Computer Vision, IEEE, 2011, p. 6126271, doi:10.1109/ICCV.2011.6126271.
View | Files available | DOI
 
[222]
2010 | Book Chapter | IST-REx-ID: 3795   OA
Edelsbrunner, Herbert, et al. “The Stability of the Apparent Contour of an Orientable 2-Manifold.” Topological Data Analysis and Visualization: Theory, Algorithms and Applications, Springer, 2010, pp. 27–42, doi:10.1007/978-3-642-15014-2_3.
View | Files available | DOI
 
[221]
2010 | Conference Paper | IST-REx-ID: 3853   OA
Chatterjee, Krishnendu, et al. Mean-Payoff Automaton Expressions. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–83, doi:10.1007/978-3-642-15375-4_19.
View | Files available | DOI
 
[220]
2010 | Conference Paper | IST-REx-ID: 3848
Bendich, Paul, et al. The Robustness of Level Sets. Vol. 6346, Springer, 2010, pp. 1–10, doi:10.1007/978-3-642-15775-2_1.
View | DOI
 
[219]
2010 | Journal Article | IST-REx-ID: 3901   OA
Bendich, Paul, et al. “Computing Robustness and Persistence for Images.” IEEE Transactions of Visualization and Computer Graphics, vol. 16, no. 6, IEEE, 2010, pp. 1251–60, doi:10.1109/TVCG.2010.139.
View | Files available | DOI
 
[218]
2010 | Conference Paper | IST-REx-ID: 3849   OA
Bendich, Paul, et al. Persistent Homology under Non-Uniform Error. Vol. 6281, Springer, 2010, pp. 12–23, doi:10.1007/978-3-642-15155-2_2.
View | Files available | DOI
 
[217]
2010 | Journal Article | IST-REx-ID: 3964
Cohen Steiner, David, et al. “Lipschitz Functions Have L_p-Stable Persistence.” Foundations of Computational Mathematics, vol. 10, no. 2, Springer, 2010, pp. 127–39, doi: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, et al. “Stability and Computation of Medial Axes: A State-of-the-Art Report.” Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration, Springer, 2009, pp. 109–25, doi:10.1007/b106657_6.
View | DOI | Download (ext.)
 
[214]
2009 | Journal Article | IST-REx-ID: 3966
Cohen Steiner, David, et al. “Extending Persistence Using Poincare and Lefschetz Duality.” Foundations of Computational Mathematics, vol. 9, no. 1, Springer, 2009, pp. 79–103, doi:10.1007/s10208-008-9027-z.
View | DOI
 
[213]
2009 | Conference Paper | IST-REx-ID: 3967
Cohen Steiner, David, et al. Persistent Homology for Kernels, Images, and Cokernels. SIAM, 2009, pp. 1011–20.
View
 
[212]
2009 | Conference Paper | IST-REx-ID: 3968   OA
Edelsbrunner, Herbert, and John Harer. The Persistent Morse Complex Segmentation of a 3-Manifold. Vol. 5903, Springer, 2009, pp. 36–50, doi:10.1007/978-3-642-10470-1_4.
View | Files available | DOI
 
[211]
2008 | Conference Paper | IST-REx-ID: 3974
Edelsbrunner, Herbert, et al. Reeb Spaces of Piecewise Linear Mappings. ACM, 2008, pp. 242–50, doi:10.1145/1377676.1377720.
View | DOI
 
[210]
2008 | Journal Article | IST-REx-ID: 3970
Dequéant, Mary, et al. “Comparison of Pattern Detection Methods in Microarray Time Series of the Segmentation Clock.” PLoS One, vol. 3, no. 8, Public Library of Science, 2008, doi:10.1371/journal.pone.0002856.
View | DOI
 
[209]
2008 | Book Chapter | IST-REx-ID: 3577
Biasotti, Silvia, et al. “Skeletal Structures.” Shape Analysis and Structuring, Springer, 2008, pp. 145–83, doi: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.” Surveys on Discrete and Computational Geometry: Twenty Years Later, American Mathematical Society, 2008, pp. 257–82.
View
 
[207]
2008 | Journal Article | IST-REx-ID: 3971
Edelsbrunner, Herbert, et al. “Time-Varying Reeb Graphs for Continuous Space-Time Data.” Computational Geometry: Theory and Applications, vol. 41, no. 3, Elsevier, 2008, pp. 149–66, doi:10.1016/j.comgeo.2007.11.001.
View | DOI
 
[206]
2007 | Conference Paper | IST-REx-ID: 3561   OA
Attali, Dominique, et al. Weak Witnesses for Delaunay Triangulations of Submanifolds. ACM, 2007, pp. 143–50, doi:10.1145/1236246.1236267.
View | DOI | Download (ext.)
 
[205]
2007 | Journal Article | IST-REx-ID: 3972
Cohen Steiner, David, et al. “Stability of Persistence Diagrams.” Discrete & Computational Geometry, vol. 37, no. 1, Springer, 2007, pp. 103–20, doi: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, vol. 37, no. 1, Springer, 2007, pp. 59–77, doi: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, vol. 7, no. 4, Springer, 2007, pp. 391–404, doi:10.1007/s10208-005-0200-3.
View | DOI
 
[202]
2007 | Conference Paper | IST-REx-ID: 3981
Attali, Dominique, et al. Alpha-Beta Witness Complexes. Vol. 4619, Springer, 2007, pp. 386–97, doi:10.1007/978-3-540-73951-7_34.
View | DOI
 
[201]
2007 | Conference Paper | IST-REx-ID: 3975
Bendich, Paul, et al. Inferring Local Homology from Sampled Stratified Spaces. IEEE, 2007, pp. 536–46, doi:10.1109/FOCS.2007.33.
View | DOI
 
[200]
2007 | Journal Article | IST-REx-ID: 3976
Headd, Jeffrey, et al. “Protein-Protein Interfaces: Properties, Preferences, and Projections.” Journal of Proteome Research, vol. 6, no. 7, American Chemical Society, 2007, pp. 2576–86, doi:10.1021/pr070018+.
View | DOI
 
[199]
2006 | Patent | IST-REx-ID: 3511
Fu, Ping, et al. Manufacturing Methods and Systems for Rapid Production of Hearing-Aid Shells. Elsevier, 2006, doi:US 7,050,876 B1.
View | DOI | Download (ext.)
 
[198]
2006 | Conference Paper | IST-REx-ID: 3559
Cohen Steiner, David, et al. Vines and Vineyards by Updating Persistence in Linear Time. ACM, 2006, pp. 119–26, doi:10.1145/1137856.1137877.
View | DOI
 
[197]
2006 | Patent | IST-REx-ID: 3512
Fletcher, Yates, et al. Method, Apparatus and Computer Products That Reconstruct Surfaces from Data Points. Elsevier, 2006, doi:US 7,023,432 B2.
View | DOI | Download (ext.)
 
[196]
2006 | Journal Article | IST-REx-ID: 3978
Ban, Yih, et al. “Evaluating the Quality of NMR Structures by Local Density of Protons.” Proteins: Structure, Function and Bioinformatics, vol. 62, no. 4, Wiley-Blackwell, 2006, pp. 852–64, doi:10.1002/prot.20811.
View | DOI
 
[195]
2006 | Journal Article | IST-REx-ID: 3980
Agarwal, Pankaj, et al. “Extreme Elevation on a 2-Manifold.” Discrete & Computational Geometry, vol. 36, no. 4, Springer, 2006, pp. 553–72, doi:10.1007/s00454-006-1265-8.
View | DOI
 
[194]
2006 | Journal Article | IST-REx-ID: 3979
Ban, Yih, et al. “Interface Surfaces for Protein-Protein Complexes.” Journal of the ACM, vol. 53, no. 3, ACM, 2006, pp. 361–78, doi:10.1145/1147954.1147957.
View | DOI
 
[193]
2006 | Patent | IST-REx-ID: 3510
Edelsbrunner, Herbert, et al. Method, Apparatus and Computer Program Products for Automatically Generating NURBS Models of Triangulated Surfaces Using Homeomorphism. Elsevier, 2006, doi:US 6,996,505 B1.
View | DOI | Download (ext.)
 
[192]
2006 | Conference Paper | IST-REx-ID: 3560
Edelsbrunner, Herbert, et al. Persistence-Sensitive Simplification of Functions on 2-Manifolds. ACM, 2006, pp. 127–34, doi:10.1145/1137856.1137878.
View | DOI | Download (ext.)
 
[191]
2005 | Patent | IST-REx-ID: 3509
Williams, Steven, et al. Methods, Apparatus and Computer Program Products for Modeling Three-Dimensional Colored Objects. Elsevier, 2005, doi:US 6,853,373 B2.
View | DOI | Download (ext.)
 
[190]
2005 | Conference Paper | IST-REx-ID: 3557
Edelsbrunner, Herbert. Surface Tiling with Differential Topology. ACM, 2005, pp. 9–11, doi: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.” Combinatorial and Computational Geometry, vol. 52, Cambridge University Press, 2005, pp. 243–75.
View | Download (ext.)
 
[188]
2005 | Conference Paper | IST-REx-ID: 3982
Wang, Yusu, et al. Coarse and Reliable Geometric Alignment for Protein Docking. World Scientific Publishing, 2005, pp. 64–75, doi:10.1142/9789812702456_0007.
View | DOI
 
[187]
2005 | Conference Paper | IST-REx-ID: 3558
Attali, Dominique, et al. Extraction and Simplification of Iso-Surfaces in Tandem. ACM, 2005, pp. 139–48.
View | Download (ext.)
 
[186]
2005 | Journal Article | IST-REx-ID: 3983
Sohn, Jungsan, et al. “Experimental Validation of the Docking Orientation of Cdc25 with Its Cdk2-CycA Protein Substrate.” Biochemistry, vol. 44, no. 50, ACS, 2005, pp. 16563–73, doi:10.1021/bi0516879.
View | DOI
 
[185]
2004 | Journal Article | IST-REx-ID: 3984
Bremer, Peer, et al. “A Topological Hierarchy for Functions on Triangulated Surfaces.” IEEE Transactions on Visualization and Computer Graphics, vol. 10, no. 4, IEEE, 2004, pp. 385–96, doi:10.1109/TVCG.2004.3.
View | DOI
 
[184]
2004 | Conference Paper | IST-REx-ID: 3989
Edelsbrunner, Herbert, et al. Local and Global Comparison of Continuous Functions. IEEE, 2004, pp. 275–80, doi:10.1109/VISUAL.2004.68.
View | DOI
 
[183]
2004 | Book Chapter | IST-REx-ID: 3574
Edelsbrunner, Herbert. “Biological Applications of Computational Topology.” Handbook of Discrete and Computational Geometry, CRC Press, 2004, pp. 1395–412.
View | Download (ext.)
 
[182]
2004 | Journal Article | IST-REx-ID: 3985
Cole Mclaughlin, Kree, et al. “Loops in Reeb Graphs of 2-Manifolds.” Discrete & Computational Geometry, vol. 32, no. 2, Springer, 2004, pp. 231–44, doi: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.” Foundations of Computational Mathematics, vol. 312, Springer, 2004, pp. 37–57, doi:10.1017/CBO9781139106962.003.
View | DOI
 
[180]
2004 | Journal Article | IST-REx-ID: 3986
Bryant, Robert, et al. “The Area Derivative of a Space-Filling Diagram.” Discrete & Computational Geometry, vol. 32, no. 3, Springer, 2004, pp. 293–308, doi: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, vol. 10, no. 5, IEEE, 2004, pp. 587–97, doi:10.1109/TVCG.2004.32.
View | DOI
 
[178]
2004 | Conference Paper | IST-REx-ID: 3988
Choi, Vicky, et al. Local Search Heuristic for Rigid Protein Docking. Vol. 3240, Springer, 2004, pp. 218–29, doi:10.1007/978-3-540-30219-3_19.
View | DOI
 
[177]
2004 | Journal Article | IST-REx-ID: 3990
Agarwal, Pankaj, et al. “Computing the Writhing Number of a Polygonal Knot.” Discrete & Computational Geometry, vol. 32, no. 1, Springer, 2004, pp. 37–53, doi: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.” Discrete & Computational Geometry, Springer, 2003, pp. 379–404, doi: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.” Computer Science in Perspective: Essays Dedicated to Thomas Ottmann, vol. 2598, Springer, 2003, pp. 88–97, doi: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, vol. 100, no. 5, National Academy of Sciences, 2003, pp. 2203–08, doi:10.1073/pnas.0537830100.
View | DOI
 
[173]
2003 | Conference Paper | IST-REx-ID: 3997
Bremer, Peer, et al. A Multi-Resolution Data Structure for Two-Dimensional Morse-Smale Functions. IEEE, 2003, pp. 139–46, doi:10.1109/VISUAL.2003.1250365.
View | DOI
 
[172]
2003 | Conference Paper | IST-REx-ID: 3556
Edelsbrunner, Herbert, et al. Morse-Smale Complexes for Piecewise Linear 3-Manifolds. ACM, 2003, pp. 361–70, doi:10.1145/777792.777846.
View | DOI | Download (ext.)
 
[171]
2003 | Journal Article | IST-REx-ID: 3993
Edelsbrunner, Herbert, et al. “Hierarchical Morse-Smale Complexes for Piecewise Linear 2-Manifolds.” Discrete & Computational Geometry, vol. 30, no. 1, Springer, 2003, pp. 87–107, doi: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, vol. 26, no. 2, Elsevier, 2003, pp. 173–92, doi: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. Vol. 2866, Springer, 2003, pp. 135–51, doi: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, vol. 5, no. 2, International Press, 2003, pp. 19–37.
View | Download (ext.)
 
[167]
2002 | Journal Article | IST-REx-ID: 3996
Edelsbrunner, Herbert, et al. “Topological Persistence and Simplification.” Discrete & Computational Geometry, vol. 28, no. 4, Springer, 2002, pp. 511–33, doi:10.1007/s00454-002-2885-2.
View | DOI
 
[166]
2002 | Conference Paper | IST-REx-ID: 4003
Agarwal, Pankaj, et al. Computing the Writhing Number of a Polygonal Knot. SIAM, 2002, pp. 791–99.
View
 
[165]
2002 | Journal Article | IST-REx-ID: 3998
Edelsbrunner, Herbert, and Damrong Guoy. “An Experimental Study of Sliver Exudation.” Engineering with Computers, vol. 18, no. 3, Springer, 2002, pp. 229–40, doi: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, vol. 12, no. 1–2, World Scientific Publishing, 2002, pp. 143–72, doi: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, doi:US 6,377,865 B1.
View | DOI | Download (ext.)
 
[162]
2002 | Journal Article | IST-REx-ID: 3995
Agarwal, Pankaj, et al. “Algorithmic Issues in Modeling Motion.” ACM Computing Surveys, vol. 34, no. 4, ACM, 2002, pp. 550–72, doi:10.1145/592642.592647.
View | DOI
 
[161]
2001 | Journal Article | IST-REx-ID: 4002
Cheng, Siu, et al. “Design and Analysis of Planar Shape Deformation.” Computational Geometry: Theory and Applications, vol. 19, no. 2–3, Elsevier, 2001, pp. 205–18, doi:10.1016/S0925-7721(01)00020-7.
View | DOI
 
[160]
2001 | Journal Article | IST-REx-ID: 4007
Cheng, Ho, et al. “Dynamic Skin Triangulation.” Discrete & Computational Geometry, vol. 25, no. 4, Springer, 2001, pp. 525–68, doi: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 University Press, 2001, doi: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, doi:US 6,182,016 B1.
View | DOI | Download (ext.)
 
[157]
2001 | Conference Paper | IST-REx-ID: 4005
Cheng, Ho, et al. Dynamic Skin Triangulation. SIAM, 2001, pp. 47–56.
View
 
[156]
2001 | Journal Article | IST-REx-ID: 4001
Cheng, Ho, et al. “Shape Space from Deformation.” Computational Geometry: Theory and Applications, vol. 19, no. 2–3, Elsevier, 2001, pp. 191–204, doi: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, vol. 7, no. 5, Springer, 2001, pp. 379–99, doi:10.3217/jucs-007-05-0379.
View | DOI
 
[154]
2000 | Conference Paper | IST-REx-ID: 3555
Edelsbrunner, Herbert, et al. Smoothing and Cleaning up Slivers. ACM, 2000, pp. 273–77, doi:10.1145/335305.335338.
View | DOI | Download (ext.)
 
[153]
2000 | Conference Paper | IST-REx-ID: 4008
Edelsbrunner, Herbert, et al. Topological Persistance and Simplification. IEEE, 2000, pp. 454–63, doi:10.1109/SFCS.2000.892133.
View | DOI
 
[152]
2000 | Journal Article | IST-REx-ID: 4010
Cheng, Siu, et al. “Sliver Exudation.” Journal of the ACM, vol. 47, no. 5, ACM, 2000, pp. 883–904, doi: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, vol. 24, no. 4, Springer, 2000, pp. 707–19, doi: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, vol. 10, no. 3, World Scientific Publishing, 2000, pp. 267–84, doi:10.1142/S0218195900000164.
View | DOI
 
[149]
2000 | Journal Article | IST-REx-ID: 3583
Edelsbrunner, Herbert. “Triangulations and Meshes in Computational Geometry.” Acta Numerica, vol. 9, Cambridge University Press, 2000, pp. 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.” Zur Kunst Des Formalen Denkens, Passagen Verlag, 2000, pp. 153–71.
View | Download (ext.)
 
[147]
1999 | Conference Paper | IST-REx-ID: 3554
Jiao, Xiangmin, et al. Mesh Association: Formulation and Algorithms. Elsevier, 1999, pp. 75–82.
View | Download (ext.)
 
[146]
1999 | Journal Article | IST-REx-ID: 4014
Edelsbrunner, Herbert. “Deformable Smooth Surface Design.” Discrete & Computational Geometry, vol. 21, no. 1, Springer, 1999, pp. 87–115, doi:10.1007/PL00009412.
View | DOI
 
[145]
1999 | Journal Article | IST-REx-ID: 3582
Dey, Tamal, et al. “Topology Preserving Edge Contraction.” Publications de l’Institut Mathématique, vol. 66, Jugostampa, 1999, pp. 23–45.
View | Download (ext.)
 
[144]
1999 | Book Chapter | IST-REx-ID: 3571
Dey, Tamal, et al. “Computational Topology.” Advances in Discrete and Computational Geometry, vol. 223, American Mathematical Society, 1999, pp. 109–43.
View | Download (ext.)
 
[143]
1998 | Conference Paper | IST-REx-ID: 4019
Cheng, Ho, et al. Shape Space from Deformation. IEEE, 1998, pp. 104–13, doi:10.1109/PCCGA.1998.732056.
View | DOI
 
[142]
1998 | Conference Paper | IST-REx-ID: 4015
Edelsbrunner, Herbert. Shape Reconstruction with Delaunay Complex. Vol. 1380, Springer, 1998, pp. 119–32, doi: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, doi: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.” Mathematical Visualization, Springer, 1998, pp. 223–36, doi:10.1007/978-3-662-03567-2_17.
View | DOI
 
[139]
1998 | Journal Article | IST-REx-ID: 4011
Liang, Jie, et al. “Analytical Shape Computation of Macromolecules: I. Molecular Area and Volume through Alpha Shape.” Proteins: Structure, Function and Bioinformatics, vol. 33, no. 1, Wiley-Blackwell, 1998, pp. 1–17, doi: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, et al. Wrapping 3D Scanning Data. Vol. 3313, SPIE, 1998, pp. 148–58, doi:10.1117/12.302448.
View | DOI
 
[137]
1998 | Journal Article | IST-REx-ID: 4012
Liang, Jie, et al. “Analytical Shape Computation of Macromolecules: II. Inaccessible Cavities in Proteins.” Proteins: Structure, Function and Bioinformatics, vol. 33, no. 1, Wiley-Blackwell, 1998, pp. 18–29, doi: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, et al. “Anatomy of Protein Pockets and Cavities: Measurement of Binding Site Geometry and Implications for Ligand Design.” Protein Science, vol. 7, no. 9, Wiley-Blackwell, 1998, pp. 1884–97, doi:10.1002/pro.5560070905.
View | DOI | Download (ext.)
 
[135]
1998 | Journal Article | IST-REx-ID: 4013
Edelsbrunner, Herbert, et al. “On the Definition and the Construction of Pockets in Macromolecules.” Discrete Applied Mathematics, vol. 88, no. 1–3, Elsevier, 1998, pp. 83–102, doi:10.1016/S0166-218X(98)00067-5.
View | DOI
 
[134]
1998 | Book Chapter | IST-REx-ID: 4020
Edelsbrunner, Herbert. “Geometry for Modeling Biomolecules.” Robotics: The Algorithmic Perspective, AK Peters, 1998, pp. 265–77.
View
 
[133]
1997 | Journal Article | IST-REx-ID: 4021
Edelsbrunner, Herbert, and Roman Waupotitsch. “A Combinatorial Approach to Cartograms.” Computational Geometry: Theory and Applications, vol. 7, no. 5–6, Elsevier, 1997, pp. 343–60, doi:387910.1016/S0925-7721(96)00006-5.
View | DOI
 
[132]
1997 | Journal Article | IST-REx-ID: 4022
Edelsbrunner, Herbert, et al. “Cutting Dense Point Sets in Half.” Discrete & Computational Geometry, vol. 17, no. 3, Springer, 1997, pp. 243–55, doi: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, vol. 17, no. 3, Springer, 1997, pp. 287–306, doi: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, vol. 7, no. 4, World Scientific Publishing, 1997, pp. 365–78, doi: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, vol. 15, no. 3, Springer, 1996, pp. 223–41, doi:10.1007/BF01975867.
View | DOI
 
[128]
1996 | Journal Article | IST-REx-ID: 4027
Chazelle, Bernard, et al. “Lines in Space: Combinatorics and Algorithms.” Algorithmica, vol. 15, no. 5, Springer, 1996, pp. 428–47, doi:10.1007/BF01955043.
View | DOI
 
[127]
1996 | Conference Poster | IST-REx-ID: 4030
Liang, Jie, et al. “Effects of Molecular Shape Representations on Boundary Element Method for Protein Electrostatics Computations.” Fortieth Annual Meeting, vol. 70, no. 2, Part 2, Cell Press, 1996, pp. A224–A224, doi:10.1016/S0006-3495(96)79664-9.
View | DOI
 
[126]
1996 | Journal Article | IST-REx-ID: 4024
Akkiraju, Nataraj, et al. “Viewing Geometric Protein Structures from inside a CAVE.” IEEE Computer Graphics and Applications, vol. 16, no. 4, IEEE, 1996, pp. 58–61, doi:10.1109/38.511855.
View | DOI
 
[125]
1996 | Conference Poster | IST-REx-ID: 4031
Liang, Jie, et al. “Analytical Method for Molecular Shapes: Area, Volume, Cavities, Interface and Pockets.” Fortieth Annual Meeting, vol. 70, no. 2, Part 2, Cell Press, 1996, pp. A377–A377, doi:10.1016/S0006-3495(96)79670-4.
View | DOI
 
[124]
1996 | Conference Paper | IST-REx-ID: 3553
Edelsbrunner, Herbert, et al. Geometric Modeling in CAVE. ACM, 1996, pp. 35-41 and-193–94.
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, vol. 71, no. 1–3, Elsevier, 1996, pp. 5–22, doi: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. IEEE, 1995, pp. 248–57.
View
 
[121]
1995 | Conference Paper | IST-REx-ID: 3551
Edelsbrunner, Herbert, et al. Measuring Proteins and Voids in Proteins. IEEE, 1995, pp. 256–64, doi: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, vol. 13, no. 1, Springer, 1995, pp. 415–40, doi:10.1007/BF02574053.
View | DOI
 
[119]
1995 | Journal Article | IST-REx-ID: 4035
Chazelle, Bernard, et al. “Improved Bounds on Weak ε-Nets for Convex Sets.” Discrete & Computational Geometry, vol. 13, no. 1, Springer, 1995, pp. 1–15, doi:10.1007/BF02574025.
View | DOI
 
[118]
1995 | Conference Paper | IST-REx-ID: 3552
Akkiraju, Nataraj, et al. Alpha Shapes: Definition and Software. Elsevier, 1995, pp. 63–66.
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, vol. 12, no. 7, Elsevier, 1995, pp. 771–84, doi:10.1016/0167-8396(95)00016-Y.
View | DOI
 
[116]
1994 | Journal Article | IST-REx-ID: 4033
Chazelle, Bernard, et al. “Selecting Heavily Covered Points.” SIAM Journal on Computing, vol. 23, no. 6, SIAM, 1994, pp. 1138–51, doi:10.1137/S0097539790179919 .
View | DOI
 
[115]
1994 | Journal Article | IST-REx-ID: 4038
Chazelle, Bernard, et al. “Algorithms for Bichromatic Line-Segment Problems and Polyhedral Terrains.” Algorithmica, vol. 11, no. 2, Springer, 1994, pp. 116–32, doi:10.1007/BF01182771.
View | DOI
 
[114]
1994 | Conference Paper | IST-REx-ID: 3550
Edelsbrunner, Herbert. Modeling with Simplicial Complexes (Topology, Geometry and Algorithms). Unknown, 1994, pp. 36–44.
View | Download (ext.)
 
[113]
1994 | Journal Article | IST-REx-ID: 4039
Chazelle, Bernard, et al. “Ray Shooting in Polygons Using Geodesic Triangulations.” Algorithmica, vol. 12, no. 1, Springer, 1994, pp. 54–68, doi: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, vol. 12, no. 1, Springer, 1994, pp. 281–89, doi: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, vol. 13, no. 1, ACM, 1994, pp. 43–72, doi: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, vol. 10, no. 1, Springer, 1993, pp. 197–213, doi:10.1007/BF02573974.
View | DOI
 
[109]
1993 | Journal Article | IST-REx-ID: 4045
Chazelle, Bernard, et al. “Diameter, Width, Closest Line Pair, and Parametric Searching.” Discrete & Computational Geometry, vol. 10, no. 1, Springer, 1993, pp. 183–96, doi:10.1007/BF02573973.
View | DOI
 
[108]
1993 | Journal Article | IST-REx-ID: 4041
Edelsbrunner, Herbert, et al. “On the Zone Theorem for Hyperplane Arrangements.” SIAM Journal on Computing, vol. 22, no. 2, SIAM, 1993, pp. 418–29, doi:10.1137/0222031.
View | DOI
 
[107]
1993 | Book Chapter | IST-REx-ID: 3568
Edelsbrunner, Herbert. “Geometric Algorithms.” Handbook of Convex Geometry, North Holland, 1993, pp. 699–735.
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, vol. 22, no. 3, SIAM, 1993, pp. 527–51, doi:10.1137/0222036 .
View | DOI
 
[105]
1993 | Book Chapter | IST-REx-ID: 3569
Edelsbrunner, Herbert. “Computational Geometry.” Current Trends in Theoretical Computer Science, Essays and Tutorials, World Scientific Publishing, 1993, pp. 1–48, doi:10.1007/978-3-662-04245-8_1.
View | DOI
 
[104]
1993 | Journal Article | IST-REx-ID: 4036
Chazelle, Bernard, et al. “Computing a Face in an Arrangement of Line Segments and Related Problems.” SIAM Journal on Computing, vol. 22, no. 6, SIAM, 1993, pp. 1286–302, doi:10.1137/0222077 .
View | DOI
 
[103]
1993 | Journal Article | IST-REx-ID: 4044
Bern, Marshall, et al. “Edge Insertion for Optimal Triangulations.” Discrete & Computational Geometry, vol. 10, no. 1, Springer, 1993, pp. 47–65, doi:10.1007/BF02573962.
View | DOI
 
[102]
1992 | Journal Article | IST-REx-ID: 3581
Chazelle, Bernard, et al. “Counting and Cutting Cycles of Lines and Rods in Space.” Computational Geometry: Theory and Applications, vol. 1, no. 6, Elsevier, 1992, pp. 305–23, doi: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, vol. 39, no. 1, ACM, 1992, pp. 1–54, doi:10.1145/147508.147511.
View | DOI
 
[100]
1992 | Journal Article | IST-REx-ID: 4053
Aronov, Boris, et al. “The Number of Edges of Many Faces in a Line Segment Arrangement.” Combinatorica, vol. 12, no. 3, Springer, 1992, pp. 261–74, doi:10.1007/BF01285815.
View | DOI
 
[99]
1992 | Journal Article | IST-REx-ID: 4047
Edelsbrunner, Herbert, et al. “Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms.” Theoretical Computer Science, vol. 92, no. 2, Elsevier, 1992, pp. 319–36, doi:10.1016/0304-3975(92)90319-B.
View | DOI
 
[98]
1992 | Journal Article | IST-REx-ID: 4043
Edelsbrunner, Herbert, et al. “An O(N^2 Log n) Time Algorithm for the MinMax Angle Triangulation.” SIAM Journal on Scientific Computing, vol. 13, no. 4, Society for Industrial and Applied Mathematics , 1992, pp. 994–1008, doi:10.1137/0913058.
View | DOI
 
[97]
1992 | Journal Article | IST-REx-ID: 4048
Aggarwal, Alok, et al. “Optimal Time Bounds for Some Proximity Problems in the Plane.” Information Processing Letters, vol. 42, no. 1, Elsevier, 1992, pp. 55–60, doi: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, vol. 8, no. 1, Springer, 1992, pp. 217–217, doi:10.1007/BF02293046.
View | DOI
 
[95]
1992 | Conference Paper | IST-REx-ID: 4049
Bern, Marshall, et al. Edge Insertion for Optimal Triangulations. Vol. 583, Springer, 1992, pp. 46–60, doi: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.” Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift, vol. 4, American Mathematical Society, 1991, pp. 253–63.
View | Download (ext.)
 
[93]
1991 | Journal Article | IST-REx-ID: 4052
Chazelle, Bernard, et al. “A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications.” Theoretical Computer Science, vol. 84, no. 1, Elsevier, 1991, pp. 77–105, doi: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, vol. 42, no. 2, Elsevier, 1991, pp. 249–51, doi: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.” Discrete & Computational Geometry, vol. 6, Springer, 1991, pp. 77–93.
View | Download (ext.)
 
[90]
1991 | Conference Paper | IST-REx-ID: 4058
Chazelle, Bernard, et al. Computing a Face in an Arrangement of Line Segments. SIAM, 1991, pp. 441–48.
View
 
[89]
1991 | Conference Paper | IST-REx-ID: 4054
Edelsbrunner, Herbert, et al. On the Zone Theorem for Hyperplane Arrangements. Vol. 555, Springer, 1991, pp. 108–23, doi:10.1007/BFb0038185.
View | DOI
 
[88]
1991 | Conference Paper | IST-REx-ID: 4059
Chazelle, Bernard, et al. Ray Shooting in Polygons Using Geodesic Triangulations. Vol. 510, Springer, 1991, pp. 661–73, doi:10.1007/3-540-54233-7_172.
View | DOI
 
[87]
1991 | Journal Article | IST-REx-ID: 4061
Agarwal, Pankaj, et al. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.” Discrete & Computational Geometry, vol. 6, no. 1, Springer, 1991, pp. 407–22, doi: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. IEEE, 1991, pp. 414–23, doi:10.1109/SFCS.1991.185400.
View | DOI
 
[85]
1991 | Journal Article | IST-REx-ID: 4062
Aronov, Boris, et al. “Points and Triangles in the Plane and Halving Planes in Space.” Discrete & Computational Geometry, vol. 6, no. 1, Springer, 1991, pp. 435–42, doi: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, vol. 20, no. 2, SIAM, 1991, pp. 259–69, doi: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, vol. 56, no. 2, Elsevier, 1991, pp. 312–16, doi: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, vol. 85, no. 409, American Statistical Association, 1990, pp. 115–19, doi: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, vol. 10, no. 3, Springer, 1990, pp. 251–60, doi:10.1007/BF02122779.
View | DOI
 
[80]
1990 | Conference Paper | IST-REx-ID: 4071
Edelsbrunner, Herbert, et al. An O(N^2log n) Time Algorithm for the MinMax Angle Triangulation. ACM, 1990, pp. 44–52, doi:10.1145/98524.98535.
View | DOI
 
[79]
1990 | Conference Paper | IST-REx-ID: 4076
Agarwal, Pankaj, et al. Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. ACM, 1990, pp. 203–10, doi:10.1145/98524.98567.
View | DOI
 
[78]
1990 | Journal Article | IST-REx-ID: 4060
Edelsbrunner, Herbert, et al. “Tetrahedrizing Point Sets in Three Dimensions.” Journal of Symbolic Computation, vol. 10, no. 3–4, Elsevier, 1990, pp. 335–47, doi:10.1016/S0747-7171(08)80068-5.
View | DOI | Download (ext.)
 
[77]
1990 | Journal Article | IST-REx-ID: 4065
Edelsbrunner, Herbert, et al. “Covering Convex Sets with Non-Overlapping Polygons.” Discrete Mathematics, vol. 81, no. 2, Elsevier, 1990, pp. 153–64, doi:10.1016/0012-365X(90)90147-A.
View | DOI
 
[76]
1990 | Journal Article | IST-REx-ID: 4072
Edelsbrunner, Herbert, et al. “The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.” Discrete & Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 161–96, doi: 10.1007/BF02187784.
View | DOI
 
[75]
1990 | Conference Paper | IST-REx-ID: 4077
Aronov, Boris, et al. Points and Triangles in the Plane and Halving Planes in Space. ACM, 1990, pp. 112–15, doi:10.1145/98524.98548.
View | DOI
 
[74]
1990 | Journal Article | IST-REx-ID: 4066
Edelsbrunner, Herbert, et al. “The Complexity of Many Cells in Arrangements of Planes and Related Problems.” Discrete & Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 197–216, doi:10.1007/BF02187785.
View | DOI
 
[73]
1990 | Conference Paper | IST-REx-ID: 4073
Chazelle, Bernard, et al. Counting and Cutting Cycles of Lines and Rods in Space. IEEE, 1990, pp. 242–51, doi:10.1109/FSCS.1990.89543.
View | DOI
 
[72]
1990 | Conference Paper | IST-REx-ID: 4078
Chazelle, Bernard, et al. Slimming down by Adding; Selecting Heavily Covered Points. ACM, 1990, pp. 116–27, doi: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. Vol. 450, Springer, 1990, pp. 419–28, doi:10.1007/3-540-52921-7_91.
View | DOI
 
[70]
1990 | Journal Article | IST-REx-ID: 4074
Clarkson, Kenneth, et al. “Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.” Discrete & Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 99–160, doi:10.1007/BF02187783.
View | DOI
 
[69]
1990 | Book Chapter | IST-REx-ID: 3565
Dobkin, David, et al. “Probing Convex Polytopes.” Autonomous Robot Vehicles, edited by Ingemar Cox and Gordon Wilfong, Springer, 1990, pp. 328–41, doi: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, vol. 9, no. 1, ACM, 1990, pp. 66–104, doi: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, vol. 5, no. 1, Springer, 1990, pp. 35–42, doi: 10.1007/BF02187778.
View | DOI
 
[66]
1990 | Journal Article | IST-REx-ID: 4070
Edelsbrunner, Herbert, et al. “Ranking Intervals under Visibility Constraints.” International Journal of Computer Mathematics, vol. 34, no. 3–4, Taylor & Francis, 1990, pp. 129–44, doi:10.1080/00207169008803871.
View | DOI
 
[65]
1990 | Journal Article | IST-REx-ID: 4075
Dobkin, David, et al. “Searching for Empty Convex Polygons.” Algorithmica, vol. 5, no. 4, Springer, 1990, pp. 561–71, doi:10.1007/BF01840404.
View | DOI
 
[64]
1989 | Journal Article | IST-REx-ID: 4083
Yao, F., et al. “Partitioning Space for Range Queries.” SIAM Journal on Computing, vol. 18, no. 2, SIAM, 1989, pp. 371–84, doi:10.1137/0218025.
View | DOI
 
[63]
1989 | Journal Article | IST-REx-ID: 4088
Edelsbrunner, Herbert, et al. “Implicitly Representing Arrangements of Lines or Segments.” Discrete & Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 433–66, doi:10.1007/BF02187742.
View | DOI
 
[62]
1989 | Journal Article | IST-REx-ID: 4084
Edelsbrunner, Herbert, et al. “Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.” Theoretical Computer Science, vol. 66, no. 2, Elsevier, 1989, pp. 157–80, doi:10.1016/0304-3975(89)90133-3.
View | DOI
 
[61]
1989 | Journal Article | IST-REx-ID: 4089
Edelsbrunner, Herbert, et al. “On Arrangements of Jordan Arcs with Three Intersections per Pair.” Discrete & Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 523–39, doi:10.1007/BF02187745.
View | DOI
 
[60]
1989 | Conference Paper | IST-REx-ID: 3549
Edelsbrunner, Herbert. Spatial Triangulations with Dihedral Angle Conditions. Institute of the Electronics, Information and Communication Enginneers, 1989, pp. 83–89.
View
 
[59]
1989 | Journal Article | IST-REx-ID: 4080
Edelsbrunner, Herbert, et al. “Circles through Two Points That Always Enclose Many Points.” Geometriae Dedicata, vol. 32, no. 1, Kluwer, 1989, pp. 1–12, doi:10.1007/BF00181432.
View | DOI
 
[58]
1989 | Conference Paper | IST-REx-ID: 4085
Edelsbrunner, Herbert. An Acyclicity Theorem for Cell Complexes in d Dimension. ACM, 1989, pp. 145–51, doi:10.1145/73833.73850.
View | DOI
 
[57]
1989 | Conference Paper | IST-REx-ID: 4092
Chazelle, Bernard, et al. A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications. Vol. 372, Springer, 1989, pp. 179–93, doi: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, vol. 96, no. 7, Mathematical Association of America, 1989, pp. 614–18.
View | Download (ext.)
 
[55]
1989 | Journal Article | IST-REx-ID: 4081
Edelsbrunner, Herbert, et al. “The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.” Discrete & Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 311–36, doi: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, vol. 4, no. 4, Springer, 1989, pp. 337–43, doi:10.1007/BF02187734.
View | DOI
 
[53]
1989 | Journal Article | IST-REx-ID: 4093
Chazelle, Bernard, et al. “The Complexity of Cutting Complexes.” Discrete & Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 139–81, doi: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, vol. 38, no. 1, Elsevier, 1989, pp. 165–94, doi:10.1016/0022-0000(89)90038-X.
View | DOI
 
[51]
1989 | Conference Paper | IST-REx-ID: 4087
Edelsbrunner, Herbert, et al. Tetrahedrizing Point Sets in Three Dimensions. Vol. 358, Springer, 1989, pp. 315–31, doi: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, vol. 77, no. 3, Elsevier, 1988, pp. 218–32, doi: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, vol. 17, no. 5, SIAM, 1988, pp. 870–82, doi:10.1137/0217054 .
View | DOI
 
[48]
1988 | Conference Paper | IST-REx-ID: 4096
Edelsbrunner, Herbert. Geometric Structures in Computational Geometry. Vol. 317, Springer, 1988, pp. 201–13, doi:10.1007/3-540-19488-6_117.
View | DOI
 
[47]
1988 | Conference Paper | IST-REx-ID: 4097
Edelsbrunner, Herbert, et al. Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms. Vol. 317, Springer, 1988, pp. 214–29, doi: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, vol. 36, no. 11, IEEE, 1987, pp. 1349–54, doi: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, vol. 2, no. 1, Springer, 1987, pp. 113–26, doi: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, et al. On the Lower Envelope of Bivariate Functions and Its Applications. IEEE, 1987, pp. 27–37, doi: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, vol. 24, no. 6, Elsevier, 1987, pp. 413–17, doi: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, vol. 26, no. 2, Elsevier, 1987, pp. 61–64, doi: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, vol. 8, no. 3, Academic Press, 1987, pp. 348–61, doi: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, vol. 1, no. 1–4, Springer, 1986, pp. 93–109, doi: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, vol. 41, no. 2, Elsevier, 1986, pp. 159–66, doi: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, vol. 1, no. 1, Springer, 1986, pp. 25–44, doi: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, vol. 15, no. 1, SIAM, 1986, pp. 271–84, doi: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, vol. 53, Utilitas Mathemtica Publ. Inc., 1986, pp. 193–200.
View
 
[34]
1986 | Journal Article | IST-REx-ID: 4104
Edelsbrunner, Herbert, et al. “Optimal Point Location in a Monotone Subdivision.” SIAM Journal on Computing, vol. 15, no. 2, SIAM, 1986, pp. 317–40, doi:10.1137/0215023.
View | DOI
 
[33]
1986 | Journal Article | IST-REx-ID: 4109
Edelsbrunner, Herbert, et al. “Rectangular Point Location in D-Dimensions with Applications.” Computer Journal, vol. 29, no. 1, Oxford University Press, 1986, pp. 76–82, doi:10.1093/comjnl/29.1.76.
View | DOI
 
[32]
1986 | Journal Article | IST-REx-ID: 4105
Edelsbrunner, Herbert, et al. “Constructing Arrangements of Lines and Hyperplanes with Applications.” SIAM Journal on Computing, vol. 15, no. 2, SIAM, 1986, pp. 341–63, doi: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, vol. 43, no. 2, Elsevier, 1986, pp. 344–49, doi: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, vol. 2, no. 2, Elsevier, 1986, pp. 171–78, doi: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, vol. 23, no. 5, Elsevier, 1986, pp. 289–93, doi: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, vol. 60, no. C, Elsevier, 1986, pp. 139–46, doi: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, vol. 6, no. 2, Academic Press, 1985, pp. 213–24, doi: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, vol. 21, no. 1, Elsevier, 1985, pp. 39–47, doi: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, vol. 35, no. 1, Elsevier, 1985, pp. 55–69, doi: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, vol. 6, no. 4, Academic Press, 1985, pp. 515–42, doi: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, vol. 38, no. 1, Elsevier, 1985, pp. 15–29, doi: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, vol. 1, no. 1, Elsevier, 1985, pp. 47–56, doi: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, vol. 2, no. 2–3, Springer, 1985, pp. 239–54, doi:10.1007/BF01908077.
View | DOI
 
[20]
1984 | Conference Paper | IST-REx-ID: 4122
Edelsbrunner, Herbert. Key-Problems and Key-Methods in Computational Geometry. Vol. 166, Springer, 1984, pp. 1–13, doi:10.1007/3-540-12920-0_1.
View | DOI
 
[19]
1984 | Journal Article | IST-REx-ID: 4123
Edelsbrunner, Herbert, et al. “Some Methods of Computational Geometry Applied to Computer Graphics.” Computer Vision, Graphics, and Image Processing, vol. 28, no. 1, Academic Press, 1984, pp. 92–108, doi: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. Teubner, 1984, pp. 88–99.
View | Download (ext.)
 
[17]
1984 | Journal Article | IST-REx-ID: 4117
Edelsbrunner, Herbert, et al. “Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space.” Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications, vol. 18, no. 2, Cambridge University Press, 1984, pp. 171–83.
View
 
[16]
1984 | Journal Article | IST-REx-ID: 4118
Edelsbrunner, Herbert, et al. “Stationing Guards in Rectilinear Art Galleries.” Computer Vision, Graphics, and Image Processing, vol. 27, no. 2, Academic Press, 1984, pp. 167–76, doi: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, vol. 17, no. 2, Springer, 1984, pp. 251–57, doi: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. Vol. 176, Springer, 1984, pp. 265–72, doi: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, vol. 1, no. 1, Springer, 1984, pp. 7–24, doi: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, vol. 13, no. 3–4, Taylor & Francis, 1983, pp. 221–29, doi: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.” Computational Geometry: Theory and Applications, edited by Franco Preparata, vol. 1, Elsevier, 1983, pp. 109–25.
View | Download (ext.)
 
[10]
1983 | Journal Article | IST-REx-ID: 4128
Edelsbrunner, Herbert, et al. “On the Shape of a Set of Points in the Plane.” IEEE Transactions on Information Theory, vol. 29, no. 4, IEEE, 1983, pp. 551–59, doi:10.1109/TIT.1983.1056714 .
View | DOI
 
[9]
1983 | Book Chapter | IST-REx-ID: 3563
Edelsbrunner, Herbert, et al. “Graphics in Flatland: A Case Study.” Computational Geometry: Theory and Applications, edited by Franco Preparata, vol. 1, Elsevier, 1983, pp. 35–59.
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. Vol. 154, Springer, 1983, pp. 182–87, doi:10.1007/BFb0036908.
View | DOI
 
[7]
1983 | Book Chapter | IST-REx-ID: 3564
Edelsbrunner, Herbert. “Neue Entwicklungen Im Bereich Datenstrukturen.” Überblicke Informationsverarbeitung , edited by Hermann Maurer, BI Wissenschaftsverlag, 1983, pp. 55–109.
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, vol. 13, no. 3–4, Taylor & Francis, 1983, pp. 209–19, doi:10.1080/00207168308803364.
View | DOI
 
[5]
1982 | Journal Article | IST-REx-ID: 4130
Edelsbrunner, Herbert, et al. “Polygonal Intersection Searching.” Information Processing Letters, vol. 14, no. 2, Elsevier, 1982, pp. 74–79, doi:10.1016/0020-0190(82)90090-4.
View | DOI
 
[4]
1982 | Journal Article | IST-REx-ID: 4129
Edelsbrunner, Herbert, et al. “Stabbing Line Segments.” Bit, vol. 22, no. 3, Springer, 1982, pp. 274–81, doi: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, vol. 14, no. 3, Elsevier, 1982, pp. 124–27, doi: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, vol. 13, no. 4–5, Elsevier, 1981, pp. 177–81, doi: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, vol. 16, no. 3, Elsevier, 1981, pp. 329–36, doi:10.1016/0304-3975(81)90103-1.
View | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed