288 Publications

Mark all

[288]
2021 | Journal Article | IST-REx-ID: 9317 | OA
Edelsbrunner H, Osang GF. 2021. The multi-cover persistence of Euclidean balls. Discrete and Computational Geometry.
View | Files available | DOI | Download Published Version (ext.)
 
[287]
2021 | Journal Article | IST-REx-ID: 9465 | OA
Edelsbrunner H, Nikitenko A, Osang GF. 2021. A step in the Delaunay mosaic of order k. Journal of Geometry. 112(1), 15.
View | Files available | DOI
 
[286]
2021 | Conference Paper | IST-REx-ID: 9604 | OA
Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. 2021. Counting cells of order-k voronoi tessellations in ℝ3 with morse theory. Leibniz International Proceedings in Informatics. SoCG: International Symposium on Computational Geometry, LIPIcs, vol. 189, 16.
View | Files available | DOI
 
[285]
2021 | Conference Paper | IST-REx-ID: 9345 | OA
Edelsbrunner H, Heiss T, Kurlin V, Smith P, Wintraecken M. 2021. The density fingerprint of a periodic point set. 37th International Symposium on Computational Geometry (SoCG 2021). SoCG: Symposium on Computational Geometry, LIPIcs, vol. 189, 32:1-32:16.
View | Files available | DOI
 
[284]
2020 | Conference Paper | IST-REx-ID: 8135 | OA
Edelsbrunner H, Nikitenko A, Ölsböck K, Synak P. 2020. Radius functions on Poisson–Delaunay mosaics and related complexes experimentally. Topological Data Analysis. , Abel Symposia, vol. 15, 181–218.
View | Files available | DOI
 
[283]
2020 | Journal Article | IST-REx-ID: 7554 | OA
Edelsbrunner H, Nikitenko A. 2020. Weighted Poisson–Delaunay mosaics. Theory of Probability and its Applications. 64(4), 595–614.
View | DOI | Download Preprint (ext.) | arXiv
 
[282]
2020 | Journal Article | IST-REx-ID: 7666 | OA
Edelsbrunner H, Ölsböck K. 2020. Tri-partitions and bases of an ordered complex. Discrete and Computational Geometry. 64, 759–775.
View | Files available | DOI
 
[281]
2020 | Journal Article | IST-REx-ID: 9156 | OA
Akopyan A, Edelsbrunner H. 2020. The weighted Gaussian curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. 8(1), 74–88.
View | Files available | DOI | arXiv
 
[280]
2020 | Journal Article | IST-REx-ID: 9157 | OA
Akopyan A, Edelsbrunner H. 2020. The weighted mean curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. 8(1), 51–67.
View | Files available | DOI
 
[279]
2020 | Journal Article | IST-REx-ID: 9630 | OA
Edelsbrunner H, Virk Z, Wagner H. 2020. Topological data analysis in information space. Journal of Computational Geometry. 11(2), 162–182.
View | Files available | DOI
 
[278]
2019 | Journal Article | IST-REx-ID: 5678 | OA
Edelsbrunner H, Nikitenko A. 2019. Poisson–Delaunay Mosaics of Order k. Discrete and Computational Geometry. 62(4), 865–878.
View | Files available | DOI | arXiv
 
[277]
2019 | Journal Article | IST-REx-ID: 6608 | OA
Edelsbrunner H, Ölsböck K. 2019. Holes and dependences in an ordered complex. Computer Aided Geometric Design. 73, 1–15.
View | Files available | DOI
 
[276]
2019 | Conference Paper | IST-REx-ID: 6648 | OA
Edelsbrunner H, Virk Z, Wagner H. 2019. Topological data analysis in information space. 35th International Symposium on Computational Geometry. SoCG 2019: Symposium on Computational Geometry, LIPIcs, vol. 129, 31:1-31:14.
View | Files available | DOI | arXiv
 
[275]
2019 | Journal Article | IST-REx-ID: 6756 | OA
Pranav P, Adler RJ, Buchert T, Edelsbrunner H, Jones BJT, Schwartzman A, Wagner H, Van De Weygaert R. 2019. Unexpected topology of the temperature fluctuations in the cosmic microwave background. Astronomy and Astrophysics. 627, A163.
View | Files available | DOI | arXiv
 
[274]
2018 | Journal Article | IST-REx-ID: 87 | OA
Edelsbrunner H, Nikitenko A. 2018. Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics. Annals of Applied Probability. 28(5), 3215–3238.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[273]
2018 | Conference Paper | IST-REx-ID: 188 | OA
Edelsbrunner H, Virk Z, Wagner H. 2018. Smallest enclosing spheres and Chernoff points in Bregman geometry. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 35:1-35:13.
View | Files available | DOI
 
[272]
2018 | Journal Article | IST-REx-ID: 530 | OA
Edelsbrunner H, Iglesias Ham M. 2018. Multiple covers with balls I: Inclusion–exclusion. Computational Geometry: Theory and Applications. 68, 119–133.
View | Files available | DOI
 
[271]
2018 | Journal Article | IST-REx-ID: 312 | OA
Edelsbrunner H, Iglesias Ham M. 2018. On the optimality of the FCC lattice for soft sphere packing. SIAM J Discrete Math. 32(1), 750–782.
View | DOI | Download Submitted Version (ext.)
 
[270]
2018 | Conference Paper | IST-REx-ID: 187 | OA
Edelsbrunner H, Osang GF. 2018. The multi-cover persistence of Euclidean balls. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99, 34.
View | Files available | DOI
 
[269]
2017 | Book Chapter | IST-REx-ID: 84
Edelsbrunner H, Koehl P. 2017.Computational topology for structural molecular biology. In: Handbook of Discrete and Computational Geometry, Third Edition. , 1709–1735.
View | DOI
 
[268]
2017 | Journal Article | IST-REx-ID: 718 | OA
Edelsbrunner H, Nikitenko A, Reitzner M. 2017. Expected sizes of poisson Delaunay mosaics and their discrete Morse functions. Advances in Applied Probability. 49(3), 745–767.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[267]
2017 | Conference Paper | IST-REx-ID: 688 | OA
Edelsbrunner H, Wagner H. 2017. Topological data analysis with Bregman divergences. Symposium on Computational Geometry, SoCG, LIPIcs, vol. 77, 391–3916.
View | Files available | DOI
 
[266]
2017 | Journal Article | IST-REx-ID: 1022 | OA
Pranav P, Edelsbrunner H, Van De Weygaert R, Vegter G, Kerber M, Jones B, Wintraecken M. 2017. The topology of the cosmic web in terms of persistent Betti numbers. Monthly Notices of the Royal Astronomical Society. 465(4), 4281–4310.
View | DOI | Download Submitted Version (ext.)
 
[265]
2017 | Journal Article | IST-REx-ID: 1072 | OA
Bauer U, Edelsbrunner H. 2017. The Morse theory of Čech and delaunay complexes. Transactions of the American Mathematical Society. 369(5), 3741–3762.
View | Download Preprint (ext.)
 
[264]
2017 | Journal Article | IST-REx-ID: 1173 | OA
Edelsbrunner H, Glazyrin A, Musin O, Nikitenko A. 2017. The Voronoi functional is maximized by the Delaunay triangulation in the plane. Combinatorica. 37(5), 887–910.
View | DOI | Download Submitted Version (ext.)
 
[263]
2016 | Journal Article | IST-REx-ID: 1289 | OA
Dunaeva O, Edelsbrunner H, Lukyanov A, Machin M, Malkova D, Kuvaev R, Kashin S. 2016. The classification of endoscopy images with persistent homology. Pattern Recognition Letters. 83(1), 13–22.
View | Files available | DOI
 
[262]
2016 | Journal Article | IST-REx-ID: 1295
Edelsbrunner H, Iglesias Ham M. 2016. Multiple covers with balls II: Weighted averages. Electronic Notes in Discrete Mathematics. 54, 169–174.
View | DOI
 
[261]
2016 | Journal Article | IST-REx-ID: 1662 | OA
Edelsbrunner H, Pausinger F. 2016. Approximation and convergence of the intrinsic volume. Advances in Mathematics. 287, 674–703.
View | Files available | DOI
 
[260]
2015 | Journal Article | IST-REx-ID: 2035 | OA
Edelsbrunner H, Jablonski G, Mrozek M. 2015. The persistent homology of a self-map. Foundations of Computational Mathematics. 15(5), 1213–1244.
View | Files available | DOI
 
[259]
2015 | Conference Paper | IST-REx-ID: 1495 | OA
Edelsbrunner H, Iglesias Ham M, Kurlin V. 2015. Relaxed disk packing. Proceedings of the 27th Canadian Conference on Computational Geometry. CCCG: Canadian Conference on Computational Geometry vol. 2015–August, 128–135.
View | Download Submitted Version (ext.)
 
[258]
2015 | Conference Paper | IST-REx-ID: 1567
Edelsbrunner H. 2015. Shape, homology, persistence, and stability. 9411.
View
 
[257]
2015 | Conference Paper | IST-REx-ID: 1568
Dunaeva O, Edelsbrunner H, Lukyanov A, Machin M, Malkova D. 2015. The classification of endoscopy images with persistent homology. Proceedings - 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. SYNASC: Symbolic and Numeric Algorithms for Scientific Computing, 7034731.
View | Files available | DOI
 
[256]
2015 | Journal Article | IST-REx-ID: 1578
Cao T, Edelsbrunner H, Tan T. 2015. Triangulations from topologically correct digital Voronoi diagrams. Computational Geometry. 48(7), 507–519.
View | DOI
 
[255]
2015 | Journal Article | IST-REx-ID: 1793 | OA
Symonova O, Topp C, Edelsbrunner H. 2015. DynamicRoots: A software platform for the reconstruction and analysis of growing plant roots. PLoS One. 10(6), e0127657.
View | Files available | DOI
 
[254]
2015 | Research Data Reference | IST-REx-ID: 9737
Symonova O, Topp C, Edelsbrunner H. 2015. Root traits computed by DynamicRoots for the maize root shown in fig 2, Public Library of Science, 10.1371/journal.pone.0127657.s001.
View | Files available | DOI
 
[253]
2014 | Conference Paper | IST-REx-ID: 2905 | OA
Edelsbrunner H, Morozovy D. 2014. Persistent homology: Theory and practice. ECM: European Congress of Mathematics, 31–50.
View | Files available | DOI
 
[252]
2014 | Journal Article | IST-REx-ID: 1876 | OA
Dolbilin N, Edelsbrunner H, Glazyrin A, Musin O. 2014. Functionals on triangulations of delaunay sets. Moscow Mathematical Journal. 14(3), 491–504.
View | Download Submitted Version (ext.)
 
[251]
2014 | Journal Article | IST-REx-ID: 1929
Alexeev VV, Bogaevskaya VG, Preobrazhenskaya MM, Ukhalov AY, Edelsbrunner H, Yakimova O. 2014. An algorithm for cartographic generalization that preserves global topology. Journal of Mathematical Sciences (United States). 203(6), 754–760.
View | DOI
 
[250]
2014 | Conference Paper | IST-REx-ID: 2155 | OA
Bauer U, Edelsbrunner H. 2014. The morse theory of Čech and Delaunay filtrations. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 484–490.
View | DOI | Download Submitted Version (ext.)
 
[249]
2014 | Conference Paper | IST-REx-ID: 2177
Edelsbrunner H, Parsa S. 2014. On the computational complexity of betti numbers reductions from matrix rank. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 152–160.
View | DOI
 
[248]
2014 | Journal Article | IST-REx-ID: 2255 | OA
Edelsbrunner H, Pausinger F. 2014. Stable length estimates of tube-like shapes. Journal of Mathematical Imaging and Vision. 50(1), 164–177.
View | Files available | DOI
 
[247]
2013 | Journal Article | IST-REx-ID: 2815
Edelsbrunner H, Fasy BT, Rote G. 2013. Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. Discrete & Computational Geometry. 49(4), 797–822.
View | Files available | DOI
 
[246]
2013 | Journal Article | IST-REx-ID: 2822 | OA
Topp C, Iyer Pascuzzi A, Anderson J, Lee C, Zurek P, Symonova O, Zheng Y, Bucksch A, Mileyko Y, Galkovskyi T, Moore B, Harer J, Edelsbrunner H, Mitchell Olds T, Weitz J, Benfey P. 2013. 3D phenotyping and quantitative trait locus mapping identify core regions of the rice genome controlling root architecture. PNAS. 110(18), E1695–E1704.
View | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 
[245]
2013 | Conference Paper | IST-REx-ID: 2843
Edelsbrunner H, Pausinger F. 2013. Stable length estimates of tube-like shapes. 17th IAPR International Conference on Discrete Geometry for Computer Imagery. DGCI: Discrete Geometry for Computer Imagery, LNCS, vol. 7749, XV–XIX.
View | Files available | DOI
 
[244]
2013 | Journal Article | IST-REx-ID: 2859 | OA
Bendich P, Edelsbrunner H, Morozov D, Patel A. 2013. Homology and robustness of level and interlevel sets. Homology, Homotopy and Applications. 15(1), 51–72.
View | DOI | Download Preprint (ext.) | arXiv
 
[243]
2013 | Journal Article | IST-REx-ID: 2887 | OA
Fang S, Clark R, Zheng Y, Iyer Pascuzzi A, Weitz J, Kochian L, Edelsbrunner H, Liao H, Benfey P. 2013. Genotypic recognition and spatial responses by rice roots. PNAS. 110(7), 2670–2675.
View | DOI | Download Published Version (ext.) | PubMed | Europe PMC
 
[242]
2013 | Conference Paper | IST-REx-ID: 2906 | OA
Kerber M, Edelsbrunner H. 2013. 3D kinetic alpha complexes and their implementation. 2013 Proceedings of the 15th Workshop on Algorithm Engineering and Experiments. ALENEX: Algorithm Engineering and Experiments, ALENEX, , 70–77.
View | Files available | DOI
 
[241]
2012 | Journal Article | IST-REx-ID: 2849 | OA
Edelsbrunner H, Strelkova N. 2012. On the configuration space of Steiner minimal trees. Russian Mathematical Surveys. 67(6), 1167–1168.
View | Files available | DOI
 
[240]
2012 | Journal Article | IST-REx-ID: 2902
Edelsbrunner H, Musin O, Ukhalov A, Yakimova O, Alexeev V, Bogaevskaya V, Gorohov A, Preobrazhenskaya M. 2012. Fractal and computational geometry for generalizing cartographic objects. Modeling and Analysis of Information Systems. 19(6), 152–160.
View | Download None (ext.)
 
[239]
2012 | Conference Paper | IST-REx-ID: 2903 | OA
Edelsbrunner H, Symonova O. 2012. The adaptive topology of a digital image. ISVD: International Symposium on Voronoi Diagrams in Science and Engineering, 41–48.
View | Files available | DOI
 
[238]
2012 | Journal Article | IST-REx-ID: 2911
Edelsbrunner H, Ivanov A, Karasev R. 2012. Open problems in discrete and computational geometry. Automatic Control and Computer Sciences. in print.
View
 
[237]
2012 | Journal Article | IST-REx-ID: 2912
Edelsbrunner H, Strelkova N. 2012. Configuration space for shortest networks . Uspekhi Mat. Nauk. 67(6), 203–204.
View | DOI
 
[236]
2012 | Journal Article | IST-REx-ID: 2941 | OA
Dolbilin N, Edelsbrunner H, Musin O. 2012. On the optimality of functionals over triangulations of Delaunay sets. Russian Mathematical Surveys. 67(4), 781–783.
View | Files available | DOI
 
[235]
2012 | Conference Paper | IST-REx-ID: 3133 | OA
Edelsbrunner H, Kerber M. 2012. Alexander duality for functions: The persistent behavior of land and water and shore. Proceedings of the twenty-eighth annual symposium on Computational geometry . SCG: Symposium on Computational Geometry, 249–258.
View | DOI | Download Preprint (ext.)
 
[234]
2012 | Conference Paper | IST-REx-ID: 3134
Edelsbrunner H, Fasy B, Rote G. 2012. 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 . SCG: Symposium on Computational Geometry, 91–100.
View | Files available | DOI
 
[233]
2012 | Journal Article | IST-REx-ID: 3159 | OA
Mileyko Y, Edelsbrunner H, Price C, Weitz J. 2012. Hierarchical ordering of reticular networks. PLoS One. 7(6), e36715.
View | Files available | DOI
 
[232]
2012 | Journal Article | IST-REx-ID: 3256 | OA
Edelsbrunner H, Kerber M. 2012. Dual complexes of cubical subdivisions of ℝn. Discrete & Computational Geometry. 47(2), 393–414.
View | Files available | DOI
 
[231]
2012 | Journal Article | IST-REx-ID: 3310 | OA
Bendich P, Cabello S, Edelsbrunner H. 2012. A point calculus for interlevel set homology. Pattern Recognition Letters. 33(11), 1436–1444.
View | Files available | DOI
 
[230]
2011 | Book Chapter | IST-REx-ID: 3796 | OA
Edelsbrunner H, Kerber M. 2011.Covering and packing with spheres by diagonal distortion in R^n. In: Rainbow of Computer Science. LNCS, vol. 6570, 20–35.
View | Files available | DOI
 
[229]
2011 | Journal Article | IST-REx-ID: 3965
Wang B, Edelsbrunner H, Morozov D. 2011. Computing elevation maxima by searching the Gauss sphere. Journal of Experimental Algorithmics. 16(2.2), 1–13.
View | DOI
 
[228]
2011 | Book Chapter | IST-REx-ID: 3311
Edelsbrunner H. 2011.Alpha shapes - a survey. In: Tessellations in the Sciences. .
View
 
[227]
2011 | Conference Poster | IST-REx-ID: 3312 | OA
Zheng Y, Gu S, Edelsbrunner H, Tomasi C, Benfey P. 2011. Detailed reconstruction of 3D plant root shape, IEEE,p.
View | Files available | DOI
 
[226]
2011 | Conference Paper | IST-REx-ID: 3313 | OA
Chen C, Edelsbrunner H. 2011. Diffusion runs low on persistence fast. Proceedings of the IEEE International Conference on Computer Vision. ICCV: International Conference on Computer Vision, 6126271.
View | Files available | DOI
 
[225]
2011 | Journal Article | IST-REx-ID: 3334
Edelsbrunner H, Pach J, Ziegler G. 2011. Letter from the new editors-in-chief. Discrete & Computational Geometry. 45(1), 1–2.
View | DOI
 
[224]
2011 | Book Chapter | IST-REx-ID: 3335 | OA
Van De Weygaert R, Vegter G, Edelsbrunner H, Jones B, Pranav P, Park C, Hellwing W, Eldering B, Kruithof N, Bos P, Hidding J, Feldbrugge J, Ten Have E, Van Engelen M, Caroli M, Teillaud M. 2011.Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web. In: Transactions on Computational Science XIV. LNCS, vol. 6970, 60–101.
View | DOI | Download Preprint (ext.) | arXiv
 
[223]
2011 | Journal Article | IST-REx-ID: 3377 | OA
Edelsbrunner H, Morozov D, Patel A. 2011. Quantifying transversality by measuring the robustness of intersections. Foundations of Computational Mathematics. 11(3), 345–361.
View | DOI | Download Submitted Version (ext.)
 
[222]
2010 | Book Chapter | IST-REx-ID: 3795 | OA
Edelsbrunner H, Morozov D, Patel A. 2010.The stability of the apparent contour of an orientable 2-manifold. In: Topological Data Analysis and Visualization: Theory, Algorithms and Applications. Mathematics and Visualization, , 27–42.
View | Files available | DOI
 
[221]
2010 | Conference Paper | IST-REx-ID: 3848
Bendich P, Edelsbrunner H, Morozov D, Patel A. 2010. The robustness of level sets. ESA: European Symposium on Algorithms, LNCS, vol. 6346, 1–10.
View | DOI
 
[220]
2010 | Conference Paper | IST-REx-ID: 3849 | OA
Bendich P, Edelsbrunner H, Kerber M, Patel A. 2010. Persistent homology under non-uniform error. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 12–23.
View | Files available | DOI
 
[219]
2010 | Conference Paper | IST-REx-ID: 3853 | OA
Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. 2010. Mean-payoff automaton expressions. CONCUR: Concurrency Theory, LNCS, vol. 6269, 269–283.
View | Files available | DOI
 
[218]
2010 | Book | IST-REx-ID: 3899
Edelsbrunner H, Harer J. 2010. Computational Topology: An Introduction, American Mathematical Society,p.
View | Files available
 
[217]
2010 | Journal Article | IST-REx-ID: 3901 | OA
Bendich P, Edelsbrunner H, Kerber M. 2010. Computing robustness and persistence for images. IEEE Transactions of Visualization and Computer Graphics. 16(6), 1251–1260.
View | Files available | DOI
 
[216]
2010 | Journal Article | IST-REx-ID: 3964
Cohen Steiner D, Edelsbrunner H, Harer J, Mileyko Y. 2010. Lipschitz functions have L_p-stable persistence. Foundations of Computational Mathematics. 10(2), 127–139.
View | DOI
 
[215]
2009 | Journal Article | IST-REx-ID: 3966
Cohen Steiner D, Edelsbrunner H, Harer J. 2009. Extending persistence using Poincare and Lefschetz duality. Foundations of Computational Mathematics. 9(1), 79–103.
View | DOI
 
[214]
2009 | Conference Paper | IST-REx-ID: 3967
Cohen Steiner D, Edelsbrunner H, Harer J, Morozov D. 2009. Persistent homology for kernels, images, and cokernels. SODA: Symposium on Discrete Algorithms, 1011–1020.
View
 
[213]
2009 | Conference Paper | IST-REx-ID: 3968 | OA
Edelsbrunner H, Harer J. 2009. The persistent Morse complex segmentation of a 3-manifold. 3DPH: Modelling the Physiological Human, LNCS, vol. 5903, 36–50.
View | Files available | DOI
 
[212]
2009 | Book Chapter | IST-REx-ID: 3578
Attali D, Boissonnat J, Edelsbrunner H. 2009.Stability and computation of medial axes: a state-of-the-art report. In: Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration. Mathematics and Visualization, , 109–125.
View | DOI | Download (ext.)
 
[211]
2008 | Book Chapter | IST-REx-ID: 3969
Edelsbrunner H, Harer J. 2008.Persistent homology - a survey. In: Surveys on Discrete and Computational Geometry: Twenty Years Later. Contemporary Mathematics, , 257–282.
View
 
[210]
2008 | Journal Article | IST-REx-ID: 3970
Dequéant M, Ahnert S, Edelsbrunner H, Fink T, Glynn E, Hattem G, Kudlicki A, Mileyko Y, Morton J, Mushegian A, Pachter L, Rowicka M, Shiu A, Sturmfels B, Pourquie O. 2008. Comparison of pattern detection methods in microarray time series of the segmentation clock. PLoS One. 3(8).
View | DOI
 
[209]
2008 | Journal Article | IST-REx-ID: 3971
Edelsbrunner H, Harer J, Mascarenhas A, Pascucci V, Snoeyink J. 2008. Time-varying Reeb graphs for continuous space-time data. Computational Geometry: Theory and Applications. 41(3), 149–166.
View | DOI
 
[208]
2008 | Conference Paper | IST-REx-ID: 3974
Edelsbrunner H, Harer J, Patel A. 2008. Reeb spaces of piecewise linear mappings. SCG: Symposium on Computational Geometry, 242–250.
View | DOI
 
[207]
2008 | Book Chapter | IST-REx-ID: 3577
Biasotti S, Attali D, Boissonnat J, Edelsbrunner H, Elber G, Mortara M, Sanniti Di Baja G, Spagnuolo M, Tanase M, Veltkam R. 2008.Skeletal structures. In: Shape Analysis and Structuring. Mathematics and Visualization, , 145–183.
View | DOI
 
[206]
2007 | Journal Article | IST-REx-ID: 3972
Cohen Steiner D, Edelsbrunner H, Harer J. 2007. Stability of persistence diagrams. Discrete & Computational Geometry. 37(1), 103–120.
View | DOI
 
[205]
2007 | Journal Article | IST-REx-ID: 3973
Cohen Steiner D, Edelsbrunner H. 2007. Inequalities for the curvature of curves and surfaces. Foundations of Computational Mathematics. 7(4), 391–404.
View | DOI
 
[204]
2007 | Conference Paper | IST-REx-ID: 3975
Bendich P, Cohen Steiner D, Edelsbrunner H, Harer J, Morozov D. 2007. Inferring local homology from sampled stratified spaces. FOCS: Foundations of Computer Science, 536–546.
View | DOI
 
[203]
2007 | Journal Article | IST-REx-ID: 3976
Headd J, Ban YEA, Brown P, Edelsbrunner H, Vaidya M, Rudolph J. 2007. Protein-protein interfaces: Properties, preferences, and projections. Journal of Proteome Research. 6(7), 2576–2586.
View | DOI
 
[202]
2007 | Journal Article | IST-REx-ID: 3977
Attali D, Edelsbrunner H. 2007. Inclusion-exclusion formulas from independent complexes. Discrete & Computational Geometry. 37(1), 59–77.
View | DOI
 
[201]
2007 | Conference Paper | IST-REx-ID: 3981
Attali D, Edelsbrunner H, Harer J, Mileyko Y. 2007. Alpha-beta witness complexes. WADS: International Workshop on Algrithms and Data Structures, LNCS, vol. 4619, 386–397.
View | DOI
 
[200]
2007 | Conference Paper | IST-REx-ID: 3561 | OA
Attali D, Edelsbrunner H, Mileyko Y. 2007. Weak witnesses for Delaunay triangulations of submanifolds. SPM: Symposium on Solid and Physical Modeling, 143–150.
View | DOI | Download (ext.)
 
[199]
2006 | Journal Article | IST-REx-ID: 3978
Ban Y, Rudolph J, Zhou P, Edelsbrunner H. 2006. Evaluating the quality of NMR structures by local density of protons. Proteins: Structure, Function and Bioinformatics. 62(4), 852–864.
View | DOI
 
[198]
2006 | Journal Article | IST-REx-ID: 3979
Ban Y, Edelsbrunner H, Rudolph J. 2006. Interface surfaces for protein-protein complexes. Journal of the ACM. 53(3), 361–378.
View | DOI
 
[197]
2006 | Journal Article | IST-REx-ID: 3980
Agarwal P, Edelsbrunner H, Harer J, Wang Y. 2006. Extreme elevation on a 2-manifold. Discrete & Computational Geometry. 36(4), 553–572.
View | DOI
 
[196]
2006 | Patent | IST-REx-ID: 3510
Edelsbrunner H, Fu P, Nekhayev D, Facello M, Williams S. 2006. Method, apparatus and computer program products for automatically generating NURBS models of triangulated surfaces using homeomorphism.
View | DOI | Download (ext.)
 
[195]
2006 | Patent | IST-REx-ID: 3511
Fu P, Nekhayev D, Edelsbrunner H. 2006. Manufacturing methods and systems for rapid production of hearing-aid shells.
View | DOI | Download (ext.)
 
[194]
2006 | Patent | IST-REx-ID: 3512
Fletcher Y, Gloth T, Edelsbrunner H, Fu P. 2006. Method, apparatus and computer products that reconstruct surfaces from data points.
View | DOI | Download (ext.)
 
[193]
2006 | Conference Paper | IST-REx-ID: 3559
Cohen Steiner D, Edelsbrunner H, Morozov D. 2006. Vines and vineyards by updating persistence in linear time. SCG: Symposium on Computational Geometry, 119–126.
View | DOI
 
[192]
2006 | Conference Paper | IST-REx-ID: 3560
Edelsbrunner H, Morozov D, Pascucci V. 2006. Persistence-sensitive simplification of functions on 2-manifolds. SCG: Symposium on Computational Geometry, 127–134.
View | DOI | Download (ext.)
 
[191]
2005 | Conference Paper | IST-REx-ID: 3982
Wang Y, Agarwal P, Brown P, Edelsbrunner H, Rudolph J. 2005. Coarse and reliable geometric alignment for protein docking. PSB: Pacific Symposium on Biocomputing, 64–75.
View | DOI
 
[190]
2005 | Journal Article | IST-REx-ID: 3983
Sohn J, Parks J, Buhrman G, Brown P, Kristjánsdóttir K, Safi A, Edelsbrunner H, Yang W, Rudolph J. 2005. Experimental validation of the docking orientation of Cdc25 with its Cdk2-CycA protein substrate. Biochemistry. 44(50), 16563–16573.
View | DOI
 
[189]
2005 | Patent | IST-REx-ID: 3509
Williams S, Edelsbrunner H, Fu P. 2005. Methods, apparatus and computer program products for modeling three-dimensional colored objects.
View | DOI | Download (ext.)
 
[188]
2005 | Conference Paper | IST-REx-ID: 3557
Edelsbrunner H. 2005. Surface tiling with differential topology. SGP: Eurographics Symposium on Geometry processing, 9–11.
View | DOI | Download (ext.)
 
[187]
2005 | Conference Paper | IST-REx-ID: 3558
Attali D, Cohen Steiner D, Edelsbrunner H. 2005. Extraction and simplification of iso-surfaces in tandem. SGP: Eurographics Symposium on Geometry processing, 139–148.
View | Download (ext.)
 
[186]
2005 | Book Chapter | IST-REx-ID: 3576
Edelsbrunner H, Koehl P. 2005.The geometry of biomolecular solvation. In: Combinatorial and Computational Geometry. Mathematical Sciences Research Institute Publications, vol. 52, 243–275.
View | Download (ext.)
 
[185]
2004 | Journal Article | IST-REx-ID: 3984
Bremer P, Edelsbrunner H, Hamann B, Pascucci V. 2004. A topological hierarchy for functions on triangulated surfaces. IEEE Transactions on Visualization and Computer Graphics. 10(4), 385–396.
View | DOI
 
[184]
2004 | Journal Article | IST-REx-ID: 3985
Cole Mclaughlin K, Edelsbrunner H, Harer J, Natarajan V, Pascucci V. 2004. Loops in Reeb graphs of 2-manifolds. Discrete & Computational Geometry. 32(2), 231–244.
View | DOI
 
[183]
2004 | Journal Article | IST-REx-ID: 3986
Bryant R, Edelsbrunner H, Koehl P, Levitt M. 2004. The area derivative of a space-filling diagram. Discrete & Computational Geometry. 32(3), 293–308.
View | DOI
 
[182]
2004 | Journal Article | IST-REx-ID: 3987
Natarajan V, Edelsbrunner H. 2004. Simplification of three-dimensional density maps. IEEE Transactions on Visualization and Computer Graphics. 10(5), 587–597.
View | DOI
 
[181]
2004 | Conference Paper | IST-REx-ID: 3988
Choi V, Agarwal P, Edelsbrunner H, Rudolph J. 2004. Local search heuristic for rigid protein docking. WABI: 4th International Workshop on Algorithms in Bioinformatics, LNCS, vol. 3240, 218–229.
View | DOI
 
[180]
2004 | Conference Paper | IST-REx-ID: 3989
Edelsbrunner H, Harer J, Natarajan V, Pascucci V. 2004. Local and global comparison of continuous functions. VIS: IEEE Visualization, 275–280.
View | DOI
 
[179]
2004 | Journal Article | IST-REx-ID: 3990
Agarwal P, Edelsbrunner H, Wang Y. 2004. Computing the writhing number of a polygonal knot. Discrete & Computational Geometry. 32(1), 37–53.
View | DOI
 
[178]
2004 | Book Chapter | IST-REx-ID: 3574
Edelsbrunner H. 2004.Biological applications of computational topology. In: Handbook of Discrete and Computational Geometry. , 1395–1412.
View | Download (ext.)
 
[177]
2004 | Book Chapter | IST-REx-ID: 3575
Edelsbrunner H, Harer J. 2004.Jacobi sets of multiple Morse functions. In: Foundations of Computational Mathematics. London Mathematical Society Lecture Note, vol. 312, 37–57.
View | DOI
 
[176]
2003 | Book Chapter | IST-REx-ID: 3991
Cheng H, Edelsbrunner H. 2003.Area and perimeter derivatives of a union of disks. In: Computer Science in Perspective: Essays Dedicated to Thomas Ottmann. LNCS, vol. 2598, 88–97.
View | DOI
 
[175]
2003 | Journal Article | IST-REx-ID: 3992
Edelsbrunner H, Koehl P. 2003. The weighted-volume derivative of a space-filling diagram. PNAS. 100(5), 2203–2208.
View | DOI
 
[174]
2003 | Journal Article | IST-REx-ID: 3993
Edelsbrunner H, Harer J, Zomorodian A. 2003. Hierarchical Morse-Smale complexes for piecewise linear 2-manifolds. Discrete & Computational Geometry. 30(1), 87–107.
View | DOI
 
[173]
2003 | Journal Article | IST-REx-ID: 3994
Cheng H, Edelsbrunner H. 2003. Area, perimeter and derivatives of a skin curve. Computational Geometry: Theory and Applications. 26(2), 173–192.
View | DOI
 
[172]
2003 | Conference Paper | IST-REx-ID: 3997
Bremer P, Edelsbrunner H, Hamann B, Pascucci V. 2003. A multi-resolution data structure for two-dimensional Morse-Smale functions. VIS: IEEE Visualization, 139–146.
View | DOI
 
[171]
2003 | Conference Paper | IST-REx-ID: 3999
Edelsbrunner H, Üngör A. 2003. Relaxed scheduling in dynamic skin triangulation. JCDCG: Japanese Conference on Discrete and Computational Geometry, LNCS, vol. 2866, 135–151.
View | DOI
 
[170]
2003 | Conference Paper | IST-REx-ID: 3556
Edelsbrunner H, Harer J, Natarajan V, Pascucci V. 2003. Morse-Smale complexes for piecewise linear 3-manifolds. SCG: Symposium on Computational Geometry, 361–370.
View | DOI | Download (ext.)
 
[169]
2003 | Book Chapter | IST-REx-ID: 3573
Edelsbrunner H. 2003.Surface reconstruction by wrapping finite sets in space. In: Discrete & Computational Geometry. , 379–404.
View | DOI | Download (ext.)
 
[168]
2003 | Journal Article | IST-REx-ID: 3584
Edelsbrunner H, Zomorodian A. 2003. Computing linking numbers of a filtration. Homology, Homotopy and Applications. 5(2), 19–37.
View | Download None (ext.)
 
[167]
2002 | Journal Article | IST-REx-ID: 3995
Agarwal P, Guibas L, Edelsbrunner H, Erickson J, Isard M, Har Peled S, Hershberger J, Jensen C, Kavraki L, Koehl P, Lin M, Manocha D, Metaxas D, Mirtich B, Mount D, Muthukrishnan S, Pai D, Sacks E, Snoeyink J, Suri S, Wolefson O. 2002. Algorithmic issues in modeling motion. ACM Computing Surveys. 34(4), 550–572.
View | DOI
 
[166]
2002 | Journal Article | IST-REx-ID: 3996
Edelsbrunner H, Letscher D, Zomorodian A. 2002. Topological persistence and simplification. Discrete & Computational Geometry. 28(4), 511–533.
View | DOI
 
[165]
2002 | Journal Article | IST-REx-ID: 3998
Edelsbrunner H, Guoy D. 2002. An experimental study of sliver exudation. Engineering with Computers. 18(3), 229–240.
View | DOI
 
[164]
2002 | Journal Article | IST-REx-ID: 4000
Zomorodian A, Edelsbrunner H. 2002. Fast software for box intersections. International Journal of Computational Geometry and Applications. 12(1–2), 143–172.
View | DOI
 
[163]
2002 | Conference Paper | IST-REx-ID: 4003
Agarwal P, Edelsbrunner H, Wang Y. 2002. Computing the writhing number of a polygonal knot. SODA: Symposium on Discrete Algorithms, 791–799.
View
 
[162]
2002 | Patent | IST-REx-ID: 3508
Edelsbrunner H, Fu P. 2002. Methods of generating three-dimensional digital models of objects by wrapping point cloud data points.
View | DOI | Download (ext.)
 
[161]
2001 | Journal Article | IST-REx-ID: 4001
Cheng H, Edelsbrunner H, Fu P. 2001. Shape space from deformation. Computational Geometry: Theory and Applications. 19(2–3), 191–204.
View | DOI
 
[160]
2001 | Journal Article | IST-REx-ID: 4002
Cheng S, Edelsbrunner H, Fu P, Lam K. 2001. Design and analysis of planar shape deformation. Computational Geometry: Theory and Applications. 19(2–3), 205–218.
View | DOI
 
[159]
2001 | Conference Paper | IST-REx-ID: 4005
Cheng H, Dey T, Edelsbrunner H, Sullivan J. 2001. Dynamic skin triangulation. SODA: Symposium on Discrete Algorithms, 47–56.
View
 
[158]
2001 | Journal Article | IST-REx-ID: 4006
Edelsbrunner H. 2001. 180 wrapped tubes. Journal of Universal Computer Science. 7(5), 379–399.
View | DOI
 
[157]
2001 | Journal Article | IST-REx-ID: 4007
Cheng H, Dey T, Edelsbrunner H, Sullivan J. 2001. Dynamic skin triangulation. Discrete & Computational Geometry. 25(4), 525–568.
View | DOI
 
[156]
2001 | Patent | IST-REx-ID: 3507
Liang J, Edelsbrunner H. 2001. Molecular classification for property prediction.
View | DOI | Download (ext.)
 
[155]
2001 | Book | IST-REx-ID: 3586
Edelsbrunner H. 2001. Geometry and Topology for Mesh Generation, Cambridge University Press, 190p.
View | Files available | DOI
 
[154]
2000 | Journal Article | IST-REx-ID: 4004
Edelsbrunner H, Grayson D. 2000. Edgewise subdivision of a simplex. Discrete & Computational Geometry. 24(4), 707–719.
View | DOI
 
[153]
2000 | Conference Paper | IST-REx-ID: 4008
Edelsbrunner H, Letscher D, Zomorodian A. 2000. Topological persistance and simplification. FOCS: Foundations of Computer Science, 454–463.
View | DOI
 
[152]
2000 | Journal Article | IST-REx-ID: 4009
Edelsbrunner H, Waupotitsch R. 2000. Adaptive simplicial grids from cross-sections of monotone complexes. International Journal of Computational Geometry and Applications. 10(3), 267–284.
View | DOI
 
[151]
2000 | Journal Article | IST-REx-ID: 4010
Cheng S, Dey T, Edelsbrunner H, Facello M, Teng S. 2000. Sliver exudation. Journal of the ACM. 47(5), 883–904.
View | DOI
 
[150]
2000 | Conference Paper | IST-REx-ID: 3555
Edelsbrunner H, Li X, Miller G, Stathopoulos A, Talmor D, Teng S, Üngör A, Walkington N. 2000. Smoothing and cleaning up slivers. STOC: Symposium on the Theory of Computing, 273–277.
View | DOI | Download (ext.)
 
[149]
2000 | Book Chapter | IST-REx-ID: 3572
Edelsbrunner H. 2000.Spielereien mit Kreisen und Kugeln. Zum Thema Form und Verformung. In: Zur Kunst des formalen Denkens. , 153–171.
View | Download (ext.)
 
[148]
2000 | Journal Article | IST-REx-ID: 3583
Edelsbrunner H. 2000. Triangulations and meshes in computational geometry. Acta Numerica. 9, 133–213.
View | Download (ext.)
 
[147]
1999 | Journal Article | IST-REx-ID: 4014
Edelsbrunner H. 1999. Deformable smooth surface design. Discrete & Computational Geometry. 21(1), 87–115.
View | DOI
 
[146]
1999 | Conference Paper | IST-REx-ID: 3554
Jiao X, Edelsbrunner H, Heath M. 1999. Mesh association: formulation and algorithms. IMR: International Meshing Roundtable, 75–82.
View | Download (ext.)
 
[145]
1999 | Book Chapter | IST-REx-ID: 3571
Dey T, Edelsbrunner H, Guha S. 1999.Computational topology. In: Advances in Discrete and Computational Geometry. Contemporary Mathematics, vol. 223, 109–143.
View | Download (ext.)
 
[144]
1999 | Journal Article | IST-REx-ID: 3582
Dey T, Edelsbrunner H, Guha S, Nekhayev D. 1999. Topology preserving edge contraction. Publications de l’Institut Mathématique. 66, 23–45.
View | Download (ext.)
 
[143]
1998 | Journal Article | IST-REx-ID: 4011
Liang J, Edelsbrunner H, Fu P, Sudhakar P, Subramaniam S. 1998. Analytical shape computation of macromolecules: I. molecular area and volume through alpha shape. Proteins: Structure, Function and Bioinformatics. 33(1), 1–17.
View | DOI
 
[142]
1998 | Journal Article | IST-REx-ID: 4012
Liang J, Edelsbrunner H, Fu P, Sudhakar P, Subramaniam S. 1998. Analytical shape computation of macromolecules: II. Inaccessible cavities in proteins. Proteins: Structure, Function and Bioinformatics. 33(1), 18–29.
View | DOI
 
[141]
1998 | Journal Article | IST-REx-ID: 4013
Edelsbrunner H, Facello M, Liang J. 1998. On the definition and the construction of pockets in macromolecules. Discrete Applied Mathematics. 88(1–3), 83–102.
View | DOI
 
[140]
1998 | Conference Paper | IST-REx-ID: 4015
Edelsbrunner H. 1998. Shape reconstruction with Delaunay complex. LATIN: Latin American Symposium on Theoretical Informatics , LNCS, vol. 1380, 119–132.
View | DOI
 
[139]
1998 | Conference Paper | IST-REx-ID: 4016
Edelsbrunner H, Facello M, Fu P, Qian J, Nekhayev D. 1998. Wrapping 3D scanning data. Three-Dimensional Image Capture and Applications, SPIE, vol. 3313, 148–158.
View | DOI
 
[138]
1998 | Journal Article | IST-REx-ID: 4017 | OA
Liang J, Edelsbrunner H, Woodward C. 1998. Anatomy of protein pockets and cavities: Measurement of binding site geometry and implications for ligand design. Protein Science. 7(9), 1884–1897.
View | DOI | Download (ext.)
 
[137]
1998 | Conference Paper | IST-REx-ID: 4019
Cheng H, Edelsbrunner H, Fu P. 1998. Shape space from deformation. CGA: Conference on Computer Graphics and Applications , 104–113.
View | DOI
 
[136]
1998 | Book Chapter | IST-REx-ID: 4020
Edelsbrunner H. 1998.Geometry for modeling biomolecules. In: Robotics: The Algorithmic Perspective. , 265–277.
View
 
[135]
1998 | Patent | IST-REx-ID: 3506
Edelsbrunner H, Fu P. 1998. Apparatus and method for geometric morphing.
View | DOI | Download (ext.)
 
[134]
1998 | Book Chapter | IST-REx-ID: 3570
Axen U, Edelsbrunner H. 1998.Auditory Morse analysis of triangulated manifolds. In: Mathematical Visualization. , 223–236.
View | DOI
 
[133]
1997 | Journal Article | IST-REx-ID: 4018
Edelsbrunner H, Shah N. 1997. Triangulating topological spaces. International Journal of Computational Geometry and Applications. 7(4), 365–378.
View | DOI
 
[132]
1997 | Journal Article | IST-REx-ID: 4021
Edelsbrunner H, Waupotitsch R. 1997. A combinatorial approach to cartograms. Computational Geometry: Theory and Applications. 7(5–6), 343–360.
View | DOI
 
[131]
1997 | Journal Article | IST-REx-ID: 4022
Edelsbrunner H, Valtr P, Welzl E. 1997. Cutting dense point sets in half. Discrete & Computational Geometry. 17(3), 243–255.
View | DOI
 
[130]
1997 | Journal Article | IST-REx-ID: 4023
Edelsbrunner H, Ramos E. 1997. Inclusion-exclusion complexes for pseudodisk collections. Discrete & Computational Geometry. 17(3), 287–306.
View | DOI
 
[129]
1996 | Journal Article | IST-REx-ID: 4024
Akkiraju N, Edelsbrunner H, Fu P, Qian J. 1996. Viewing geometric protein structures from inside a CAVE. IEEE Computer Graphics and Applications. 16(4), 58–61.
View | DOI
 
[128]
1996 | Journal Article | IST-REx-ID: 4025
Akkiraju N, Edelsbrunner H. 1996. Triangulating the surface of a molecule. Discrete Applied Mathematics. 71(1–3), 5–22.
View | DOI
 
[127]
1996 | Journal Article | IST-REx-ID: 4026
Edelsbrunner H, Shah N. 1996. Incremental topological flipping works for regular triangulations. Algorithmica. 15(3), 223–241.
View | DOI
 
[126]
1996 | Journal Article | IST-REx-ID: 4027
Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Stolfi J. 1996. Lines in space: Combinatorics and algorithms. Algorithmica. 15(5), 428–447.
View | DOI
 
[125]
1996 | Conference Poster | IST-REx-ID: 4030
Liang J, Edelsbrunner H, Subramaniam S. 1996. Effects of molecular shape representations on boundary element method for protein electrostatics computations, Cell Press,p.
View | DOI
 
[124]
1996 | Conference Poster | IST-REx-ID: 4031
Liang J, Edelsbrunner H, Pamidghantam S, Subramaniam S. 1996. Analytical method for molecular shapes: Area, volume, cavities, interface and pockets, Cell Press,p.
View | DOI
 
[123]
1996 | Conference Paper | IST-REx-ID: 3553
Edelsbrunner H, Fu P, Quian J. 1996. Geometric modeling in CAVE. VRST: Symposium on Virtual Reality Software and Technology, 35-41 and-193–194.
View | Download (ext.)
 
[122]
1995 | Journal Article | IST-REx-ID: 4028
Edelsbrunner H. 1995. The union of balls and its dual shape. Discrete & Computational Geometry. 13(1), 415–440.
View | DOI
 
[121]
1995 | Journal Article | IST-REx-ID: 4029
Delfinado C, Edelsbrunner H. 1995. An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere. Computer Aided Geometric Design. 12(7), 771–784.
View | DOI
 
[120]
1995 | Conference Paper | IST-REx-ID: 4034
Edelsbrunner H. 1995. Algebraic decomposition of non-convex polyhedra. FOCS: Foundations of Computer Science, 248–257.
View
 
[119]
1995 | Journal Article | IST-REx-ID: 4035
Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Sharir M, Welzl E. 1995. Improved bounds on weak ε-nets for convex sets. Discrete & Computational Geometry. 13(1), 1–15.
View | DOI
 
[118]
1995 | Conference Paper | IST-REx-ID: 3551
Edelsbrunner H, Facello M, Fu P, Liang J. 1995. Measuring proteins and voids in proteins. HICSS: Hawaii International Conference on System Sciences, 256–264.
View | DOI
 
[117]
1995 | Conference Paper | IST-REx-ID: 3552
Akkiraju N, Edelsbrunner H, Facello M, Fu P, Mücke E, Varela C. 1995. Alpha shapes: definition and software. GCG: International Computational Geometry Software Workshop, 63–66.
View | Download (ext.)
 
[116]
1994 | Journal Article | IST-REx-ID: 4032
Dey T, Edelsbrunner H. 1994. Counting triangle crossings and halving planes. Discrete & Computational Geometry. 12(1), 281–289.
View | DOI
 
[115]
1994 | Journal Article | IST-REx-ID: 4033
Chazelle B, Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M. 1994. Selecting heavily covered points. SIAM Journal on Computing. 23(6), 1138–1151.
View | DOI
 
[114]
1994 | Journal Article | IST-REx-ID: 4037
Edelsbrunner H, Mücke E. 1994. Three-dimensional alpha shapes. ACM Transactions on Graphics. 13(1), 43–72.
View | DOI
 
[113]
1994 | Journal Article | IST-REx-ID: 4038
Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1994. Algorithms for bichromatic line-segment problems and polyhedral terrains. Algorithmica. 11(2), 116–132.
View | DOI
 
[112]
1994 | Journal Article | IST-REx-ID: 4039
Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Hershberger J, Sharir M, Snoeyink J. 1994. Ray shooting in polygons using geodesic triangulations. Algorithmica. 12(1), 54–68.
View | DOI
 
[111]
1994 | Conference Paper | IST-REx-ID: 3550
Edelsbrunner H. 1994. Modeling with simplicial complexes (topology, geometry and algorithms). CCCG: Canadian Conference on Computational Geometry, 36–44.
View | Download (ext.)
 
[110]
1993 | Journal Article | IST-REx-ID: 4036
Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Snoeyink J. 1993. Computing a face in an arrangement of line segments and related problems. SIAM Journal on Computing. 22(6), 1286–1302.
View | DOI
 
[109]
1993 | Journal Article | IST-REx-ID: 4040
Edelsbrunner H, Tan T. 1993. An upper bound for conforming Delaunay triangulations. Discrete & Computational Geometry. 10(1), 197–213.
View | DOI
 
[108]
1993 | Journal Article | IST-REx-ID: 4041
Edelsbrunner H, Seidel R, Sharir M. 1993. On the zone theorem for hyperplane arrangements. SIAM Journal on Computing. 22(2), 418–429.
View | DOI
 
[107]
1993 | Journal Article | IST-REx-ID: 4042
Edelsbrunner H, Tan T. 1993. A quadratic time algorithm for the minmax length triangulation. SIAM Journal on Computing. 22(3), 527–551.
View | DOI
 
[106]
1993 | Journal Article | IST-REx-ID: 4044
Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan T. 1993. Edge insertion for optimal triangulations. Discrete & Computational Geometry. 10(1), 47–65.
View | DOI
 
[105]
1993 | Journal Article | IST-REx-ID: 4045
Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1993. Diameter, width, closest line pair, and parametric searching. Discrete & Computational Geometry. 10(1), 183–196.
View | DOI
 
[104]
1993 | Book Chapter | IST-REx-ID: 3568
Edelsbrunner H. 1993.Geometric algorithms. In: Handbook of Convex Geometry. , 699–735.
View | Download (ext.)
 
[103]
1993 | Book Chapter | IST-REx-ID: 3569
Edelsbrunner H. 1993.Computational geometry. In: Current Trends in Theoretical Computer Science, Essays and Tutorials. , 1–48.
View | DOI
 
[102]
1992 | Journal Article | IST-REx-ID: 4043
Edelsbrunner H, Tan T, Waupotitsch R. 1992. An O(n^2 log n) time algorithm for the MinMax angle triangulation. SIAM Journal on Scientific Computing. 13(4), 994–1008.
View | DOI
 
[101]
1992 | Journal Article | IST-REx-ID: 4046
Chazelle B, Edelsbrunner H. 1992. An optimal algorithm for intersecting line segments in the plane. Journal of the ACM. 39(1), 1–54.
View | DOI
 
[100]
1992 | Journal Article | IST-REx-ID: 4047
Edelsbrunner H, Guibas L, Pach J, Pollack R, Seidel R, Sharir M. 1992. Arrangements of curves in the plane - topology, combinatorics, and algorithms. Theoretical Computer Science. 92(2), 319–336.
View | DOI
 
[99]
1992 | Journal Article | IST-REx-ID: 4048
Aggarwal A, Edelsbrunner H, Raghavan P, Tiwari P. 1992. Optimal time bounds for some proximity problems in the plane. Information Processing Letters. 42(1), 55–60.
View | DOI
 
[98]
1992 | Conference Paper | IST-REx-ID: 4049
Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan T. 1992. Edge insertion for optimal triangulations. LATIN: Latin American Symposium on Theoretical Informatics , LNCS, vol. 583, 46–60.
View | DOI
 
[97]
1992 | Journal Article | IST-REx-ID: 4050
Edelsbrunner H. 1992. Guest editor’s foreword. Discrete & Computational Geometry. 8(1), 217–217.
View | DOI
 
[96]
1992 | Journal Article | IST-REx-ID: 4053
Aronov B, Edelsbrunner H, Guibas L, Sharir M. 1992. The number of edges of many faces in a line segment arrangement. Combinatorica. 12(3), 261–274.
View | DOI
 
[95]
1992 | Journal Article | IST-REx-ID: 3581
Chazelle B, Edelsbrunner H, Guibas L, Pollack R, Seidel R, Sharir M, Snoeyink J. 1992. Counting and cutting cycles of lines and rods in space. Computational Geometry: Theory and Applications. 1(6), 305–323.
View | DOI
 
[94]
1991 | Journal Article | IST-REx-ID: 4051
Edelsbrunner H, Shi W. 1991. An O(n log^2 h) time algorithm for the three-dimensional convex hull problem. SIAM Journal on Computing. 20(2), 259–269.
View | DOI
 
[93]
1991 | Journal Article | IST-REx-ID: 4052
Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1991. A singly exponential stratification scheme for real semi-algebraic varieties and its applications. Theoretical Computer Science. 84(1), 77–105.
View | DOI
 
[92]
1991 | Conference Paper | IST-REx-ID: 4054
Edelsbrunner H, Seidel R, Sharir M. 1991. On the zone theorem for hyperplane arrangements. New Results and New Trends in Computer Science , LNCS, vol. 555, 108–123.
View | DOI
 
[91]
1991 | Conference Paper | IST-REx-ID: 4055
Edelsbrunner H, Tan T. 1991. A quadratic time algorithm for the minmax length triangulation. FOCS: Foundations of Computer Science, 414–423.
View | DOI
 
[90]
1991 | Journal Article | IST-REx-ID: 4056
Edelsbrunner H, Hajnal P. 1991. A lower bound on the number of unit distances between the vertices of a convex polygon. Journal of Combinatorial Theory Series A. 56(2), 312–316.
View | DOI
 
[89]
1991 | Journal Article | IST-REx-ID: 4057
Edelsbrunner H. 1991. Corrigendum. Journal of Computer and System Sciences. 42(2), 249–251.
View | DOI
 
[88]
1991 | Conference Paper | IST-REx-ID: 4058
Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Snoeyink J. 1991. Computing a face in an arrangement of line segments. SODA: Symposium on Discrete Algorithms, 441–448.
View
 
[87]
1991 | Conference Paper | IST-REx-ID: 4059
Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Hershberger J, Sharir M, Snoeyink J. 1991. Ray shooting in polygons using geodesic triangulations. ICALP: Automata, Languages and Programming, LNCS, vol. 510, 661–673.
View | DOI
 
[86]
1991 | Journal Article | IST-REx-ID: 4061
Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. 1991. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete & Computational Geometry. 6(1), 407–422.
View | DOI
 
[85]
1991 | Journal Article | IST-REx-ID: 4062
Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. 1991. Points and triangles in the plane and halving planes in space. Discrete & Computational Geometry. 6(1), 435–442.
View | DOI
 
[84]
1991 | Book Chapter | IST-REx-ID: 3566
Edelsbrunner H, Sharir M. 1991.A hyperplane incidence problem with applications to counting distances. In: Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 4, 253–263.
View | Download (ext.)
 
[83]
1991 | Book Chapter | IST-REx-ID: 3567
Edelsbrunner H. 1991.Lines in space – A collection of results. In: Discrete & Computational Geometry. DIAMCS Series in Discrete Mathematics and Theoretical Computer Science, vol. 6, 77–93.
View | Download (ext.)
 
[82]
1990 | Journal Article | IST-REx-ID: 4060
Edelsbrunner H, Preparata F, West D. 1990. Tetrahedrizing point sets in three dimensions. Journal of Symbolic Computation. 10(3–4), 335–347.
View | DOI | Download (ext.)
 
[81]
1990 | Journal Article | IST-REx-ID: 4063
Edelsbrunner H, Mücke E. 1990. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics. 9(1), 66–104.
View | DOI
 
[80]
1990 | Journal Article | IST-REx-ID: 4064
Edelsbrunner H, Souvaine D. 1990. Computing least median of squares regression lines and guided topological sweep. Journal of the American Statistical Association. 85(409), 115–119.
View | DOI
 
[79]
1990 | Journal Article | IST-REx-ID: 4065
Edelsbrunner H, Robison A, Shen X. 1990. Covering convex sets with non-overlapping polygons. Discrete Mathematics. 81(2), 153–164.
View | DOI
 
[78]
1990 | Journal Article | IST-REx-ID: 4066
Edelsbrunner H, Guibas L, Sharir M. 1990. The complexity of many cells in arrangements of planes and related problems. Discrete & Computational Geometry. 5(1), 197–216.
View | DOI
 
[77]
1990 | Conference Paper | IST-REx-ID: 4067
Edelsbrunner H, Sharir M. 1990. A hyperplane Incidence problem with applications to counting distances. SIGAL:  Special Interest Group on Algorithms, International Symposium on Algorithms  , LNCS, vol. 450, 419–428.
View | DOI
 
[76]
1990 | Journal Article | IST-REx-ID: 4068
Edelsbrunner H, Sharir M. 1990. The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2. Discrete & Computational Geometry. 5(1), 35–42.
View | DOI
 
[75]
1990 | Journal Article | IST-REx-ID: 4069
Edelsbrunner H. 1990. An acyclicity theorem for cell complexes in d dimension. Combinatorica. 10(3), 251–260.
View | DOI
 
[74]
1990 | Journal Article | IST-REx-ID: 4070
Edelsbrunner H, Overmars M, Welzl E, Hartman I, Feldman J. 1990. Ranking intervals under visibility constraints. International Journal of Computer Mathematics. 34(3–4), 129–144.
View | DOI
 
[73]
1990 | Conference Paper | IST-REx-ID: 4071
Edelsbrunner H, Tan T, Waupotitsch R. 1990. An O(n^2log n) time algorithm for the MinMax angle triangulation. SCG: Symposium on Computational Geometry, 44–52.
View | DOI
 
[72]
1990 | Journal Article | IST-REx-ID: 4072
Edelsbrunner H, Guibas L, Sharir M. 1990. The complexity and construction of many faces in arrangements of lines and of segments. Discrete & Computational Geometry. 5(1), 161–196.
View | DOI
 
[71]
1990 | Conference Paper | IST-REx-ID: 4073
Chazelle B, Edelsbrunner H, Guibas L, Pollack R, Seidel R, Sharir M, Snoeyink J. 1990. Counting and cutting cycles of lines and rods in space. FOCS: Foundations of Computer Science, 242–251.
View | DOI
 
[70]
1990 | Journal Article | IST-REx-ID: 4074
Clarkson K, Edelsbrunner H, Guibas L, Sharir M, Welzl E. 1990. Combinatorial complexity bounds for arrangements of curves and spheres. Discrete & Computational Geometry. 5(1), 99–160.
View | DOI
 
[69]
1990 | Journal Article | IST-REx-ID: 4075
Dobkin D, Edelsbrunner H, Overmars M. 1990. Searching for empty convex polygons. Algorithmica. 5(4), 561–571.
View | DOI
 
[68]
1990 | Conference Paper | IST-REx-ID: 4076
Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. 1990. Euclidean minimum spanning trees and bichromatic closest pairs. SCG: Symposium on Computational Geometry, 203–210.
View | DOI
 
[67]
1990 | Conference Paper | IST-REx-ID: 4077
Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. 1990. Points and triangles in the plane and halving planes in space. SCG: Symposium on Computational Geometry, 112–115.
View | DOI
 
[66]
1990 | Conference Paper | IST-REx-ID: 4078
Chazelle B, Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M. 1990. Slimming down by adding; selecting heavily covered points. SCG: Symposium on Computational Geometry, 116–127.
View | DOI
 
[65]
1990 | Book Chapter | IST-REx-ID: 3565
Dobkin D, Edelsbrunner H, Yap C. 1990.Probing convex polytopes. In: Autonomous Robot Vehicles. , 328–341.
View | DOI
 
[64]
1989 | Journal Article | IST-REx-ID: 4079
Edelsbrunner H, Skiena S. 1989. On the number of furthest neighbor pairs in a point set. American Mathematical Monthly. 96(7), 614–618.
View | Download (ext.)
 
[63]
1989 | Journal Article | IST-REx-ID: 4080
Edelsbrunner H, Hasan N, Seidel R, Shen X. 1989. Circles through two points that always enclose many points. Geometriae Dedicata. 32(1), 1–12.
View | DOI
 
[62]
1989 | Journal Article | IST-REx-ID: 4081
Edelsbrunner H, Guibas L, Sharir M. 1989. The upper envelope of piecewise linear functions: Algorithms and applications. Discrete & Computational Geometry. 4(1), 311–336.
View | DOI
 
[61]
1989 | Journal Article | IST-REx-ID: 4082
Edelsbrunner H, Guibas L. 1989. Topologically sweeping an arrangement. Journal of Computer and System Sciences. 38(1), 165–194.
View | DOI
 
[60]
1989 | Journal Article | IST-REx-ID: 4083
Yao F, Dobkin D, Edelsbrunner H, Paterson M. 1989. Partitioning space for range queries. SIAM Journal on Computing. 18(2), 371–384.
View | DOI
 
[59]
1989 | Journal Article | IST-REx-ID: 4084
Edelsbrunner H, Rote G, Welzl E. 1989. Testing the necklace condition for shortest tours and optimal factors in the plane. Theoretical Computer Science. 66(2), 157–180.
View | DOI
 
[58]
1989 | Conference Paper | IST-REx-ID: 4085
Edelsbrunner H. 1989. An acyclicity theorem for cell complexes in d dimension. SCG: Symposium on Computational Geometry, 145–151.
View | DOI
 
[57]
1989 | Journal Article | IST-REx-ID: 4086
Edelsbrunner H. 1989. The upper envelope of piecewise linear functions: Tight bounds on the number of faces . Discrete & Computational Geometry. 4(4), 337–343.
View | DOI
 
[56]
1989 | Conference Paper | IST-REx-ID: 4087
Edelsbrunner H, Preparata F, West D. 1989. Tetrahedrizing point sets in three dimensions. ISSAC: International Symposium on Symbolic and Algebraic Computation, LNCS, vol. 358, 315–331.
View | DOI
 
[55]
1989 | Journal Article | IST-REx-ID: 4088
Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M, Snoeyink J, Welzl E. 1989. Implicitly representing arrangements of lines or segments. Discrete & Computational Geometry. 4(1), 433–466.
View | DOI
 
[54]
1989 | Journal Article | IST-REx-ID: 4089
Edelsbrunner H, Guibas L, Hershberger J, Pach J, Pollack R, Seidel R, Sharir M, Snoeyink J. 1989. On arrangements of Jordan arcs with three intersections per pair. Discrete & Computational Geometry. 4(1), 523–539.
View | DOI
 
[53]
1989 | Conference Paper | IST-REx-ID: 4092
Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1989. A singly exponential stratification scheme for real semi-algebraic varieties and its applications. ICALP: Automata, Languages and Programming, LNCS, vol. 372, 179–193.
View | DOI
 
[52]
1989 | Journal Article | IST-REx-ID: 4093
Chazelle B, Edelsbrunner H, Guibas L. 1989. The complexity of cutting complexes. Discrete & Computational Geometry. 4(1), 139–181.
View | DOI
 
[51]
1989 | Conference Paper | IST-REx-ID: 3549
Edelsbrunner H. 1989. Spatial triangulations with dihedral angle conditions. International Workshop on Discrete Algorithms and Complexity, 83–89.
View
 
[50]
1988 | Journal Article | IST-REx-ID: 4090
Edelsbrunner H, Preparata F. 1988. Minimum polygonal separation. Information and Computation. 77(3), 218–232.
View | DOI
 
[49]
1988 | Journal Article | IST-REx-ID: 4091
Edelsbrunner H, Skiena S. 1988. Probing convex polygons with X-Rays. SIAM Journal on Computing. 17(5), 870–882.
View | DOI
 
[48]
1988 | Conference Paper | IST-REx-ID: 4096
Edelsbrunner H. 1988. Geometric structures in computational geometry. ALP: Automata, Languages and Programming, LNCS, vol. 317, 201–213.
View | DOI
 
[47]
1988 | Conference Paper | IST-REx-ID: 4097
Edelsbrunner H, Guibas L, Pach J, Pollack R, Seidel R, Sharir M. 1988. Arrangements of curves in the plane - topology, combinatorics, and algorithms. ICALP: Automata, Languages and Programming, LNCS, vol. 317, 214–229.
View | DOI
 
[46]
1987 | Book | IST-REx-ID: 3900
Edelsbrunner H. 1987. Algorithms in Combinatorial Geometry, Springer,p.
View | Files available
 
[45]
1987 | Journal Article | IST-REx-ID: 4094
Edelsbrunner H, Shen X. 1987. A tight lower bound on the size of visibility graphs. Information Processing Letters. 26(2), 61–64.
View | DOI
 
[44]
1987 | Journal Article | IST-REx-ID: 4095
Chazelle B, Edelsbrunner H. 1987. An improved algorithm for constructing kth-order Voronoi diagrams. IEEE Transactions on Computers. 36(11), 1349–1354.
View | DOI
 
[43]
1987 | Journal Article | IST-REx-ID: 4100
Chazelle B, Edelsbrunner H. 1987. Linear space data structures for two types of range search. Discrete & Computational Geometry. 2(1), 113–126.
View | DOI
 
[42]
1987 | Journal Article | IST-REx-ID: 4101
Edelsbrunner H, Overmars M. 1987. Zooming by repeated range detection. Information Processing Letters. 24(6), 413–417.
View | DOI
 
[41]
1987 | Journal Article | IST-REx-ID: 4102
Dobkin D, Edelsbrunner H. 1987. Space searching for intersecting objects. Journal of Algorithms. 8(3), 348–361.
View | DOI
 
[40]
1987 | Conference Paper | IST-REx-ID: 3514
Edelsbrunner H, Pach J, Schwartz J, Sharir M. 1987. On the lower envelope of bivariate functions and its applications. FOCS: Foundations of Computer Science, 27–37.
View | DOI
 
[39]
1986 | Journal Article | IST-REx-ID: 4098
Edelsbrunner H, Stöckl G. 1986. The number of extreme pairs of finite point-sets in Euclidean spaces. Journal of Combinatorial Theory Series A. 43(2), 344–349.
View | DOI
 
[38]
1986 | Journal Article | IST-REx-ID: 4099
Edelsbrunner H, Welzl E. 1986. Halfplanar range search in linear space and O(n0.695) query time. Information Processing Letters. 23(5), 289–293.
View | DOI
 
[37]
1986 | Journal Article | IST-REx-ID: 4103
Edelsbrunner H, Welzl E. 1986. On the maximal number of edges of many faces in an arrangement. Journal of Combinatorial Theory Series A. 41(2), 159–166.
View | DOI
 
[36]
1986 | Journal Article | IST-REx-ID: 4104
Edelsbrunner H, Guibas L, Stolfi J. 1986. Optimal point location in a monotone subdivision. SIAM Journal on Computing. 15(2), 317–340.
View | DOI
 
[35]
1986 | Journal Article | IST-REx-ID: 4105
Edelsbrunner H, O’Rourke J, Seidel R. 1986. Constructing arrangements of lines and hyperplanes with applications. SIAM Journal on Computing. 15(2), 341–363.
View | DOI
 
[34]
1986 | Journal Article | IST-REx-ID: 4106
Edelsbrunner H, Waupotitsch R. 1986. Computing a ham-sandwich cut in two dimensions. Journal of Symbolic Computation. 2(2), 171–178.
View | DOI
 
[33]
1986 | Journal Article | IST-REx-ID: 4107
Edelsbrunner H, Haussler D. 1986. The complexity of cells in 3-dimensional arrangements. Discrete Mathematics. 60(C), 139–146.
View | DOI
 
[32]
1986 | Journal Article | IST-REx-ID: 4108
Edelsbrunner H, Seidel R. 1986. Voronoi diagrams and arrangements. Discrete & Computational Geometry. 1(1), 25–44.
View | DOI
 
[31]
1986 | Journal Article | IST-REx-ID: 4109
Edelsbrunner H, Haring G, Hilbert D. 1986. Rectangular point location in d-dimensions with applications. Computer Journal. 29(1), 76–82.
View | DOI
 
[30]
1986 | Journal Article | IST-REx-ID: 4110
Edelsbrunner H, Welzl E. 1986. Constructing belts in two-dimensional arrangements with applications. SIAM Journal on Computing. 15(1), 271–284.
View | DOI
 
[29]
1986 | Journal Article | IST-REx-ID: 3579
Edelsbrunner H, Jaromczyk J. 1986. How often can you see yourself in a convex configuration of mirrors? Congressus Numerantium. 53, 193–200.
View
 
[28]
1986 | Journal Article | IST-REx-ID: 3580
Edelsbrunner H. 1986. Edge-skeletons in arrangements with applications. Algorithmica. 1(1–4), 93–109.
View | DOI
 
[27]
1985 | Journal Article | IST-REx-ID: 4111
Edelsbrunner H, Maurer H. 1985. Finding extreme-points in 3-dimensions and solving the post-office problem in the plane. Information Processing Letters. 21(1), 39–47.
View | DOI
 
[26]
1985 | Journal Article | IST-REx-ID: 4112
Edelsbrunner H, Overmars M. 1985. Batched dynamic solutions to decomposable searching problems. Journal of Algorithms. 6(4), 515–542.
View | DOI
 
[25]
1985 | Journal Article | IST-REx-ID: 4113
Edelsbrunner H, Welzl E. 1985. On the number of line separations of a finite set in the plane. Journal of Combinatorial Theory Series A. 38(1), 15–29.
View | DOI
 
[24]
1985 | Journal Article | IST-REx-ID: 4114
Day W, Edelsbrunner H. 1985. Investigation of Proportional Link Linkage Clustering Methods. Journal of Classification. 2(2–3), 239–254.
View | DOI
 
[23]
1985 | Journal Article | IST-REx-ID: 4115
Edelsbrunner H. 1985. Computing the extreme distances between two convex polygons. Journal of Algorithms. 6(2), 213–224.
View | DOI
 
[22]
1985 | Journal Article | IST-REx-ID: 4116
Edelsbrunner H. 1985. Finding Transversals for Sets of Simple Geometric-Figures. Theoretical Computer Science. 35(1), 55–69.
View | DOI
 
[21]
1985 | Journal Article | IST-REx-ID: 4120
Chazelle B, Edelsbrunner H. 1985. Optimal solutions for a class of point retrieval problems. Journal of Symbolic Computation. 1(1), 47–56.
View | DOI
 
[20]
1984 | Journal Article | IST-REx-ID: 4117
Edelsbrunner H, Van Leeuwen J, Ottmann T, Wood D. 1984. Computing the connected components of simple rectilinear geometrical objects in D-Space. Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications. 18(2), 171–183.
View
 
[19]
1984 | Journal Article | IST-REx-ID: 4118
Edelsbrunner H, O’Rourke J, Welzl E. 1984. Stationing guards in rectilinear art galleries. Computer Vision, Graphics, and Image Processing. 27(2), 167–176.
View | DOI
 
[18]
1984 | Conference Paper | IST-REx-ID: 4119
Edelsbrunner H, Welzl E. 1984. Monotone edge sequences in line arrangements and applications. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 176, 265–272.
View | DOI
 
[17]
1984 | Journal Article | IST-REx-ID: 4121
Day W, Edelsbrunner H. 1984. Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification. 1(1), 7–24.
View | DOI | Download (ext.)
 
[16]
1984 | Conference Paper | IST-REx-ID: 4122
Edelsbrunner H. 1984. Key-problems and key-methods in computational geometry. STACS: Theoretical Aspects of Computer Science, LNCS, vol. 166, 1–13.
View | DOI
 
[15]
1984 | Journal Article | IST-REx-ID: 4123
Edelsbrunner H, Overmars M, Seidel R. 1984. Some methods of computational geometry applied to computer graphics. Computer Vision, Graphics, and Image Processing. 28(1), 92–108.
View | DOI
 
[14]
1984 | Journal Article | IST-REx-ID: 4125
Aurenhammer F, Edelsbrunner H. 1984. An optimal algorithm for constructing the weighted Voronoi diagram in the plane. Pattern Recognition. 17(2), 251–257.
View | DOI
 
[13]
1984 | Conference Paper | IST-REx-ID: 3513
Dobkin D, Edelsbrunner H. 1984. Ham-sandwich theorems applied to intersection problems. WG: International Workshop on Graph Theoretic Concepts in Computer Science, 88–99.
View | Download (ext.)
 
[12]
1983 | Conference Paper | IST-REx-ID: 4124
Edelsbrunner H, Welzl E. 1983. On the number of equal-sized semispaces of a set of points in the plane. ICALP: Automata, Languages and Programming, LNCS, vol. 154, 182–187.
View | DOI
 
[11]
1983 | Journal Article | IST-REx-ID: 4126
Edelsbrunner H. 1983. A new approach to rectangle intersections part 1. International Journal of Computer Mathematics. 13(3–4), 209–219.
View | DOI
 
[10]
1983 | Journal Article | IST-REx-ID: 4127
Edelsbrunner H. 1983. A new approach to rectangle intersections part 2. International Journal of Computer Mathematics. 13(3–4), 221–229.
View | DOI
 
[9]
1983 | Journal Article | IST-REx-ID: 4128
Edelsbrunner H, Kirkpatrick D, Seidel R. 1983. On the shape of a set of points in the plane. IEEE Transactions on Information Theory. 29(4), 551–559.
View | DOI
 
[8]
1983 | Book Chapter | IST-REx-ID: 3562
Bucher W, Edelsbrunner H. 1983.On expected- and worst-case segment trees. In: Computational Geometry: Theory and Applications. Advances in Computing Research , vol. 1, 109–125.
View | Download (ext.)
 
[7]
1983 | Book Chapter | IST-REx-ID: 3563
Edelsbrunner H, Overmars M, Wood D. 1983.Graphics in Flatland: a case study. In: Computational Geometry: Theory and Applications. Advances in Computing Research, vol. 1, 35–59.
View
 
[6]
1983 | Book Chapter | IST-REx-ID: 3564
Edelsbrunner H. 1983.Neue Entwicklungen im Bereich Datenstrukturen. In: Überblicke Informationsverarbeitung . , 55–109.
View | Download (ext.)
 
[5]
1982 | Journal Article | IST-REx-ID: 4129
Edelsbrunner H, Maurer H, Preparata F, Rosenberg A, Welzl E, Wood D. 1982. Stabbing line segments. Bit. 22(3), 274–281.
View | DOI
 
[4]
1982 | Journal Article | IST-REx-ID: 4130
Edelsbrunner H, Maurer H, Kirkpatrick D. 1982. Polygonal intersection searching. Information Processing Letters. 14(2), 74–79.
View | DOI
 
[3]
1982 | Journal Article | IST-REx-ID: 4131
Edelsbrunner H, Overmars M. 1982. On the equivalence of some rectangle problems. Information Processing Letters. 14(3), 124–127.
View | DOI
 
[2]
1981 | Journal Article | IST-REx-ID: 4132
Edelsbrunner H, Maurer H. 1981. On the intersection of Orthogonal objects. Information Processing Letters. 13(4–5), 177–181.
View | DOI
 
[1]
1981 | Journal Article | IST-REx-ID: 4133
Edelsbrunner H, Maurer H. 1981. A space-optimal solution of general region location. Theoretical Computer Science. 16(3), 329–336.
View | DOI
 

Search

Filter Publications

288 Publications

Mark all

[288]
2021 | Journal Article | IST-REx-ID: 9317 | OA
Edelsbrunner H, Osang GF. 2021. The multi-cover persistence of Euclidean balls. Discrete and Computational Geometry.
View | Files available | DOI | Download Published Version (ext.)
 
[287]
2021 | Journal Article | IST-REx-ID: 9465 | OA
Edelsbrunner H, Nikitenko A, Osang GF. 2021. A step in the Delaunay mosaic of order k. Journal of Geometry. 112(1), 15.
View | Files available | DOI
 
[286]
2021 | Conference Paper | IST-REx-ID: 9604 | OA
Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. 2021. Counting cells of order-k voronoi tessellations in ℝ3 with morse theory. Leibniz International Proceedings in Informatics. SoCG: International Symposium on Computational Geometry, LIPIcs, vol. 189, 16.
View | Files available | DOI
 
[285]
2021 | Conference Paper | IST-REx-ID: 9345 | OA
Edelsbrunner H, Heiss T, Kurlin V, Smith P, Wintraecken M. 2021. The density fingerprint of a periodic point set. 37th International Symposium on Computational Geometry (SoCG 2021). SoCG: Symposium on Computational Geometry, LIPIcs, vol. 189, 32:1-32:16.
View | Files available | DOI
 
[284]
2020 | Conference Paper | IST-REx-ID: 8135 | OA
Edelsbrunner H, Nikitenko A, Ölsböck K, Synak P. 2020. Radius functions on Poisson–Delaunay mosaics and related complexes experimentally. Topological Data Analysis. , Abel Symposia, vol. 15, 181–218.
View | Files available | DOI
 
[283]
2020 | Journal Article | IST-REx-ID: 7554 | OA
Edelsbrunner H, Nikitenko A. 2020. Weighted Poisson–Delaunay mosaics. Theory of Probability and its Applications. 64(4), 595–614.
View | DOI | Download Preprint (ext.) | arXiv
 
[282]
2020 | Journal Article | IST-REx-ID: 7666 | OA
Edelsbrunner H, Ölsböck K. 2020. Tri-partitions and bases of an ordered complex. Discrete and Computational Geometry. 64, 759–775.
View | Files available | DOI
 
[281]
2020 | Journal Article | IST-REx-ID: 9156 | OA
Akopyan A, Edelsbrunner H. 2020. The weighted Gaussian curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. 8(1), 74–88.
View | Files available | DOI | arXiv
 
[280]
2020 | Journal Article | IST-REx-ID: 9157 | OA
Akopyan A, Edelsbrunner H. 2020. The weighted mean curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. 8(1), 51–67.
View | Files available | DOI
 
[279]
2020 | Journal Article | IST-REx-ID: 9630 | OA
Edelsbrunner H, Virk Z, Wagner H. 2020. Topological data analysis in information space. Journal of Computational Geometry. 11(2), 162–182.
View | Files available | DOI
 
[278]
2019 | Journal Article | IST-REx-ID: 5678 | OA
Edelsbrunner H, Nikitenko A. 2019. Poisson–Delaunay Mosaics of Order k. Discrete and Computational Geometry. 62(4), 865–878.
View | Files available | DOI | arXiv
 
[277]
2019 | Journal Article | IST-REx-ID: 6608 | OA
Edelsbrunner H, Ölsböck K. 2019. Holes and dependences in an ordered complex. Computer Aided Geometric Design. 73, 1–15.
View | Files available | DOI
 
[276]
2019 | Conference Paper | IST-REx-ID: 6648 | OA
Edelsbrunner H, Virk Z, Wagner H. 2019. Topological data analysis in information space. 35th International Symposium on Computational Geometry. SoCG 2019: Symposium on Computational Geometry, LIPIcs, vol. 129, 31:1-31:14.
View | Files available | DOI | arXiv
 
[275]
2019 | Journal Article | IST-REx-ID: 6756 | OA
Pranav P, Adler RJ, Buchert T, Edelsbrunner H, Jones BJT, Schwartzman A, Wagner H, Van De Weygaert R. 2019. Unexpected topology of the temperature fluctuations in the cosmic microwave background. Astronomy and Astrophysics. 627, A163.
View | Files available | DOI | arXiv
 
[274]
2018 | Journal Article | IST-REx-ID: 87 | OA
Edelsbrunner H, Nikitenko A. 2018. Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics. Annals of Applied Probability. 28(5), 3215–3238.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[273]
2018 | Conference Paper | IST-REx-ID: 188 | OA
Edelsbrunner H, Virk Z, Wagner H. 2018. Smallest enclosing spheres and Chernoff points in Bregman geometry. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 35:1-35:13.
View | Files available | DOI
 
[272]
2018 | Journal Article | IST-REx-ID: 530 | OA
Edelsbrunner H, Iglesias Ham M. 2018. Multiple covers with balls I: Inclusion–exclusion. Computational Geometry: Theory and Applications. 68, 119–133.
View | Files available | DOI
 
[271]
2018 | Journal Article | IST-REx-ID: 312 | OA
Edelsbrunner H, Iglesias Ham M. 2018. On the optimality of the FCC lattice for soft sphere packing. SIAM J Discrete Math. 32(1), 750–782.
View | DOI | Download Submitted Version (ext.)
 
[270]
2018 | Conference Paper | IST-REx-ID: 187 | OA
Edelsbrunner H, Osang GF. 2018. The multi-cover persistence of Euclidean balls. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99, 34.
View | Files available | DOI
 
[269]
2017 | Book Chapter | IST-REx-ID: 84
Edelsbrunner H, Koehl P. 2017.Computational topology for structural molecular biology. In: Handbook of Discrete and Computational Geometry, Third Edition. , 1709–1735.
View | DOI
 
[268]
2017 | Journal Article | IST-REx-ID: 718 | OA
Edelsbrunner H, Nikitenko A, Reitzner M. 2017. Expected sizes of poisson Delaunay mosaics and their discrete Morse functions. Advances in Applied Probability. 49(3), 745–767.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[267]
2017 | Conference Paper | IST-REx-ID: 688 | OA
Edelsbrunner H, Wagner H. 2017. Topological data analysis with Bregman divergences. Symposium on Computational Geometry, SoCG, LIPIcs, vol. 77, 391–3916.
View | Files available | DOI
 
[266]
2017 | Journal Article | IST-REx-ID: 1022 | OA
Pranav P, Edelsbrunner H, Van De Weygaert R, Vegter G, Kerber M, Jones B, Wintraecken M. 2017. The topology of the cosmic web in terms of persistent Betti numbers. Monthly Notices of the Royal Astronomical Society. 465(4), 4281–4310.
View | DOI | Download Submitted Version (ext.)
 
[265]
2017 | Journal Article | IST-REx-ID: 1072 | OA
Bauer U, Edelsbrunner H. 2017. The Morse theory of Čech and delaunay complexes. Transactions of the American Mathematical Society. 369(5), 3741–3762.
View | Download Preprint (ext.)
 
[264]
2017 | Journal Article | IST-REx-ID: 1173 | OA
Edelsbrunner H, Glazyrin A, Musin O, Nikitenko A. 2017. The Voronoi functional is maximized by the Delaunay triangulation in the plane. Combinatorica. 37(5), 887–910.
View | DOI | Download Submitted Version (ext.)
 
[263]
2016 | Journal Article | IST-REx-ID: 1289 | OA
Dunaeva O, Edelsbrunner H, Lukyanov A, Machin M, Malkova D, Kuvaev R, Kashin S. 2016. The classification of endoscopy images with persistent homology. Pattern Recognition Letters. 83(1), 13–22.
View | Files available | DOI
 
[262]
2016 | Journal Article | IST-REx-ID: 1295
Edelsbrunner H, Iglesias Ham M. 2016. Multiple covers with balls II: Weighted averages. Electronic Notes in Discrete Mathematics. 54, 169–174.
View | DOI
 
[261]
2016 | Journal Article | IST-REx-ID: 1662 | OA
Edelsbrunner H, Pausinger F. 2016. Approximation and convergence of the intrinsic volume. Advances in Mathematics. 287, 674–703.
View | Files available | DOI
 
[260]
2015 | Journal Article | IST-REx-ID: 2035 | OA
Edelsbrunner H, Jablonski G, Mrozek M. 2015. The persistent homology of a self-map. Foundations of Computational Mathematics. 15(5), 1213–1244.
View | Files available | DOI
 
[259]
2015 | Conference Paper | IST-REx-ID: 1495 | OA
Edelsbrunner H, Iglesias Ham M, Kurlin V. 2015. Relaxed disk packing. Proceedings of the 27th Canadian Conference on Computational Geometry. CCCG: Canadian Conference on Computational Geometry vol. 2015–August, 128–135.
View | Download Submitted Version (ext.)
 
[258]
2015 | Conference Paper | IST-REx-ID: 1567
Edelsbrunner H. 2015. Shape, homology, persistence, and stability. 9411.
View
 
[257]
2015 | Conference Paper | IST-REx-ID: 1568
Dunaeva O, Edelsbrunner H, Lukyanov A, Machin M, Malkova D. 2015. The classification of endoscopy images with persistent homology. Proceedings - 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. SYNASC: Symbolic and Numeric Algorithms for Scientific Computing, 7034731.
View | Files available | DOI
 
[256]
2015 | Journal Article | IST-REx-ID: 1578
Cao T, Edelsbrunner H, Tan T. 2015. Triangulations from topologically correct digital Voronoi diagrams. Computational Geometry. 48(7), 507–519.
View | DOI
 
[255]
2015 | Journal Article | IST-REx-ID: 1793 | OA
Symonova O, Topp C, Edelsbrunner H. 2015. DynamicRoots: A software platform for the reconstruction and analysis of growing plant roots. PLoS One. 10(6), e0127657.
View | Files available | DOI
 
[254]
2015 | Research Data Reference | IST-REx-ID: 9737
Symonova O, Topp C, Edelsbrunner H. 2015. Root traits computed by DynamicRoots for the maize root shown in fig 2, Public Library of Science, 10.1371/journal.pone.0127657.s001.
View | Files available | DOI
 
[253]
2014 | Conference Paper | IST-REx-ID: 2905 | OA
Edelsbrunner H, Morozovy D. 2014. Persistent homology: Theory and practice. ECM: European Congress of Mathematics, 31–50.
View | Files available | DOI
 
[252]
2014 | Journal Article | IST-REx-ID: 1876 | OA
Dolbilin N, Edelsbrunner H, Glazyrin A, Musin O. 2014. Functionals on triangulations of delaunay sets. Moscow Mathematical Journal. 14(3), 491–504.
View | Download Submitted Version (ext.)
 
[251]
2014 | Journal Article | IST-REx-ID: 1929
Alexeev VV, Bogaevskaya VG, Preobrazhenskaya MM, Ukhalov AY, Edelsbrunner H, Yakimova O. 2014. An algorithm for cartographic generalization that preserves global topology. Journal of Mathematical Sciences (United States). 203(6), 754–760.
View | DOI
 
[250]
2014 | Conference Paper | IST-REx-ID: 2155 | OA
Bauer U, Edelsbrunner H. 2014. The morse theory of Čech and Delaunay filtrations. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 484–490.
View | DOI | Download Submitted Version (ext.)
 
[249]
2014 | Conference Paper | IST-REx-ID: 2177
Edelsbrunner H, Parsa S. 2014. On the computational complexity of betti numbers reductions from matrix rank. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 152–160.
View | DOI
 
[248]
2014 | Journal Article | IST-REx-ID: 2255 | OA
Edelsbrunner H, Pausinger F. 2014. Stable length estimates of tube-like shapes. Journal of Mathematical Imaging and Vision. 50(1), 164–177.
View | Files available | DOI
 
[247]
2013 | Journal Article | IST-REx-ID: 2815
Edelsbrunner H, Fasy BT, Rote G. 2013. Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. Discrete & Computational Geometry. 49(4), 797–822.
View | Files available | DOI
 
[246]
2013 | Journal Article | IST-REx-ID: 2822 | OA
Topp C, Iyer Pascuzzi A, Anderson J, Lee C, Zurek P, Symonova O, Zheng Y, Bucksch A, Mileyko Y, Galkovskyi T, Moore B, Harer J, Edelsbrunner H, Mitchell Olds T, Weitz J, Benfey P. 2013. 3D phenotyping and quantitative trait locus mapping identify core regions of the rice genome controlling root architecture. PNAS. 110(18), E1695–E1704.
View | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 
[245]
2013 | Conference Paper | IST-REx-ID: 2843
Edelsbrunner H, Pausinger F. 2013. Stable length estimates of tube-like shapes. 17th IAPR International Conference on Discrete Geometry for Computer Imagery. DGCI: Discrete Geometry for Computer Imagery, LNCS, vol. 7749, XV–XIX.
View | Files available | DOI
 
[244]
2013 | Journal Article | IST-REx-ID: 2859 | OA
Bendich P, Edelsbrunner H, Morozov D, Patel A. 2013. Homology and robustness of level and interlevel sets. Homology, Homotopy and Applications. 15(1), 51–72.
View | DOI | Download Preprint (ext.) | arXiv
 
[243]
2013 | Journal Article | IST-REx-ID: 2887 | OA
Fang S, Clark R, Zheng Y, Iyer Pascuzzi A, Weitz J, Kochian L, Edelsbrunner H, Liao H, Benfey P. 2013. Genotypic recognition and spatial responses by rice roots. PNAS. 110(7), 2670–2675.
View | DOI | Download Published Version (ext.) | PubMed | Europe PMC
 
[242]
2013 | Conference Paper | IST-REx-ID: 2906 | OA
Kerber M, Edelsbrunner H. 2013. 3D kinetic alpha complexes and their implementation. 2013 Proceedings of the 15th Workshop on Algorithm Engineering and Experiments. ALENEX: Algorithm Engineering and Experiments, ALENEX, , 70–77.
View | Files available | DOI
 
[241]
2012 | Journal Article | IST-REx-ID: 2849 | OA
Edelsbrunner H, Strelkova N. 2012. On the configuration space of Steiner minimal trees. Russian Mathematical Surveys. 67(6), 1167–1168.
View | Files available | DOI
 
[240]
2012 | Journal Article | IST-REx-ID: 2902
Edelsbrunner H, Musin O, Ukhalov A, Yakimova O, Alexeev V, Bogaevskaya V, Gorohov A, Preobrazhenskaya M. 2012. Fractal and computational geometry for generalizing cartographic objects. Modeling and Analysis of Information Systems. 19(6), 152–160.
View | Download None (ext.)
 
[239]
2012 | Conference Paper | IST-REx-ID: 2903 | OA
Edelsbrunner H, Symonova O. 2012. The adaptive topology of a digital image. ISVD: International Symposium on Voronoi Diagrams in Science and Engineering, 41–48.
View | Files available | DOI
 
[238]
2012 | Journal Article | IST-REx-ID: 2911
Edelsbrunner H, Ivanov A, Karasev R. 2012. Open problems in discrete and computational geometry. Automatic Control and Computer Sciences. in print.
View
 
[237]
2012 | Journal Article | IST-REx-ID: 2912
Edelsbrunner H, Strelkova N. 2012. Configuration space for shortest networks . Uspekhi Mat. Nauk. 67(6), 203–204.
View | DOI
 
[236]
2012 | Journal Article | IST-REx-ID: 2941 | OA
Dolbilin N, Edelsbrunner H, Musin O. 2012. On the optimality of functionals over triangulations of Delaunay sets. Russian Mathematical Surveys. 67(4), 781–783.
View | Files available | DOI
 
[235]
2012 | Conference Paper | IST-REx-ID: 3133 | OA
Edelsbrunner H, Kerber M. 2012. Alexander duality for functions: The persistent behavior of land and water and shore. Proceedings of the twenty-eighth annual symposium on Computational geometry . SCG: Symposium on Computational Geometry, 249–258.
View | DOI | Download Preprint (ext.)
 
[234]
2012 | Conference Paper | IST-REx-ID: 3134
Edelsbrunner H, Fasy B, Rote G. 2012. 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 . SCG: Symposium on Computational Geometry, 91–100.
View | Files available | DOI
 
[233]
2012 | Journal Article | IST-REx-ID: 3159 | OA
Mileyko Y, Edelsbrunner H, Price C, Weitz J. 2012. Hierarchical ordering of reticular networks. PLoS One. 7(6), e36715.
View | Files available | DOI
 
[232]
2012 | Journal Article | IST-REx-ID: 3256 | OA
Edelsbrunner H, Kerber M. 2012. Dual complexes of cubical subdivisions of ℝn. Discrete & Computational Geometry. 47(2), 393–414.
View | Files available | DOI
 
[231]
2012 | Journal Article | IST-REx-ID: 3310 | OA
Bendich P, Cabello S, Edelsbrunner H. 2012. A point calculus for interlevel set homology. Pattern Recognition Letters. 33(11), 1436–1444.
View | Files available | DOI
 
[230]
2011 | Book Chapter | IST-REx-ID: 3796 | OA
Edelsbrunner H, Kerber M. 2011.Covering and packing with spheres by diagonal distortion in R^n. In: Rainbow of Computer Science. LNCS, vol. 6570, 20–35.
View | Files available | DOI
 
[229]
2011 | Journal Article | IST-REx-ID: 3965
Wang B, Edelsbrunner H, Morozov D. 2011. Computing elevation maxima by searching the Gauss sphere. Journal of Experimental Algorithmics. 16(2.2), 1–13.
View | DOI
 
[228]
2011 | Book Chapter | IST-REx-ID: 3311
Edelsbrunner H. 2011.Alpha shapes - a survey. In: Tessellations in the Sciences. .
View
 
[227]
2011 | Conference Poster | IST-REx-ID: 3312 | OA
Zheng Y, Gu S, Edelsbrunner H, Tomasi C, Benfey P. 2011. Detailed reconstruction of 3D plant root shape, IEEE,p.
View | Files available | DOI
 
[226]
2011 | Conference Paper | IST-REx-ID: 3313 | OA
Chen C, Edelsbrunner H. 2011. Diffusion runs low on persistence fast. Proceedings of the IEEE International Conference on Computer Vision. ICCV: International Conference on Computer Vision, 6126271.
View | Files available | DOI
 
[225]
2011 | Journal Article | IST-REx-ID: 3334
Edelsbrunner H, Pach J, Ziegler G. 2011. Letter from the new editors-in-chief. Discrete & Computational Geometry. 45(1), 1–2.
View | DOI
 
[224]
2011 | Book Chapter | IST-REx-ID: 3335 | OA
Van De Weygaert R, Vegter G, Edelsbrunner H, Jones B, Pranav P, Park C, Hellwing W, Eldering B, Kruithof N, Bos P, Hidding J, Feldbrugge J, Ten Have E, Van Engelen M, Caroli M, Teillaud M. 2011.Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web. In: Transactions on Computational Science XIV. LNCS, vol. 6970, 60–101.
View | DOI | Download Preprint (ext.) | arXiv
 
[223]
2011 | Journal Article | IST-REx-ID: 3377 | OA
Edelsbrunner H, Morozov D, Patel A. 2011. Quantifying transversality by measuring the robustness of intersections. Foundations of Computational Mathematics. 11(3), 345–361.
View | DOI | Download Submitted Version (ext.)
 
[222]
2010 | Book Chapter | IST-REx-ID: 3795 | OA
Edelsbrunner H, Morozov D, Patel A. 2010.The stability of the apparent contour of an orientable 2-manifold. In: Topological Data Analysis and Visualization: Theory, Algorithms and Applications. Mathematics and Visualization, , 27–42.
View | Files available | DOI
 
[221]
2010 | Conference Paper | IST-REx-ID: 3848
Bendich P, Edelsbrunner H, Morozov D, Patel A. 2010. The robustness of level sets. ESA: European Symposium on Algorithms, LNCS, vol. 6346, 1–10.
View | DOI
 
[220]
2010 | Conference Paper | IST-REx-ID: 3849 | OA
Bendich P, Edelsbrunner H, Kerber M, Patel A. 2010. Persistent homology under non-uniform error. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 12–23.
View | Files available | DOI
 
[219]
2010 | Conference Paper | IST-REx-ID: 3853 | OA
Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. 2010. Mean-payoff automaton expressions. CONCUR: Concurrency Theory, LNCS, vol. 6269, 269–283.
View | Files available | DOI
 
[218]
2010 | Book | IST-REx-ID: 3899
Edelsbrunner H, Harer J. 2010. Computational Topology: An Introduction, American Mathematical Society,p.
View | Files available
 
[217]
2010 | Journal Article | IST-REx-ID: 3901 | OA
Bendich P, Edelsbrunner H, Kerber M. 2010. Computing robustness and persistence for images. IEEE Transactions of Visualization and Computer Graphics. 16(6), 1251–1260.
View | Files available | DOI
 
[216]
2010 | Journal Article | IST-REx-ID: 3964
Cohen Steiner D, Edelsbrunner H, Harer J, Mileyko Y. 2010. Lipschitz functions have L_p-stable persistence. Foundations of Computational Mathematics. 10(2), 127–139.
View | DOI
 
[215]
2009 | Journal Article | IST-REx-ID: 3966
Cohen Steiner D, Edelsbrunner H, Harer J. 2009. Extending persistence using Poincare and Lefschetz duality. Foundations of Computational Mathematics. 9(1), 79–103.
View | DOI
 
[214]
2009 | Conference Paper | IST-REx-ID: 3967
Cohen Steiner D, Edelsbrunner H, Harer J, Morozov D. 2009. Persistent homology for kernels, images, and cokernels. SODA: Symposium on Discrete Algorithms, 1011–1020.
View
 
[213]
2009 | Conference Paper | IST-REx-ID: 3968 | OA
Edelsbrunner H, Harer J. 2009. The persistent Morse complex segmentation of a 3-manifold. 3DPH: Modelling the Physiological Human, LNCS, vol. 5903, 36–50.
View | Files available | DOI
 
[212]
2009 | Book Chapter | IST-REx-ID: 3578
Attali D, Boissonnat J, Edelsbrunner H. 2009.Stability and computation of medial axes: a state-of-the-art report. In: Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration. Mathematics and Visualization, , 109–125.
View | DOI | Download (ext.)
 
[211]
2008 | Book Chapter | IST-REx-ID: 3969
Edelsbrunner H, Harer J. 2008.Persistent homology - a survey. In: Surveys on Discrete and Computational Geometry: Twenty Years Later. Contemporary Mathematics, , 257–282.
View
 
[210]
2008 | Journal Article | IST-REx-ID: 3970
Dequéant M, Ahnert S, Edelsbrunner H, Fink T, Glynn E, Hattem G, Kudlicki A, Mileyko Y, Morton J, Mushegian A, Pachter L, Rowicka M, Shiu A, Sturmfels B, Pourquie O. 2008. Comparison of pattern detection methods in microarray time series of the segmentation clock. PLoS One. 3(8).
View | DOI
 
[209]
2008 | Journal Article | IST-REx-ID: 3971
Edelsbrunner H, Harer J, Mascarenhas A, Pascucci V, Snoeyink J. 2008. Time-varying Reeb graphs for continuous space-time data. Computational Geometry: Theory and Applications. 41(3), 149–166.
View | DOI
 
[208]
2008 | Conference Paper | IST-REx-ID: 3974
Edelsbrunner H, Harer J, Patel A. 2008. Reeb spaces of piecewise linear mappings. SCG: Symposium on Computational Geometry, 242–250.
View | DOI
 
[207]
2008 | Book Chapter | IST-REx-ID: 3577
Biasotti S, Attali D, Boissonnat J, Edelsbrunner H, Elber G, Mortara M, Sanniti Di Baja G, Spagnuolo M, Tanase M, Veltkam R. 2008.Skeletal structures. In: Shape Analysis and Structuring. Mathematics and Visualization, , 145–183.
View | DOI
 
[206]
2007 | Journal Article | IST-REx-ID: 3972
Cohen Steiner D, Edelsbrunner H, Harer J. 2007. Stability of persistence diagrams. Discrete & Computational Geometry. 37(1), 103–120.
View | DOI
 
[205]
2007 | Journal Article | IST-REx-ID: 3973
Cohen Steiner D, Edelsbrunner H. 2007. Inequalities for the curvature of curves and surfaces. Foundations of Computational Mathematics. 7(4), 391–404.
View | DOI
 
[204]
2007 | Conference Paper | IST-REx-ID: 3975
Bendich P, Cohen Steiner D, Edelsbrunner H, Harer J, Morozov D. 2007. Inferring local homology from sampled stratified spaces. FOCS: Foundations of Computer Science, 536–546.
View | DOI
 
[203]
2007 | Journal Article | IST-REx-ID: 3976
Headd J, Ban YEA, Brown P, Edelsbrunner H, Vaidya M, Rudolph J. 2007. Protein-protein interfaces: Properties, preferences, and projections. Journal of Proteome Research. 6(7), 2576–2586.
View | DOI
 
[202]
2007 | Journal Article | IST-REx-ID: 3977
Attali D, Edelsbrunner H. 2007. Inclusion-exclusion formulas from independent complexes. Discrete & Computational Geometry. 37(1), 59–77.
View | DOI
 
[201]
2007 | Conference Paper | IST-REx-ID: 3981
Attali D, Edelsbrunner H, Harer J, Mileyko Y. 2007. Alpha-beta witness complexes. WADS: International Workshop on Algrithms and Data Structures, LNCS, vol. 4619, 386–397.
View | DOI
 
[200]
2007 | Conference Paper | IST-REx-ID: 3561 | OA
Attali D, Edelsbrunner H, Mileyko Y. 2007. Weak witnesses for Delaunay triangulations of submanifolds. SPM: Symposium on Solid and Physical Modeling, 143–150.
View | DOI | Download (ext.)
 
[199]
2006 | Journal Article | IST-REx-ID: 3978
Ban Y, Rudolph J, Zhou P, Edelsbrunner H. 2006. Evaluating the quality of NMR structures by local density of protons. Proteins: Structure, Function and Bioinformatics. 62(4), 852–864.
View | DOI
 
[198]
2006 | Journal Article | IST-REx-ID: 3979
Ban Y, Edelsbrunner H, Rudolph J. 2006. Interface surfaces for protein-protein complexes. Journal of the ACM. 53(3), 361–378.
View | DOI
 
[197]
2006 | Journal Article | IST-REx-ID: 3980
Agarwal P, Edelsbrunner H, Harer J, Wang Y. 2006. Extreme elevation on a 2-manifold. Discrete & Computational Geometry. 36(4), 553–572.
View | DOI
 
[196]
2006 | Patent | IST-REx-ID: 3510
Edelsbrunner H, Fu P, Nekhayev D, Facello M, Williams S. 2006. Method, apparatus and computer program products for automatically generating NURBS models of triangulated surfaces using homeomorphism.
View | DOI | Download (ext.)
 
[195]
2006 | Patent | IST-REx-ID: 3511
Fu P, Nekhayev D, Edelsbrunner H. 2006. Manufacturing methods and systems for rapid production of hearing-aid shells.
View | DOI | Download (ext.)
 
[194]
2006 | Patent | IST-REx-ID: 3512
Fletcher Y, Gloth T, Edelsbrunner H, Fu P. 2006. Method, apparatus and computer products that reconstruct surfaces from data points.
View | DOI | Download (ext.)
 
[193]
2006 | Conference Paper | IST-REx-ID: 3559
Cohen Steiner D, Edelsbrunner H, Morozov D. 2006. Vines and vineyards by updating persistence in linear time. SCG: Symposium on Computational Geometry, 119–126.
View | DOI
 
[192]
2006 | Conference Paper | IST-REx-ID: 3560
Edelsbrunner H, Morozov D, Pascucci V. 2006. Persistence-sensitive simplification of functions on 2-manifolds. SCG: Symposium on Computational Geometry, 127–134.
View | DOI | Download (ext.)
 
[191]
2005 | Conference Paper | IST-REx-ID: 3982
Wang Y, Agarwal P, Brown P, Edelsbrunner H, Rudolph J. 2005. Coarse and reliable geometric alignment for protein docking. PSB: Pacific Symposium on Biocomputing, 64–75.
View | DOI
 
[190]
2005 | Journal Article | IST-REx-ID: 3983
Sohn J, Parks J, Buhrman G, Brown P, Kristjánsdóttir K, Safi A, Edelsbrunner H, Yang W, Rudolph J. 2005. Experimental validation of the docking orientation of Cdc25 with its Cdk2-CycA protein substrate. Biochemistry. 44(50), 16563–16573.
View | DOI
 
[189]
2005 | Patent | IST-REx-ID: 3509
Williams S, Edelsbrunner H, Fu P. 2005. Methods, apparatus and computer program products for modeling three-dimensional colored objects.
View | DOI | Download (ext.)
 
[188]
2005 | Conference Paper | IST-REx-ID: 3557
Edelsbrunner H. 2005. Surface tiling with differential topology. SGP: Eurographics Symposium on Geometry processing, 9–11.
View | DOI | Download (ext.)
 
[187]
2005 | Conference Paper | IST-REx-ID: 3558
Attali D, Cohen Steiner D, Edelsbrunner H. 2005. Extraction and simplification of iso-surfaces in tandem. SGP: Eurographics Symposium on Geometry processing, 139–148.
View | Download (ext.)
 
[186]
2005 | Book Chapter | IST-REx-ID: 3576
Edelsbrunner H, Koehl P. 2005.The geometry of biomolecular solvation. In: Combinatorial and Computational Geometry. Mathematical Sciences Research Institute Publications, vol. 52, 243–275.
View | Download (ext.)
 
[185]
2004 | Journal Article | IST-REx-ID: 3984
Bremer P, Edelsbrunner H, Hamann B, Pascucci V. 2004. A topological hierarchy for functions on triangulated surfaces. IEEE Transactions on Visualization and Computer Graphics. 10(4), 385–396.
View | DOI
 
[184]
2004 | Journal Article | IST-REx-ID: 3985
Cole Mclaughlin K, Edelsbrunner H, Harer J, Natarajan V, Pascucci V. 2004. Loops in Reeb graphs of 2-manifolds. Discrete & Computational Geometry. 32(2), 231–244.
View | DOI
 
[183]
2004 | Journal Article | IST-REx-ID: 3986
Bryant R, Edelsbrunner H, Koehl P, Levitt M. 2004. The area derivative of a space-filling diagram. Discrete & Computational Geometry. 32(3), 293–308.
View | DOI
 
[182]
2004 | Journal Article | IST-REx-ID: 3987
Natarajan V, Edelsbrunner H. 2004. Simplification of three-dimensional density maps. IEEE Transactions on Visualization and Computer Graphics. 10(5), 587–597.
View | DOI
 
[181]
2004 | Conference Paper | IST-REx-ID: 3988
Choi V, Agarwal P, Edelsbrunner H, Rudolph J. 2004. Local search heuristic for rigid protein docking. WABI: 4th International Workshop on Algorithms in Bioinformatics, LNCS, vol. 3240, 218–229.
View | DOI
 
[180]
2004 | Conference Paper | IST-REx-ID: 3989
Edelsbrunner H, Harer J, Natarajan V, Pascucci V. 2004. Local and global comparison of continuous functions. VIS: IEEE Visualization, 275–280.
View | DOI
 
[179]
2004 | Journal Article | IST-REx-ID: 3990
Agarwal P, Edelsbrunner H, Wang Y. 2004. Computing the writhing number of a polygonal knot. Discrete & Computational Geometry. 32(1), 37–53.
View | DOI
 
[178]
2004 | Book Chapter | IST-REx-ID: 3574
Edelsbrunner H. 2004.Biological applications of computational topology. In: Handbook of Discrete and Computational Geometry. , 1395–1412.
View | Download (ext.)
 
[177]
2004 | Book Chapter | IST-REx-ID: 3575
Edelsbrunner H, Harer J. 2004.Jacobi sets of multiple Morse functions. In: Foundations of Computational Mathematics. London Mathematical Society Lecture Note, vol. 312, 37–57.
View | DOI
 
[176]
2003 | Book Chapter | IST-REx-ID: 3991
Cheng H, Edelsbrunner H. 2003.Area and perimeter derivatives of a union of disks. In: Computer Science in Perspective: Essays Dedicated to Thomas Ottmann. LNCS, vol. 2598, 88–97.
View | DOI
 
[175]
2003 | Journal Article | IST-REx-ID: 3992
Edelsbrunner H, Koehl P. 2003. The weighted-volume derivative of a space-filling diagram. PNAS. 100(5), 2203–2208.
View | DOI
 
[174]
2003 | Journal Article | IST-REx-ID: 3993
Edelsbrunner H, Harer J, Zomorodian A. 2003. Hierarchical Morse-Smale complexes for piecewise linear 2-manifolds. Discrete & Computational Geometry. 30(1), 87–107.
View | DOI
 
[173]
2003 | Journal Article | IST-REx-ID: 3994
Cheng H, Edelsbrunner H. 2003. Area, perimeter and derivatives of a skin curve. Computational Geometry: Theory and Applications. 26(2), 173–192.
View | DOI
 
[172]
2003 | Conference Paper | IST-REx-ID: 3997
Bremer P, Edelsbrunner H, Hamann B, Pascucci V. 2003. A multi-resolution data structure for two-dimensional Morse-Smale functions. VIS: IEEE Visualization, 139–146.
View | DOI
 
[171]
2003 | Conference Paper | IST-REx-ID: 3999
Edelsbrunner H, Üngör A. 2003. Relaxed scheduling in dynamic skin triangulation. JCDCG: Japanese Conference on Discrete and Computational Geometry, LNCS, vol. 2866, 135–151.
View | DOI
 
[170]
2003 | Conference Paper | IST-REx-ID: 3556
Edelsbrunner H, Harer J, Natarajan V, Pascucci V. 2003. Morse-Smale complexes for piecewise linear 3-manifolds. SCG: Symposium on Computational Geometry, 361–370.
View | DOI | Download (ext.)
 
[169]
2003 | Book Chapter | IST-REx-ID: 3573
Edelsbrunner H. 2003.Surface reconstruction by wrapping finite sets in space. In: Discrete & Computational Geometry. , 379–404.
View | DOI | Download (ext.)
 
[168]
2003 | Journal Article | IST-REx-ID: 3584
Edelsbrunner H, Zomorodian A. 2003. Computing linking numbers of a filtration. Homology, Homotopy and Applications. 5(2), 19–37.
View | Download None (ext.)
 
[167]
2002 | Journal Article | IST-REx-ID: 3995
Agarwal P, Guibas L, Edelsbrunner H, Erickson J, Isard M, Har Peled S, Hershberger J, Jensen C, Kavraki L, Koehl P, Lin M, Manocha D, Metaxas D, Mirtich B, Mount D, Muthukrishnan S, Pai D, Sacks E, Snoeyink J, Suri S, Wolefson O. 2002. Algorithmic issues in modeling motion. ACM Computing Surveys. 34(4), 550–572.
View | DOI
 
[166]
2002 | Journal Article | IST-REx-ID: 3996
Edelsbrunner H, Letscher D, Zomorodian A. 2002. Topological persistence and simplification. Discrete & Computational Geometry. 28(4), 511–533.
View | DOI
 
[165]
2002 | Journal Article | IST-REx-ID: 3998
Edelsbrunner H, Guoy D. 2002. An experimental study of sliver exudation. Engineering with Computers. 18(3), 229–240.
View | DOI
 
[164]
2002 | Journal Article | IST-REx-ID: 4000
Zomorodian A, Edelsbrunner H. 2002. Fast software for box intersections. International Journal of Computational Geometry and Applications. 12(1–2), 143–172.
View | DOI
 
[163]
2002 | Conference Paper | IST-REx-ID: 4003
Agarwal P, Edelsbrunner H, Wang Y. 2002. Computing the writhing number of a polygonal knot. SODA: Symposium on Discrete Algorithms, 791–799.
View
 
[162]
2002 | Patent | IST-REx-ID: 3508
Edelsbrunner H, Fu P. 2002. Methods of generating three-dimensional digital models of objects by wrapping point cloud data points.
View | DOI | Download (ext.)
 
[161]
2001 | Journal Article | IST-REx-ID: 4001
Cheng H, Edelsbrunner H, Fu P. 2001. Shape space from deformation. Computational Geometry: Theory and Applications. 19(2–3), 191–204.
View | DOI
 
[160]
2001 | Journal Article | IST-REx-ID: 4002
Cheng S, Edelsbrunner H, Fu P, Lam K. 2001. Design and analysis of planar shape deformation. Computational Geometry: Theory and Applications. 19(2–3), 205–218.
View | DOI
 
[159]
2001 | Conference Paper | IST-REx-ID: 4005
Cheng H, Dey T, Edelsbrunner H, Sullivan J. 2001. Dynamic skin triangulation. SODA: Symposium on Discrete Algorithms, 47–56.
View
 
[158]
2001 | Journal Article | IST-REx-ID: 4006
Edelsbrunner H. 2001. 180 wrapped tubes. Journal of Universal Computer Science. 7(5), 379–399.
View | DOI
 
[157]
2001 | Journal Article | IST-REx-ID: 4007
Cheng H, Dey T, Edelsbrunner H, Sullivan J. 2001. Dynamic skin triangulation. Discrete & Computational Geometry. 25(4), 525–568.
View | DOI
 
[156]
2001 | Patent | IST-REx-ID: 3507
Liang J, Edelsbrunner H. 2001. Molecular classification for property prediction.
View | DOI | Download (ext.)
 
[155]
2001 | Book | IST-REx-ID: 3586
Edelsbrunner H. 2001. Geometry and Topology for Mesh Generation, Cambridge University Press, 190p.
View | Files available | DOI
 
[154]
2000 | Journal Article | IST-REx-ID: 4004
Edelsbrunner H, Grayson D. 2000. Edgewise subdivision of a simplex. Discrete & Computational Geometry. 24(4), 707–719.
View | DOI
 
[153]
2000 | Conference Paper | IST-REx-ID: 4008
Edelsbrunner H, Letscher D, Zomorodian A. 2000. Topological persistance and simplification. FOCS: Foundations of Computer Science, 454–463.
View | DOI
 
[152]
2000 | Journal Article | IST-REx-ID: 4009
Edelsbrunner H, Waupotitsch R. 2000. Adaptive simplicial grids from cross-sections of monotone complexes. International Journal of Computational Geometry and Applications. 10(3), 267–284.
View | DOI
 
[151]
2000 | Journal Article | IST-REx-ID: 4010
Cheng S, Dey T, Edelsbrunner H, Facello M, Teng S. 2000. Sliver exudation. Journal of the ACM. 47(5), 883–904.
View | DOI
 
[150]
2000 | Conference Paper | IST-REx-ID: 3555
Edelsbrunner H, Li X, Miller G, Stathopoulos A, Talmor D, Teng S, Üngör A, Walkington N. 2000. Smoothing and cleaning up slivers. STOC: Symposium on the Theory of Computing, 273–277.
View | DOI | Download (ext.)
 
[149]
2000 | Book Chapter | IST-REx-ID: 3572
Edelsbrunner H. 2000.Spielereien mit Kreisen und Kugeln. Zum Thema Form und Verformung. In: Zur Kunst des formalen Denkens. , 153–171.
View | Download (ext.)
 
[148]
2000 | Journal Article | IST-REx-ID: 3583
Edelsbrunner H. 2000. Triangulations and meshes in computational geometry. Acta Numerica. 9, 133–213.
View | Download (ext.)
 
[147]
1999 | Journal Article | IST-REx-ID: 4014
Edelsbrunner H. 1999. Deformable smooth surface design. Discrete & Computational Geometry. 21(1), 87–115.
View | DOI
 
[146]
1999 | Conference Paper | IST-REx-ID: 3554
Jiao X, Edelsbrunner H, Heath M. 1999. Mesh association: formulation and algorithms. IMR: International Meshing Roundtable, 75–82.
View | Download (ext.)
 
[145]
1999 | Book Chapter | IST-REx-ID: 3571
Dey T, Edelsbrunner H, Guha S. 1999.Computational topology. In: Advances in Discrete and Computational Geometry. Contemporary Mathematics, vol. 223, 109–143.
View | Download (ext.)
 
[144]
1999 | Journal Article | IST-REx-ID: 3582
Dey T, Edelsbrunner H, Guha S, Nekhayev D. 1999. Topology preserving edge contraction. Publications de l’Institut Mathématique. 66, 23–45.
View | Download (ext.)
 
[143]
1998 | Journal Article | IST-REx-ID: 4011
Liang J, Edelsbrunner H, Fu P, Sudhakar P, Subramaniam S. 1998. Analytical shape computation of macromolecules: I. molecular area and volume through alpha shape. Proteins: Structure, Function and Bioinformatics. 33(1), 1–17.
View | DOI
 
[142]
1998 | Journal Article | IST-REx-ID: 4012
Liang J, Edelsbrunner H, Fu P, Sudhakar P, Subramaniam S. 1998. Analytical shape computation of macromolecules: II. Inaccessible cavities in proteins. Proteins: Structure, Function and Bioinformatics. 33(1), 18–29.
View | DOI
 
[141]
1998 | Journal Article | IST-REx-ID: 4013
Edelsbrunner H, Facello M, Liang J. 1998. On the definition and the construction of pockets in macromolecules. Discrete Applied Mathematics. 88(1–3), 83–102.
View | DOI
 
[140]
1998 | Conference Paper | IST-REx-ID: 4015
Edelsbrunner H. 1998. Shape reconstruction with Delaunay complex. LATIN: Latin American Symposium on Theoretical Informatics , LNCS, vol. 1380, 119–132.
View | DOI
 
[139]
1998 | Conference Paper | IST-REx-ID: 4016
Edelsbrunner H, Facello M, Fu P, Qian J, Nekhayev D. 1998. Wrapping 3D scanning data. Three-Dimensional Image Capture and Applications, SPIE, vol. 3313, 148–158.
View | DOI
 
[138]
1998 | Journal Article | IST-REx-ID: 4017 | OA
Liang J, Edelsbrunner H, Woodward C. 1998. Anatomy of protein pockets and cavities: Measurement of binding site geometry and implications for ligand design. Protein Science. 7(9), 1884–1897.
View | DOI | Download (ext.)
 
[137]
1998 | Conference Paper | IST-REx-ID: 4019
Cheng H, Edelsbrunner H, Fu P. 1998. Shape space from deformation. CGA: Conference on Computer Graphics and Applications , 104–113.
View | DOI
 
[136]
1998 | Book Chapter | IST-REx-ID: 4020
Edelsbrunner H. 1998.Geometry for modeling biomolecules. In: Robotics: The Algorithmic Perspective. , 265–277.
View
 
[135]
1998 | Patent | IST-REx-ID: 3506
Edelsbrunner H, Fu P. 1998. Apparatus and method for geometric morphing.
View | DOI | Download (ext.)
 
[134]
1998 | Book Chapter | IST-REx-ID: 3570
Axen U, Edelsbrunner H. 1998.Auditory Morse analysis of triangulated manifolds. In: Mathematical Visualization. , 223–236.
View | DOI
 
[133]
1997 | Journal Article | IST-REx-ID: 4018
Edelsbrunner H, Shah N. 1997. Triangulating topological spaces. International Journal of Computational Geometry and Applications. 7(4), 365–378.
View | DOI
 
[132]
1997 | Journal Article | IST-REx-ID: 4021
Edelsbrunner H, Waupotitsch R. 1997. A combinatorial approach to cartograms. Computational Geometry: Theory and Applications. 7(5–6), 343–360.
View | DOI
 
[131]
1997 | Journal Article | IST-REx-ID: 4022
Edelsbrunner H, Valtr P, Welzl E. 1997. Cutting dense point sets in half. Discrete & Computational Geometry. 17(3), 243–255.
View | DOI
 
[130]
1997 | Journal Article | IST-REx-ID: 4023
Edelsbrunner H, Ramos E. 1997. Inclusion-exclusion complexes for pseudodisk collections. Discrete & Computational Geometry. 17(3), 287–306.
View | DOI
 
[129]
1996 | Journal Article | IST-REx-ID: 4024
Akkiraju N, Edelsbrunner H, Fu P, Qian J. 1996. Viewing geometric protein structures from inside a CAVE. IEEE Computer Graphics and Applications. 16(4), 58–61.
View | DOI
 
[128]
1996 | Journal Article | IST-REx-ID: 4025
Akkiraju N, Edelsbrunner H. 1996. Triangulating the surface of a molecule. Discrete Applied Mathematics. 71(1–3), 5–22.
View | DOI
 
[127]
1996 | Journal Article | IST-REx-ID: 4026
Edelsbrunner H, Shah N. 1996. Incremental topological flipping works for regular triangulations. Algorithmica. 15(3), 223–241.
View | DOI
 
[126]
1996 | Journal Article | IST-REx-ID: 4027
Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Stolfi J. 1996. Lines in space: Combinatorics and algorithms. Algorithmica. 15(5), 428–447.
View | DOI
 
[125]
1996 | Conference Poster | IST-REx-ID: 4030
Liang J, Edelsbrunner H, Subramaniam S. 1996. Effects of molecular shape representations on boundary element method for protein electrostatics computations, Cell Press,p.
View | DOI
 
[124]
1996 | Conference Poster | IST-REx-ID: 4031
Liang J, Edelsbrunner H, Pamidghantam S, Subramaniam S. 1996. Analytical method for molecular shapes: Area, volume, cavities, interface and pockets, Cell Press,p.
View | DOI
 
[123]
1996 | Conference Paper | IST-REx-ID: 3553
Edelsbrunner H, Fu P, Quian J. 1996. Geometric modeling in CAVE. VRST: Symposium on Virtual Reality Software and Technology, 35-41 and-193–194.
View | Download (ext.)
 
[122]
1995 | Journal Article | IST-REx-ID: 4028
Edelsbrunner H. 1995. The union of balls and its dual shape. Discrete & Computational Geometry. 13(1), 415–440.
View | DOI
 
[121]
1995 | Journal Article | IST-REx-ID: 4029
Delfinado C, Edelsbrunner H. 1995. An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere. Computer Aided Geometric Design. 12(7), 771–784.
View | DOI
 
[120]
1995 | Conference Paper | IST-REx-ID: 4034
Edelsbrunner H. 1995. Algebraic decomposition of non-convex polyhedra. FOCS: Foundations of Computer Science, 248–257.
View
 
[119]
1995 | Journal Article | IST-REx-ID: 4035
Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Sharir M, Welzl E. 1995. Improved bounds on weak ε-nets for convex sets. Discrete & Computational Geometry. 13(1), 1–15.
View | DOI
 
[118]
1995 | Conference Paper | IST-REx-ID: 3551
Edelsbrunner H, Facello M, Fu P, Liang J. 1995. Measuring proteins and voids in proteins. HICSS: Hawaii International Conference on System Sciences, 256–264.
View | DOI
 
[117]
1995 | Conference Paper | IST-REx-ID: 3552
Akkiraju N, Edelsbrunner H, Facello M, Fu P, Mücke E, Varela C. 1995. Alpha shapes: definition and software. GCG: International Computational Geometry Software Workshop, 63–66.
View | Download (ext.)
 
[116]
1994 | Journal Article | IST-REx-ID: 4032
Dey T, Edelsbrunner H. 1994. Counting triangle crossings and halving planes. Discrete & Computational Geometry. 12(1), 281–289.
View | DOI
 
[115]
1994 | Journal Article | IST-REx-ID: 4033
Chazelle B, Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M. 1994. Selecting heavily covered points. SIAM Journal on Computing. 23(6), 1138–1151.
View | DOI
 
[114]
1994 | Journal Article | IST-REx-ID: 4037
Edelsbrunner H, Mücke E. 1994. Three-dimensional alpha shapes. ACM Transactions on Graphics. 13(1), 43–72.
View | DOI
 
[113]
1994 | Journal Article | IST-REx-ID: 4038
Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1994. Algorithms for bichromatic line-segment problems and polyhedral terrains. Algorithmica. 11(2), 116–132.
View | DOI
 
[112]
1994 | Journal Article | IST-REx-ID: 4039
Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Hershberger J, Sharir M, Snoeyink J. 1994. Ray shooting in polygons using geodesic triangulations. Algorithmica. 12(1), 54–68.
View | DOI
 
[111]
1994 | Conference Paper | IST-REx-ID: 3550
Edelsbrunner H. 1994. Modeling with simplicial complexes (topology, geometry and algorithms). CCCG: Canadian Conference on Computational Geometry, 36–44.
View | Download (ext.)
 
[110]
1993 | Journal Article | IST-REx-ID: 4036
Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Snoeyink J. 1993. Computing a face in an arrangement of line segments and related problems. SIAM Journal on Computing. 22(6), 1286–1302.
View | DOI
 
[109]
1993 | Journal Article | IST-REx-ID: 4040
Edelsbrunner H, Tan T. 1993. An upper bound for conforming Delaunay triangulations. Discrete & Computational Geometry. 10(1), 197–213.
View | DOI
 
[108]
1993 | Journal Article | IST-REx-ID: 4041
Edelsbrunner H, Seidel R, Sharir M. 1993. On the zone theorem for hyperplane arrangements. SIAM Journal on Computing. 22(2), 418–429.
View | DOI
 
[107]
1993 | Journal Article | IST-REx-ID: 4042
Edelsbrunner H, Tan T. 1993. A quadratic time algorithm for the minmax length triangulation. SIAM Journal on Computing. 22(3), 527–551.
View | DOI
 
[106]
1993 | Journal Article | IST-REx-ID: 4044
Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan T. 1993. Edge insertion for optimal triangulations. Discrete & Computational Geometry. 10(1), 47–65.
View | DOI
 
[105]
1993 | Journal Article | IST-REx-ID: 4045
Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1993. Diameter, width, closest line pair, and parametric searching. Discrete & Computational Geometry. 10(1), 183–196.
View | DOI
 
[104]
1993 | Book Chapter | IST-REx-ID: 3568
Edelsbrunner H. 1993.Geometric algorithms. In: Handbook of Convex Geometry. , 699–735.
View | Download (ext.)
 
[103]
1993 | Book Chapter | IST-REx-ID: 3569
Edelsbrunner H. 1993.Computational geometry. In: Current Trends in Theoretical Computer Science, Essays and Tutorials. , 1–48.
View | DOI
 
[102]
1992 | Journal Article | IST-REx-ID: 4043
Edelsbrunner H, Tan T, Waupotitsch R. 1992. An O(n^2 log n) time algorithm for the MinMax angle triangulation. SIAM Journal on Scientific Computing. 13(4), 994–1008.
View | DOI
 
[101]
1992 | Journal Article | IST-REx-ID: 4046
Chazelle B, Edelsbrunner H. 1992. An optimal algorithm for intersecting line segments in the plane. Journal of the ACM. 39(1), 1–54.
View | DOI
 
[100]
1992 | Journal Article | IST-REx-ID: 4047
Edelsbrunner H, Guibas L, Pach J, Pollack R, Seidel R, Sharir M. 1992. Arrangements of curves in the plane - topology, combinatorics, and algorithms. Theoretical Computer Science. 92(2), 319–336.
View | DOI
 
[99]
1992 | Journal Article | IST-REx-ID: 4048
Aggarwal A, Edelsbrunner H, Raghavan P, Tiwari P. 1992. Optimal time bounds for some proximity problems in the plane. Information Processing Letters. 42(1), 55–60.
View | DOI
 
[98]
1992 | Conference Paper | IST-REx-ID: 4049
Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan T. 1992. Edge insertion for optimal triangulations. LATIN: Latin American Symposium on Theoretical Informatics , LNCS, vol. 583, 46–60.
View | DOI
 
[97]
1992 | Journal Article | IST-REx-ID: 4050
Edelsbrunner H. 1992. Guest editor’s foreword. Discrete & Computational Geometry. 8(1), 217–217.
View | DOI
 
[96]
1992 | Journal Article | IST-REx-ID: 4053
Aronov B, Edelsbrunner H, Guibas L, Sharir M. 1992. The number of edges of many faces in a line segment arrangement. Combinatorica. 12(3), 261–274.
View | DOI
 
[95]
1992 | Journal Article | IST-REx-ID: 3581
Chazelle B, Edelsbrunner H, Guibas L, Pollack R, Seidel R, Sharir M, Snoeyink J. 1992. Counting and cutting cycles of lines and rods in space. Computational Geometry: Theory and Applications. 1(6), 305–323.
View | DOI
 
[94]
1991 | Journal Article | IST-REx-ID: 4051
Edelsbrunner H, Shi W. 1991. An O(n log^2 h) time algorithm for the three-dimensional convex hull problem. SIAM Journal on Computing. 20(2), 259–269.
View | DOI
 
[93]
1991 | Journal Article | IST-REx-ID: 4052
Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1991. A singly exponential stratification scheme for real semi-algebraic varieties and its applications. Theoretical Computer Science. 84(1), 77–105.
View | DOI
 
[92]
1991 | Conference Paper | IST-REx-ID: 4054
Edelsbrunner H, Seidel R, Sharir M. 1991. On the zone theorem for hyperplane arrangements. New Results and New Trends in Computer Science , LNCS, vol. 555, 108–123.
View | DOI
 
[91]
1991 | Conference Paper | IST-REx-ID: 4055
Edelsbrunner H, Tan T. 1991. A quadratic time algorithm for the minmax length triangulation. FOCS: Foundations of Computer Science, 414–423.
View | DOI
 
[90]
1991 | Journal Article | IST-REx-ID: 4056
Edelsbrunner H, Hajnal P. 1991. A lower bound on the number of unit distances between the vertices of a convex polygon. Journal of Combinatorial Theory Series A. 56(2), 312–316.
View | DOI
 
[89]
1991 | Journal Article | IST-REx-ID: 4057
Edelsbrunner H. 1991. Corrigendum. Journal of Computer and System Sciences. 42(2), 249–251.
View | DOI
 
[88]
1991 | Conference Paper | IST-REx-ID: 4058
Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Snoeyink J. 1991. Computing a face in an arrangement of line segments. SODA: Symposium on Discrete Algorithms, 441–448.
View
 
[87]
1991 | Conference Paper | IST-REx-ID: 4059
Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Hershberger J, Sharir M, Snoeyink J. 1991. Ray shooting in polygons using geodesic triangulations. ICALP: Automata, Languages and Programming, LNCS, vol. 510, 661–673.
View | DOI
 
[86]
1991 | Journal Article | IST-REx-ID: 4061
Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. 1991. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete & Computational Geometry. 6(1), 407–422.
View | DOI
 
[85]
1991 | Journal Article | IST-REx-ID: 4062
Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. 1991. Points and triangles in the plane and halving planes in space. Discrete & Computational Geometry. 6(1), 435–442.
View | DOI
 
[84]
1991 | Book Chapter | IST-REx-ID: 3566
Edelsbrunner H, Sharir M. 1991.A hyperplane incidence problem with applications to counting distances. In: Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 4, 253–263.
View | Download (ext.)
 
[83]
1991 | Book Chapter | IST-REx-ID: 3567
Edelsbrunner H. 1991.Lines in space – A collection of results. In: Discrete & Computational Geometry. DIAMCS Series in Discrete Mathematics and Theoretical Computer Science, vol. 6, 77–93.
View | Download (ext.)
 
[82]
1990 | Journal Article | IST-REx-ID: 4060
Edelsbrunner H, Preparata F, West D. 1990. Tetrahedrizing point sets in three dimensions. Journal of Symbolic Computation. 10(3–4), 335–347.
View | DOI | Download (ext.)
 
[81]
1990 | Journal Article | IST-REx-ID: 4063
Edelsbrunner H, Mücke E. 1990. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics. 9(1), 66–104.
View | DOI
 
[80]
1990 | Journal Article | IST-REx-ID: 4064
Edelsbrunner H, Souvaine D. 1990. Computing least median of squares regression lines and guided topological sweep. Journal of the American Statistical Association. 85(409), 115–119.
View | DOI
 
[79]
1990 | Journal Article | IST-REx-ID: 4065
Edelsbrunner H, Robison A, Shen X. 1990. Covering convex sets with non-overlapping polygons. Discrete Mathematics. 81(2), 153–164.
View | DOI
 
[78]
1990 | Journal Article | IST-REx-ID: 4066
Edelsbrunner H, Guibas L, Sharir M. 1990. The complexity of many cells in arrangements of planes and related problems. Discrete & Computational Geometry. 5(1), 197–216.
View | DOI
 
[77]
1990 | Conference Paper | IST-REx-ID: 4067
Edelsbrunner H, Sharir M. 1990. A hyperplane Incidence problem with applications to counting distances. SIGAL:  Special Interest Group on Algorithms, International Symposium on Algorithms  , LNCS, vol. 450, 419–428.
View | DOI
 
[76]
1990 | Journal Article | IST-REx-ID: 4068
Edelsbrunner H, Sharir M. 1990. The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2. Discrete & Computational Geometry. 5(1), 35–42.
View | DOI
 
[75]
1990 | Journal Article | IST-REx-ID: 4069
Edelsbrunner H. 1990. An acyclicity theorem for cell complexes in d dimension. Combinatorica. 10(3), 251–260.
View | DOI
 
[74]
1990 | Journal Article | IST-REx-ID: 4070
Edelsbrunner H, Overmars M, Welzl E, Hartman I, Feldman J. 1990. Ranking intervals under visibility constraints. International Journal of Computer Mathematics. 34(3–4), 129–144.
View | DOI
 
[73]
1990 | Conference Paper | IST-REx-ID: 4071
Edelsbrunner H, Tan T, Waupotitsch R. 1990. An O(n^2log n) time algorithm for the MinMax angle triangulation. SCG: Symposium on Computational Geometry, 44–52.
View | DOI
 
[72]
1990 | Journal Article | IST-REx-ID: 4072
Edelsbrunner H, Guibas L, Sharir M. 1990. The complexity and construction of many faces in arrangements of lines and of segments. Discrete & Computational Geometry. 5(1), 161–196.
View | DOI
 
[71]
1990 | Conference Paper | IST-REx-ID: 4073
Chazelle B, Edelsbrunner H, Guibas L, Pollack R, Seidel R, Sharir M, Snoeyink J. 1990. Counting and cutting cycles of lines and rods in space. FOCS: Foundations of Computer Science, 242–251.
View | DOI
 
[70]
1990 | Journal Article | IST-REx-ID: 4074
Clarkson K, Edelsbrunner H, Guibas L, Sharir M, Welzl E. 1990. Combinatorial complexity bounds for arrangements of curves and spheres. Discrete & Computational Geometry. 5(1), 99–160.
View | DOI
 
[69]
1990 | Journal Article | IST-REx-ID: 4075
Dobkin D, Edelsbrunner H, Overmars M. 1990. Searching for empty convex polygons. Algorithmica. 5(4), 561–571.
View | DOI
 
[68]
1990 | Conference Paper | IST-REx-ID: 4076
Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. 1990. Euclidean minimum spanning trees and bichromatic closest pairs. SCG: Symposium on Computational Geometry, 203–210.
View | DOI
 
[67]
1990 | Conference Paper | IST-REx-ID: 4077
Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. 1990. Points and triangles in the plane and halving planes in space. SCG: Symposium on Computational Geometry, 112–115.
View | DOI
 
[66]
1990 | Conference Paper | IST-REx-ID: 4078
Chazelle B, Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M. 1990. Slimming down by adding; selecting heavily covered points. SCG: Symposium on Computational Geometry, 116–127.
View | DOI
 
[65]
1990 | Book Chapter | IST-REx-ID: 3565
Dobkin D, Edelsbrunner H, Yap C. 1990.Probing convex polytopes. In: Autonomous Robot Vehicles. , 328–341.
View | DOI
 
[64]
1989 | Journal Article | IST-REx-ID: 4079
Edelsbrunner H, Skiena S. 1989. On the number of furthest neighbor pairs in a point set. American Mathematical Monthly. 96(7), 614–618.
View | Download (ext.)
 
[63]
1989 | Journal Article | IST-REx-ID: 4080
Edelsbrunner H, Hasan N, Seidel R, Shen X. 1989. Circles through two points that always enclose many points. Geometriae Dedicata. 32(1), 1–12.
View | DOI
 
[62]
1989 | Journal Article | IST-REx-ID: 4081
Edelsbrunner H, Guibas L, Sharir M. 1989. The upper envelope of piecewise linear functions: Algorithms and applications. Discrete & Computational Geometry. 4(1), 311–336.
View | DOI
 
[61]
1989 | Journal Article | IST-REx-ID: 4082
Edelsbrunner H, Guibas L. 1989. Topologically sweeping an arrangement. Journal of Computer and System Sciences. 38(1), 165–194.
View | DOI
 
[60]
1989 | Journal Article | IST-REx-ID: 4083
Yao F, Dobkin D, Edelsbrunner H, Paterson M. 1989. Partitioning space for range queries. SIAM Journal on Computing. 18(2), 371–384.
View | DOI
 
[59]
1989 | Journal Article | IST-REx-ID: 4084
Edelsbrunner H, Rote G, Welzl E. 1989. Testing the necklace condition for shortest tours and optimal factors in the plane. Theoretical Computer Science. 66(2), 157–180.
View | DOI
 
[58]
1989 | Conference Paper | IST-REx-ID: 4085
Edelsbrunner H. 1989. An acyclicity theorem for cell complexes in d dimension. SCG: Symposium on Computational Geometry, 145–151.
View | DOI
 
[57]
1989 | Journal Article | IST-REx-ID: 4086
Edelsbrunner H. 1989. The upper envelope of piecewise linear functions: Tight bounds on the number of faces . Discrete & Computational Geometry. 4(4), 337–343.
View | DOI
 
[56]
1989 | Conference Paper | IST-REx-ID: 4087
Edelsbrunner H, Preparata F, West D. 1989. Tetrahedrizing point sets in three dimensions. ISSAC: International Symposium on Symbolic and Algebraic Computation, LNCS, vol. 358, 315–331.
View | DOI
 
[55]
1989 | Journal Article | IST-REx-ID: 4088
Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M, Snoeyink J, Welzl E. 1989. Implicitly representing arrangements of lines or segments. Discrete & Computational Geometry. 4(1), 433–466.
View | DOI
 
[54]
1989 | Journal Article | IST-REx-ID: 4089
Edelsbrunner H, Guibas L, Hershberger J, Pach J, Pollack R, Seidel R, Sharir M, Snoeyink J. 1989. On arrangements of Jordan arcs with three intersections per pair. Discrete & Computational Geometry. 4(1), 523–539.
View | DOI
 
[53]
1989 | Conference Paper | IST-REx-ID: 4092
Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1989. A singly exponential stratification scheme for real semi-algebraic varieties and its applications. ICALP: Automata, Languages and Programming, LNCS, vol. 372, 179–193.
View | DOI
 
[52]
1989 | Journal Article | IST-REx-ID: 4093
Chazelle B, Edelsbrunner H, Guibas L. 1989. The complexity of cutting complexes. Discrete & Computational Geometry. 4(1), 139–181.
View | DOI
 
[51]
1989 | Conference Paper | IST-REx-ID: 3549
Edelsbrunner H. 1989. Spatial triangulations with dihedral angle conditions. International Workshop on Discrete Algorithms and Complexity, 83–89.
View
 
[50]
1988 | Journal Article | IST-REx-ID: 4090
Edelsbrunner H, Preparata F. 1988. Minimum polygonal separation. Information and Computation. 77(3), 218–232.
View | DOI
 
[49]
1988 | Journal Article | IST-REx-ID: 4091
Edelsbrunner H, Skiena S. 1988. Probing convex polygons with X-Rays. SIAM Journal on Computing. 17(5), 870–882.
View | DOI
 
[48]
1988 | Conference Paper | IST-REx-ID: 4096
Edelsbrunner H. 1988. Geometric structures in computational geometry. ALP: Automata, Languages and Programming, LNCS, vol. 317, 201–213.
View | DOI
 
[47]
1988 | Conference Paper | IST-REx-ID: 4097
Edelsbrunner H, Guibas L, Pach J, Pollack R, Seidel R, Sharir M. 1988. Arrangements of curves in the plane - topology, combinatorics, and algorithms. ICALP: Automata, Languages and Programming, LNCS, vol. 317, 214–229.
View | DOI
 
[46]
1987 | Book | IST-REx-ID: 3900
Edelsbrunner H. 1987. Algorithms in Combinatorial Geometry, Springer,p.
View | Files available
 
[45]
1987 | Journal Article | IST-REx-ID: 4094
Edelsbrunner H, Shen X. 1987. A tight lower bound on the size of visibility graphs. Information Processing Letters. 26(2), 61–64.
View | DOI
 
[44]
1987 | Journal Article | IST-REx-ID: 4095
Chazelle B, Edelsbrunner H. 1987. An improved algorithm for constructing kth-order Voronoi diagrams. IEEE Transactions on Computers. 36(11), 1349–1354.
View | DOI
 
[43]
1987 | Journal Article | IST-REx-ID: 4100
Chazelle B, Edelsbrunner H. 1987. Linear space data structures for two types of range search. Discrete & Computational Geometry. 2(1), 113–126.
View | DOI
 
[42]
1987 | Journal Article | IST-REx-ID: 4101
Edelsbrunner H, Overmars M. 1987. Zooming by repeated range detection. Information Processing Letters. 24(6), 413–417.
View | DOI
 
[41]
1987 | Journal Article | IST-REx-ID: 4102
Dobkin D, Edelsbrunner H. 1987. Space searching for intersecting objects. Journal of Algorithms. 8(3), 348–361.
View | DOI
 
[40]
1987 | Conference Paper | IST-REx-ID: 3514
Edelsbrunner H, Pach J, Schwartz J, Sharir M. 1987. On the lower envelope of bivariate functions and its applications. FOCS: Foundations of Computer Science, 27–37.
View | DOI
 
[39]
1986 | Journal Article | IST-REx-ID: 4098
Edelsbrunner H, Stöckl G. 1986. The number of extreme pairs of finite point-sets in Euclidean spaces. Journal of Combinatorial Theory Series A. 43(2), 344–349.
View | DOI
 
[38]
1986 | Journal Article | IST-REx-ID: 4099
Edelsbrunner H, Welzl E. 1986. Halfplanar range search in linear space and O(n0.695) query time. Information Processing Letters. 23(5), 289–293.
View | DOI
 
[37]
1986 | Journal Article | IST-REx-ID: 4103
Edelsbrunner H, Welzl E. 1986. On the maximal number of edges of many faces in an arrangement. Journal of Combinatorial Theory Series A. 41(2), 159–166.
View | DOI
 
[36]
1986 | Journal Article | IST-REx-ID: 4104
Edelsbrunner H, Guibas L, Stolfi J. 1986. Optimal point location in a monotone subdivision. SIAM Journal on Computing. 15(2), 317–340.
View | DOI
 
[35]
1986 | Journal Article | IST-REx-ID: 4105
Edelsbrunner H, O’Rourke J, Seidel R. 1986. Constructing arrangements of lines and hyperplanes with applications. SIAM Journal on Computing. 15(2), 341–363.
View | DOI
 
[34]
1986 | Journal Article | IST-REx-ID: 4106
Edelsbrunner H, Waupotitsch R. 1986. Computing a ham-sandwich cut in two dimensions. Journal of Symbolic Computation. 2(2), 171–178.
View | DOI
 
[33]
1986 | Journal Article | IST-REx-ID: 4107
Edelsbrunner H, Haussler D. 1986. The complexity of cells in 3-dimensional arrangements. Discrete Mathematics. 60(C), 139–146.
View | DOI
 
[32]
1986 | Journal Article | IST-REx-ID: 4108
Edelsbrunner H, Seidel R. 1986. Voronoi diagrams and arrangements. Discrete & Computational Geometry. 1(1), 25–44.
View | DOI
 
[31]
1986 | Journal Article | IST-REx-ID: 4109
Edelsbrunner H, Haring G, Hilbert D. 1986. Rectangular point location in d-dimensions with applications. Computer Journal. 29(1), 76–82.
View | DOI
 
[30]
1986 | Journal Article | IST-REx-ID: 4110
Edelsbrunner H, Welzl E. 1986. Constructing belts in two-dimensional arrangements with applications. SIAM Journal on Computing. 15(1), 271–284.
View | DOI
 
[29]
1986 | Journal Article | IST-REx-ID: 3579
Edelsbrunner H, Jaromczyk J. 1986. How often can you see yourself in a convex configuration of mirrors? Congressus Numerantium. 53, 193–200.
View
 
[28]
1986 | Journal Article | IST-REx-ID: 3580
Edelsbrunner H. 1986. Edge-skeletons in arrangements with applications. Algorithmica. 1(1–4), 93–109.
View | DOI
 
[27]
1985 | Journal Article | IST-REx-ID: 4111
Edelsbrunner H, Maurer H. 1985. Finding extreme-points in 3-dimensions and solving the post-office problem in the plane. Information Processing Letters. 21(1), 39–47.
View | DOI
 
[26]
1985 | Journal Article | IST-REx-ID: 4112
Edelsbrunner H, Overmars M. 1985. Batched dynamic solutions to decomposable searching problems. Journal of Algorithms. 6(4), 515–542.
View | DOI
 
[25]
1985 | Journal Article | IST-REx-ID: 4113
Edelsbrunner H, Welzl E. 1985. On the number of line separations of a finite set in the plane. Journal of Combinatorial Theory Series A. 38(1), 15–29.
View | DOI
 
[24]
1985 | Journal Article | IST-REx-ID: 4114
Day W, Edelsbrunner H. 1985. Investigation of Proportional Link Linkage Clustering Methods. Journal of Classification. 2(2–3), 239–254.
View | DOI
 
[23]
1985 | Journal Article | IST-REx-ID: 4115
Edelsbrunner H. 1985. Computing the extreme distances between two convex polygons. Journal of Algorithms. 6(2), 213–224.
View | DOI
 
[22]
1985 | Journal Article | IST-REx-ID: 4116
Edelsbrunner H. 1985. Finding Transversals for Sets of Simple Geometric-Figures. Theoretical Computer Science. 35(1), 55–69.
View | DOI
 
[21]
1985 | Journal Article | IST-REx-ID: 4120
Chazelle B, Edelsbrunner H. 1985. Optimal solutions for a class of point retrieval problems. Journal of Symbolic Computation. 1(1), 47–56.
View | DOI
 
[20]
1984 | Journal Article | IST-REx-ID: 4117
Edelsbrunner H, Van Leeuwen J, Ottmann T, Wood D. 1984. Computing the connected components of simple rectilinear geometrical objects in D-Space. Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications. 18(2), 171–183.
View
 
[19]
1984 | Journal Article | IST-REx-ID: 4118
Edelsbrunner H, O’Rourke J, Welzl E. 1984. Stationing guards in rectilinear art galleries. Computer Vision, Graphics, and Image Processing. 27(2), 167–176.
View | DOI
 
[18]
1984 | Conference Paper | IST-REx-ID: 4119
Edelsbrunner H, Welzl E. 1984. Monotone edge sequences in line arrangements and applications. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 176, 265–272.
View | DOI
 
[17]
1984 | Journal Article | IST-REx-ID: 4121
Day W, Edelsbrunner H. 1984. Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification. 1(1), 7–24.
View | DOI | Download (ext.)
 
[16]
1984 | Conference Paper | IST-REx-ID: 4122
Edelsbrunner H. 1984. Key-problems and key-methods in computational geometry. STACS: Theoretical Aspects of Computer Science, LNCS, vol. 166, 1–13.
View | DOI
 
[15]
1984 | Journal Article | IST-REx-ID: 4123
Edelsbrunner H, Overmars M, Seidel R. 1984. Some methods of computational geometry applied to computer graphics. Computer Vision, Graphics, and Image Processing. 28(1), 92–108.
View | DOI
 
[14]
1984 | Journal Article | IST-REx-ID: 4125
Aurenhammer F, Edelsbrunner H. 1984. An optimal algorithm for constructing the weighted Voronoi diagram in the plane. Pattern Recognition. 17(2), 251–257.
View | DOI
 
[13]
1984 | Conference Paper | IST-REx-ID: 3513
Dobkin D, Edelsbrunner H. 1984. Ham-sandwich theorems applied to intersection problems. WG: International Workshop on Graph Theoretic Concepts in Computer Science, 88–99.
View | Download (ext.)
 
[12]
1983 | Conference Paper | IST-REx-ID: 4124
Edelsbrunner H, Welzl E. 1983. On the number of equal-sized semispaces of a set of points in the plane. ICALP: Automata, Languages and Programming, LNCS, vol. 154, 182–187.
View | DOI
 
[11]
1983 | Journal Article | IST-REx-ID: 4126
Edelsbrunner H. 1983. A new approach to rectangle intersections part 1. International Journal of Computer Mathematics. 13(3–4), 209–219.
View | DOI
 
[10]
1983 | Journal Article | IST-REx-ID: 4127
Edelsbrunner H. 1983. A new approach to rectangle intersections part 2. International Journal of Computer Mathematics. 13(3–4), 221–229.
View | DOI
 
[9]
1983 | Journal Article | IST-REx-ID: 4128
Edelsbrunner H, Kirkpatrick D, Seidel R. 1983. On the shape of a set of points in the plane. IEEE Transactions on Information Theory. 29(4), 551–559.
View | DOI
 
[8]
1983 | Book Chapter | IST-REx-ID: 3562
Bucher W, Edelsbrunner H. 1983.On expected- and worst-case segment trees. In: Computational Geometry: Theory and Applications. Advances in Computing Research , vol. 1, 109–125.
View | Download (ext.)
 
[7]
1983 | Book Chapter | IST-REx-ID: 3563
Edelsbrunner H, Overmars M, Wood D. 1983.Graphics in Flatland: a case study. In: Computational Geometry: Theory and Applications. Advances in Computing Research, vol. 1, 35–59.
View
 
[6]
1983 | Book Chapter | IST-REx-ID: 3564
Edelsbrunner H. 1983.Neue Entwicklungen im Bereich Datenstrukturen. In: Überblicke Informationsverarbeitung . , 55–109.
View | Download (ext.)
 
[5]
1982 | Journal Article | IST-REx-ID: 4129
Edelsbrunner H, Maurer H, Preparata F, Rosenberg A, Welzl E, Wood D. 1982. Stabbing line segments. Bit. 22(3), 274–281.
View | DOI
 
[4]
1982 | Journal Article | IST-REx-ID: 4130
Edelsbrunner H, Maurer H, Kirkpatrick D. 1982. Polygonal intersection searching. Information Processing Letters. 14(2), 74–79.
View | DOI
 
[3]
1982 | Journal Article | IST-REx-ID: 4131
Edelsbrunner H, Overmars M. 1982. On the equivalence of some rectangle problems. Information Processing Letters. 14(3), 124–127.
View | DOI
 
[2]
1981 | Journal Article | IST-REx-ID: 4132
Edelsbrunner H, Maurer H. 1981. On the intersection of Orthogonal objects. Information Processing Letters. 13(4–5), 177–181.
View | DOI
 
[1]
1981 | Journal Article | IST-REx-ID: 4133
Edelsbrunner H, Maurer H. 1981. A space-optimal solution of general region location. Theoretical Computer Science. 16(3), 329–336.
View | DOI
 

Search

Filter Publications