2025

• L. Ost, S. Cultrera di Montesano and H. Edelsbrunner. Banana trees for the persistence of time series experimentally. arXiv:2405.17920 [cs.DS], 2024. pdf
• H. Edelsbrunner, C. Fillmore and G. Oliveira. Counting equilibria of the electrostatic potential. Manuscript, ISTA, Klosterneuburg, Austria, 2025. pdf
• H. Edelsbrunner, A. Garber and M. Saghafian. On spheres with k points inside. arXiv:2410.21204 [math.CO], 2024. pdf
• H. Edelsbrunner, M. Lipinski, M. Mrozek and M. Soriano-Trigueros. The poset of cancellations in a filtered complex. arXiv:2311.14364 [math.AT], 2025. pdf
• H. Edelsbrunner, A. Garber and M. Saghafian. Order-2 Delaunay triangulations optimize angles. Adv. Math. 461 (2025), 110055. pdf

2024

• H. Edelsbrunner, M. Kahle and S. Kanazawa. Maximum persistent Betti numbers of Cech complexes. arXiv:2409.05241 [math.CO], 2024. pdf
• H. Edelsbrunner and T. Heiss. Merge trees for periodic filtration. arXiv:2408.16575 [math.AT], 2024. pdf
• H. Edelsbrunner, K. Ölsböck and H. Wagner. Understanding higher-order interactions in information space. Entropy 26 (2024), 637. pdf
• S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner and M. Saghafian. Chromatic topological data analysis. arXiv:24063.04102 [cs.CG], 2024. pdf
• S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner and M. Saghafian. The Euclidean MST-ratio for bi-colored lattices. In ``Proc. 32nd Internat. Sympos. Graph Drawing Network Vis., 2024'', 3:1-3:23. pdf
• S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner and M. Saghafian. Chromatic alpha complexes. arXiv:2212.03128 [math.AT], 2024. pdf
• S. Cultrera di Montesano, H. Edelsbrunner, M. Henzinger and L. Ost. Dynamically maintaining the persistent homology of time series. In ``Proc. 35th Ann. ACM-SIAM Sympos. Discrete Alg., 2024'', 243-295. pdf
• H. Edelsbrunner and J. Pach. Maximum Betti numbers of Cech complexes. In ``Proc. 40th Intl. Sympos. Comput. Geom., 2024'', 53:1-53:14. pdf
• H. Edelsbrunner, A. Garber, M. Ghafari, T. Heiss and M. Saghafian. Flips in two-dimensional hypertriangulations. arXiv:2212.11380 [math.CO], 2024. pdf
• H. Edelsbrunner, A. Garber, M. Ghafari, T. Heiss, M. Saghafian and M. Wintraecken. Brillouin zones of integer lattices and their perturbations. SIAM J. Discrete Math. 38 (2024), to appear. pdf
• R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner and M. Saghafian. Depth in arrangements: Dehn--Sommerville--Euler relations with applications. J. Appl. Comput. Top., doi.org/10.1007/s41468-024-00173-w, 2024. pdf
• H. Edelsbrunner and A. Nikitenko. Average and expected distortion of Voronoi paths and scapes. Discrete Comput. Geom. doi.org/10.1007/d00454-024-00660-y (2024). pdf

2023

• H. Edelsbrunner, A. Garber, M. Ghafari, T. Heiss and M. Saghafian. On angles in higher order Brillouin tessellations and related tilings in the plane. Discrete Comput. Geom., doi 10.1007/s00454-023-00566-1, 2023. pdf
• R. Biswas, S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, and M. Saghafian. On the size of chromatic Delaunay mosaics. arXiv:2212.03121 [math.CO], 2023. pdf
• P. Koehl, A. Akopyan and H. Edelsbrunner. Computing the volume, surface area, mean and Gaussian curvatures of molecules and their derivatives. J. Chem. Inf. Model. 63 (2023), 973-985. pdf
• H. Edelsbrunner. The shape of things to come in computational geometry. EU Research 34 (2023), 53-55. pdf
• H. Edelsbrunner and G. Osang. A simple algorithm for higher-order Delaunay mosaics and alpha shapes. Algorithmica 85 (2023), 277-295. pdf

2022

• R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner and M. Saghafian. Geometric characterization of the persistence of 1D maps. J. Appl. Comput. Top., to appear. pdf
• R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner and M. Saghafian. Continuous and discrete radius functions on tessellations and mosaics. Discrete Comput. Geom. 67 (2022), 811-842. pdf

2021

• A. Akopyan, H. Edelsbrunner and A. Nikitenko. The beauty of random polytopes inscribed in the 2-sphere. Experimental Mathematics (2021), 1-15. pdf
• R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, and M. Saghafian. Counting cells of order-k Voronoi tessellations in ${\displaystyle \mathbb {R} ^{3}}$ with Morse theory. In ``Proc. 37th Ann. Sympos. Comput. Geom., 2021'', 16:1-16:15. pdf
• H. Edelsbrunner, T. Heiss, V. Kurlin, P. Smith and M. Wintraecken. The density fingerprint of a periodic point set. In ``Proc. 37th Ann. Sympos. Comput. Geom., 2021'', 32:1-32:16. pdf
• G. Osang, H. Edelsbrunner and M. Saadatfar. Topological signatures and stability of hexagonal close packing and Barlow stackings. Soft Matter 27 (2021), 1-9. pdf
• H. Edelsbrunner, A. Nikitenko and G. Osang. A step in the Delaunay mosaic of order k. J. Geometry (2021) 112 (2021), article 15. pdf
• H. Edelsbrunner and G. Osang. The multi-cover persistence of Euclidean balls. Discrete Comput. Geom. 65 (2021), 1296-1313. pdf

2020

• A. Akopyan and H. Edelsbrunner. The weighted Gaussian curvature derivative of a space-filling diagram. Comput. Math. Biophys. 8 (2020), 74-88. pdf
• A. Akopyan and H. Edelsbrunner. The weighted mean curvature derivative of a space-filling diagram. Comput. Math. Biophys. 8 (2020), 51-67. pdf
• H. Edelsbrunner, A. Nikitenko, K. Ölsböck and P. Synak. Radius functions on Poisson--Delaunay mosaics and related complexes experimentally. In Topological Data Analysis, eds. N.A. Baas et al., Abel Symposia 15, 2020, 181-218. pdf
• H. Edelsbrunner and K. Ölsböck. Tri-partitions and bases of an ordered complex. Discrete Comput. Geom. 64 (2020), 759--775. pdf
• U. Bauer, H. Edelsbrunner, G. Jablonski and M. Mrozek. Cech-Delaunay gradient flow and homology inference for self-maps. J. Applied Comput. Top. 4 (2020), 455-480. pdf
• H. Edelsbrunner, Ž. Virk and H. Wagner. Topological data analysis in information space. J. Comput. Geom. 11 (2020), 162-182. pdf

2019

• H. Edelsbrunner and K. Ölsböck. Holes and dependence in an ordered complex. Computer Aided Geometric Design 73 (2019), 1-15. pdf
• P. Pranav, R. J. Adler, T. Buchert, H. Edelsbrunner, B. J. T. Jones, A. Schwartzman, H. Wagner and R. van de Weygaert. Unexpected topology of the temperature fluctuations in the cosmic microwave background. Astronomy and Astrophysics 627 (2019), A163. pdf
• H. Edelsbrunner and A. Nikitenko. Weighted Poisson--Delaunay mosaics. Theory Probab. Appl., SIAM 64 (2019), 746-770. pdf, Russian
• H. Edelsbrunner and A. Nikitenko. Poisson--Delaunay mosaics of order k. Discrete Comput. Geom. 62 (2019), 865-878. pdf

2018

• H. Edelsbrunner, Ž. Virk and H. Wagner. Smallest enclosing spheres and Chernoff points in Bregman geometry. In ``Proc. 34th Ann. Sympos. Comput. Geom., 2018'', 35:1-35:13. pdf
• H. Edelsbrunner and M. Iglesias-Ham. On the optimality of the FCC lattice for soft sphere packing. SIAM J. Discrete Math. 32 (2018), 750-782. pdf
• H. Edelsbrunner and A. Nikitenko. Random inscribed polytopes have similar radius functions as Poisson--Delaunay mosaics. Ann. Appl. Probab. 28 (2018), 3215-3238. pdf
• H. Edelsbrunner and M. Iglesias-Ham. Multple covers with balls I: inclusion-exclusion. Comput. Geom. Theory Appl. 68 (2018), 119-133. pdf

2017

• H. Edelsbrunner, A. Nikitenko and M. Reitzner. Expected sizes of Poisson--Delaunay mosaics and their discrete Morse functions. Adv. Appl. Probab. 49 (2017), 745-767. pdf
• U. Bauer and H. Edelsbrunner. The Morse theory of Cech and Delaunay complexes. Trans. Amer. Math. Soc. 369 (2017), 3741-3762. pdf
• H. Edelsbrunner and H. Wagner. Topological data analysis with Bregman divergences. J. Comput. Geom. 9 (2018), 67-86. In ``Proc. 33rd Ann. Sympos. Comput. Geom., 2017'', 39:1-39:16. pdf
• H. Edelsbrunner, A. Glazyrin, O. R. Musin and A. Nikitenko. The Voronoi functional is maximized by the Delaunay triangulation in the plane. Combinatorica 37 (2017), 887-910. pdf
• H. Edelsbrunner and P. Koehl. Computational topology for structural molecular biology. Chapter 65 in Handbook of Discrete and Computational Geometry, eds. J.E. Goodman, J. O'Rourke, C.D. Toth, Elsevier, 1709-1735, 2017. pdf
• H. Edelsbrunner and D. Morozov. Persistent homology. Chapter 24 in Handbook of Discrete and Computational Geometry, eds. J.E. Goodman, J. O'Rourke, C.D. Toth, Elsevier, 637-661, 2017. pdf

2016

• O. Dunaeva, H. Edelsbrunner, A. Lukyanov, M. Machin, D. Malkova, R. O. Kuvaev and S. V. Kashin. The classification of endoscopy images with persistent homology. Pattern Recognition Letters 83 (2016), 13-22. pdf
• P. Pranav, H. Edelsbrunner, R. van de Weygaert, G. Vegter, M. Kerber, B. J. T. Jones and M. Wintraecken. The topology of the cosmic web in terms of persistent Betti numbers. Monthly Notices Royal Astron. Soc. 465 (2016), 4281-4310. pdf
• H. Edelsbrunner and M. Iglesias-Ham. Multple covers with balls II: weighted averages. Electr. Notes Discrete Math. 54 (2016), 169-174. pdf
• H. Edelsbrunner and F. Pausinger. Approximation and convergence of the intrinsic volume. Adv. Math. 287 (2016), 674-703. pdf

2015

• H. Edelsbrunner, M. Iglesias-Ham and V. Kurlin. Relaxed disk packing. In ``Proc. 27th Canadian Conf. Comput. Geom., 2015'', 128-135. pdf
• O. Symonova, C. N. Topp and H. Edelsbrunner. Dynamic Roots: a software platform for the reconstruction and analysis of growing plant roots. PLoS One (2015), article e0127657. pdf
• H. Edelsbrunner, G. Jablonski and M. Mrozek. The persistent homology of a self-map. Found. Comput. Math. 15 (2015), 1213-1244. pdf
• T.-T. Cao, H. Edelsbrunner and T. S. Tan. Triangulations from topologically correct digital Voronoi diagrams. Comput. Geom.: Theory Appl. 48 (2015), 507-519. pdf

2014

• H. Edelsbrunner and N. Strelkova. On the configuration space of Steiner minimal trees. Manuscript, IST Austria, submitted for publication, 2014. pdf
• N. P. Dolbilin, H. Edelsbrunner, A. Glazyrin and O. R. Musin. Functionals on triangulations of Delaunay sets. Moscow Math. J. 14 (2014), 491-504. pdf
• H. Edelsbrunner and S. Parsa. On the computational complexity of Betti numbers: reductions from matrix rank. In ``Proc. 25th ACM-SIAM Sympos. Discrete Alg., 2014'', 152-160. pdf
• H. Edelsbrunner and F. Pausinger. Stable length estimates of tube-like shapes. J. Math. Imaging Vision 50 (2014), 164-177. pdf

2013

• R. O. Kuvaev, S. V. Kashin, V. A. Kapranov, H. Edelsbrunner, M. L. Myachin, O. A. Dunaeva and A. I. Rusakov. Novel computer technologies for the prediction of histological structure in the stomach. Evidence-based Gastroenterology 1 (2013), 3-12. pdf, poster
• C. N. Topp, A. S. Iyer-Pascuzzi, J. T. Anderson, C.-R. Lee, P. R. Zurec, O. Symonova, Y. Zheng, A. Bucksch, Y. Mileyko, T. Galkovskyi, B. T. Moore, J. Harer, H. Edelsbrunner, T. Mitchell-Olds, J. S. Weitz and P. N. Benfey. 3D phenotyping and quantitative trait locus mapping identify core regions of the rice genome controlling root architecture. Proc. Natl. Acad. Sci. 110 (2013), E1695--E1704. pdf
• S. Fang, R. T. Clark, Y. Zheng, A. S. Iyer-Pascuzzi, J. S. Weitz, L. V. Kochian, H. Edelsbrunner, H. Liao and P. N. Benfey. Genotypic recognition and spatial responses by rice roots. Proc. Natl. Acad. Sci. 110 (2013), 2670-2675. pdf
• M. Kerber and H. Edelsbrunner. 3D kinetic alpha complexes and their implementation. In ``Proc. Mtg. Algorithm Engin. Experiments, 2013'', 70--77. pdf
• H. Edelsbrunner, C.-P. Heisenberg, M. Kerber and G. Krens. The Medusa of spatial sorting: topological construction. Manuscript, IST Austria, Klosterneuburg, Austria, 2013. pdf
• H. Edelsbrunner, B. T. Fasy and G. Rote. Add isotropic Gaussian kernels at own risk: more and more resilient modes in higher dimensions. Discrete Comput. Geom. 49 (2013), 797-822. pdf
• P. Bendich, H. Edelsbrunner, D. Morozov and A. Patel. Homology and robustness of level and interlevel sets. Homology, Homotopy, and Applications 15 (2013), 51-72. pdf

2012

• H. Edelsbrunner and D. Morozov. Persistent homology: theory and practice. In ``European Congress of Mathematics, Krakow, 2012'', Europ. Math. Soc., 31-50. pdf
• H. Edelsbrunner and O. Symonova. The adaptive topology of a digital image. In ``Proc. 9th Internat. Sympos. Voronoi Diagrams Sci. Engin., 2012'', 41-48. pdf
• H. Edelsbrunner and M. Kerber. Alexander duality for functions: the persistent behavior of land and water and shore. In ``Proc. 28th Ann. Sympos. Comput. Geom., 2012'', 249-258. pdf
• Y. Mileyko, H. Edelsbrunner, C. A. Price and J. S. Weitz. Hierarchical ordering of reticular networks. PLoS Comput. Bio. 7 (2012), e36715. pdf
• H. Edelsbrunner, A. Ivanov and R. Karasev. Current open problems in discrete and computational geometry. Modeling Anal. Inform. Sys., 2012. pdf
• H. Edelsbrunner, O. Musin, A. Ukhalov, O. Yakimova, V. Alexeev, V. Bogaevskaya, A. Gorohov and M. Preobrazhenskaya. Fractal and computational geometry for generalizing cartographic objects. Modeling Anal. Inform. Sys. 19 (2012), 152-160. pdf, Russian
• N. P. Dolbilin, H. Edelsbrunner and O. Musin. On the optimality of functionals over triangulations of Delaunay sets. Comm. Moscow Math. Soc. 67 (2012), 189-190, English translation, 781-783. pdf, Russian
• H. Edelsbrunner and N. Strelkova. On the configuration space of Steiner minimal trees. Uspekhi Mat. Nauk 67 (2012), 203-204, English translation in Russian Math. Surveys 67 (2012), 1167-1168. pdf, long
• R. van de Weygaert, P. Pranav, B. J. T. Jones, E. G. P. Bos, G. Vegter, H. Edelsbrunner, M. Teillaud, W. A. Hellwing, C. Park, J. Hidding and M. Wintraecken. Probing dark energy with alpha shapes and Betti numbers. arXiv:1110.5528v1 [astro-ph.CO], 2012. pdf
• P. Bendich, S. Cabello and H. Edelsbrunner. A point calculus for interlevel set homology. Pattern Recognition Letters 33 (2012), 1436-1444. pdf
• H. Edelsbrunner and M. Kerber. Dual complexes of cubical subdivisions of . Discrete Comput. Geom. 47 (2012), 393-414. pdf

2011

• C. Chen and H. Edelsbrunner. Diffusion runs low on persistence fast. In ``Proc. 13th Internat. Conf. Comput. Vision, 2011'', 423-430. pdf
• Y. Zheng, S. Gu, H. Edelsbrunner, C. Tomasi and P. Benfey. Detailed reconstruction of 3D plant root shape. In ``Proc. 13th Internat. Conf. Comput. Vision, 2011'', 2026-2033. pdf
• H. Edelsbrunner, D. Morozov and A. K. Patel. Quantifying transversality by measuring the robustness of intersections. Found. Comput. Math. 11 (2011), 345-361. pdf
• R. van de Weygaert, G. Vegter, H. Edelsbrunner, B. J. T. Jones, P. Pranav, C. Park, W. A. Hellwing, B. Eldering, N. Kruithof, E. G. P. Box, J. Hidding, J. Feldbrugge, E. ten Have, M. van Engelen, M. Caroli and M. Teillaud. Alpha, Betti and the megaparsec Universe: on the topology of the cosmic web. Trans. Comput. Sci. XIV (2011), 60-101. pdf
• H. Edelsbrunner. Alpha shapes --- a survey. In Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings, ed. R. van de Weygaert, G. Vegter, J. Ritzerveld and V. Icke, to appear. pdf
• H. Edelsbrunner, D. Morozov and A. K. Patel. The stability of the apparent contour of an orientable 2-manifold. In Topological Data Analysis and Visualization, 27-42, eds. V. Pascucci, X. Tricoche, H. Hagen and J. Tierny, Springer-Verlag, Heidelberg, Germany, 2011. pdf
• H. Edelsbrunner and M. Kerber. Covering and packing with spheres by diagonal distortion in . Rainbow of Computer Science, 20-35, eds. C. Calude, G. Rozenberg and A. Salomaa, Lecture Notes in Computer Science 6570, Springer-Verlag, 2011. pdf
• B. Wang, H. Edelsbrunner and D. Morozov. Computing elevation maxima by searching the Gauss sphere. ACM J. Exper. Alg. 16 (2011), 1-13. pdf

2010

• H. Edelsbrunner and J. L. Harer. Computational Topology. An Introduction. Amer. Math. Soc., Providence, Rhode Island, 2010.
• K. Chatterjee, L. Doyen, H. Edelsbrunner, T. A. Henzinger and P. Rannou. Mean-payoff automaton expressions. In ``Proc. 21st Internat. Conf. Concurrency Theory, 2010'', eds. P. Gastin and F. Laroussinie, Springer-Verlag, Lecture Notes Comput. Sci. 6269, 269-283. pdf
• P. Bendich, H. Edelsbrunner, M. Kerber and A. Patel. Persistent homology under non-uniform error. In ``Proc. 35th Internat. Sympos. Found. Comput. Sci., 2010'', eds. P. Hlineny and A. Kucera, Springer-Verlag, Lecture Notes Comput. Sci. 6281, 12-23. pdf
• P. Bendich, H. Edelsbrunner and M. Kerber. Computing robustness and persistence for images. IEEE Trans. Visual. Comput. Graphics 16 (2010), 1251-1260. pdf
• D. Cohen-Steiner, H. Edelsbrunner, J. Harer and Y. Mileyko. Lipschitz functions have L_p-stable persistence. Found. Comput. Math., 10 (2010), 127-139. pdf

2009

• H. Edelsbrunner and J. L. Harer. The persistent Morse complex segmentation of a 3-manifold. In ``3D Physiological Human Workshop, 2009'', ed. N. Magnenat-Thalmann, Springer-Verlag, Berlin, Lecture Notes Comput. Sci. 5903, 36-50. pdf
• D. Cohen-Steiner, H. Edelsbrunner, J. Harer and D. Morozov. Persistent homology for kernels, images, and cokernels. In. ``Proc. 20th Ann. ACM-SIAM Sympos. Discrete Alg., 2009'', 1011-1020. pdf
• D. Cohen-Steiner, H. Edelsbrunner and J. Harer. Extending persistence using Poincare and Lefschetz duality. Found. Comput. Math. 9 (2009), 79-103 and 133-134. pdf, erratum
• D. Attali, J.-D. Boissonnat and H. Edelsbrunner. Stability and computation of medial axes --- a state-of-the-art report. Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration, eds. T. Moeller, B. Hamann and R. Russell, 109-125, Springer-Verlag, Berlin, Germany, 2009. pdf

2008

• H. Edelsbrunner, J. Harer and A. K. Patel. Reeb spaces of piecewise linear mappings. In ``Proc. 24th Ann. Sympos. Comput. Geom., 2008'', 242-250. pdf
• M.-L. Dequeant, S. Ahnert, H. Edelsbrunner, T. M. A. Fink, E. F. Glynn, G. Hattem, A. Kudlicki, Y. Mileyko, J. Morton, A. R. Mushegian, L. Pachter, M. Rowicka, A. Shiu, B. Sturmfels, O. Pourquie. Comparison of pattern detection methods in microarray time series of the segmentation clock. PLoS One 3 (2008), e2856, doi:10.1371/journal.pone.0002856. pdf
• H. Edelsbrunner, J. Harer, A. Mascarenhas, V. Pascucci and J. Snoeyink. Time-varying Reeb graphs for continuous space-time data. Comput. Geom. Theory Appl. 41 (2008), 149-166. pdf
• H. Edelsbrunner and J. Harer. Persistent homology --- a survey. Surveys on Discrete and Computational Geometry. Twenty Years Later, 257-282, eds. J. E. Goodman, J. Pach and R. Pollack, Contemporary Mathematics 453, Amer. Math. Soc., Providence, Rhode Island, 2008. pdf
• S. Biasotti, D. Attali, J.-D. Boissonnat, H. Edelsbrunner, G. Elber, M. Mortara, G. Sanniti di Baja, M. Spagnuolo, M. Tanase and R. Veltcamp. Skeletal structures. Shape Analysis and Structuring, 145-183, eds. L. De Floriani and M. Spagnuolo, Springer-Verlag, Berlin, Germany, 2008. pdf

2007

• P. Bendich, D. Cohen-Steiner, H. Edelsbrunner, J. Harer and D. Morozov. Inferring local homology from sampled stratified spaces. In ``Proc. 48th Ann. Sympos. Found. Comput. Sci., 2007'', 536-546. pdf
• D. Attali, H. Edelsbrunner, J. Harer and Y. Mileyko. Alpha-beta witness complexes. In ``Proc. 10th Workshop Algor. Data Struct., 2007'', Springer-Verlag, Lecture Notes Comput. Sci. 4619, 386-397. pdf
• D. Attali, H. Edelsbrunner and Y. Mileyko. Weak witnesses for Delaunay triangulations of submanifolds. In ``Proc. ACM Sympos. Solid Phys. Modeling, 2007'', 143-150. pdf
• J. Headd, Y.-H. A. Ban, P. Brown, H. Edelsbrunner, M. Vaidya and J. Rudolph. Protein-protein interfaces: properties, preferences, and projections. Proteome Research 6 (2007), 2576-2586. pdf
• D. Attali and H. Edelsbrunner. Inclusion-exclusion formulas from independent complexes. Discrete Comput. Geom. 37 (2007), 59-77. pdf
• D. Cohen-Steiner and H. Edelsbrunner. Inequalities for the curvature of curves and surfaces. Found. Comput. Math. 7 (2007), 391-404. pdf
• D. Cohen-Steiner, H. Edelsbrunner and J. Harer. Stability of persistence diagrams. Discrete Comput. Geom. 37 (2007), 103-120. pdf

2006

• H. Edelsbrunner, D. Morozov and V. Pascucci. Persistence-sensitive simplification of functions on 2-manifolds. In. ``Proc. 22nd Ann. Sympos. Comput. Geom., 2006'', 127-134. pdf
• D. Cohen-Steiner, H. Edelsbrunner and D. Morozov. Vines and vineyards by updating persistence in linear time. In. ``Proc. 22nd Ann. Sympos. Comput. Geom., 2006'', 119-126. pdf
• Y.-H. Ban, J. Rudolph, P. Zhou and H. Edelsbrunner. Evaluating the quality of NMR structures by local density of protons. Proteins: Structure, Function, and Bioinformatics 62 (2006), 852-864. pdf
• P. K. Agarwal, H. Edelsbrunner, J. Harer and Y. Wang. Extreme elevation on a 2-manifold. Discrete Comput. Geom. 36 (2006), 553-572. pdf
• Y.-H. A. Ban, H. Edelsbrunner and J. Rudolph. Interface surfaces for protein-protein complexes. J. Assoc. Comput. Mach. 53 (2006), 361-378. pdf

2005

• D. Attali, D. Cohen-Steiner and H. Edelsbrunner. Extraction and simplification of iso-surfaces in tandem. In ``Proc. 3rd Ann. Sympos. Geom. Process., 2005'', 139-148. pdf
• Y. Wang, P. K. Agarwal, P. Brown, H. Edelsbrunner and J. Rudolph. Coarse and reliable geometric alignment for protein docking. In ``Proc. Pacific Sympos. Biocomputing, 2005'', World Scientific, Singapore, 64-75. pdf
• H. Edelsbrunner. Surface tiling with differential topology. In ``Proc. 3rd Eurographics Sympos. Geom. Process., 2005'', 9-11. pdf
• J. Sohn, J. Parks, G. Buhrman, P. Brown, K. Kristjansdottir, A. Safi, H. Edelsbrunner, W. Yang and J. Rudolph. Experimental validation of the docking orientation of Cdc25 with its Cdk2-CycA protein substrate. Biochemistry 44 (2005), 16563-16573. pdf
• H. Edelsbrunner and P. Koehl. The geometry of biomolecular solvation. Discrete and Computational Geometry, 243-275, eds. J. E. Goodman, J. Pach and E. Welzl, MSRI Publ. 52, Cambridge Univ. Press, England, 2005. pdf

2004

• H. Edelsbrunner, J. Harer, V. Natarajan and V. Pascucci. Local and global comparison of continuous functions. In ``Proc. IEEE Conf. Visualization, 2004'', 275--280. pdf
• V. Choi, P. K. Agarwal, H. Edelsbrunner and J. Rudolph. Local search heuristic for rigid protein docking. In ``Proc. 4th Intl. Workshop Alg. BioInformatics, 2004'', Springer-Verlag, Lecture Notes Comput. Sci. 3240, 218-229. pdf
• K. Cole-McLaughlin, H. Edelsbrunner, J. Harer, V. Natarajan and V. Pascucci. Loops in Reeb graphs of 2-manifolds. Discrete Comput. Geom. 32 (2004), 231-244. pdf
• P.-T. Bremer, H. Edelsbrunner, B. Hamann and V. Pascucci. Topological hierarchy for functions on triangulated surfaces. IEEE Trans. Vis. Comput. Graphics 10 (2004), 385-396. pdf
• V. Natarajan and H. Edelsbrunner. Simplication of three-dimensional density maps. IEEE Trans. Visual. Comput. Graphics 10 (2004}, 587-597. pdf
• P. Agarwal, H. Edelsbrunner and Y. Wang. Computing the writhing number of a polygonal knot. Discrete Comput. Geom. 32 (2004), 37-53. pdf
• R. Bryant, H. Edelsbrunner, P. Koehl and M. Levitt. The area derivative of a space-filling diagram. Discrete Comput. Geom. 32 (2004), 293-308. pdf
• H. Edelsbrunner and J. Harer. Jacobi sets of multiple Morse functions. In Foundations of Computational Mathematics, Minneapolis 2002, eds. F. Cucker, R. DeVore, P. Olver and E. Sueli, Cambridge Univ. Press, England, 37-57. pdf
• H. Edelsbrunner. Biological applications of computational topology. Chapter 63 of Handbook of Discrete and Computational Geometry, 1395-1412, eds. J. E. Goodman and J. O'Rourke, CRC Press, Boca Raton, Florida, 2004. pdf

2003

• S. Bespamyatnikh, V. Choi, H. Edelsbrunner and J. Rudolph. Accurate protein docking by shape complementarity alone. Manuscript, Dept. Comput. Sci., Duke Univ., 2003. pdf
• H. Edelsbrunner, J. Harer, V. Natarajan and V. Pascucci. Morse-Smale complexes for piecewise linear 3-manifolds. In ``Proc. 19th Ann. Sympos. Comput. Geom. 2003'', 361-370. pdf
• H. Edelsbrunner and A. Ungor. Relaxed scheduling in dynamic skin triangulation. In ``Japanese Conf. Discrete Comput. Geom., 2003'', eds. J. Akiyama and M. Kano, Springer-Verlag, Lecture Notes in Computer Science 2866, 135-151. pdf
• H. Edelsbrunner and P. Koehl. The weighted volume derivative of a space-filling diagram. Proc. Natl. Acad. Sci. 100 (2003), 2203-2208. pdf
• H. Edelsbrunner, J. Harer and A. Zomorodian. Hierarchical Morse-Smale complexes for piecewise linear 2-manifolds. Discrete Comput. Geom. 30 (2003), 87-107. pdf
• H.-L. Cheng and H. Edelsbrunner. Area, perimeter and derivatives of a skin curve. Comput. Geom. Theory Appl. 26 (2003), 173-192. pdf
• H. Edelsbrunner and A. Zomorodian. Computing linking numbers of a filtration. Homology, Homotopy, and Applications 5 (2003), 19-37. pdf
• H.-L. Cheng and H. Edelsbrunner. Area and perimeter derivatives of a union of disks. Computer Science in Perspective. Essays Dedicated to Thomas Ottmann, 88-97, eds. R. Klein, H.-W. Six and L. Wegner, Lecture Notes Comput. Sci. 2598, Springer-Verlag, 2003. pdf
• H. Edelsbrunner. Surface reconstruction by wrapping finite point sets in space. Discrete and Computational Geometry. The Goodman-Pollack Festschrift, 379-404, eds. B. Aronov, S. Basu, J. Pach and M. Sharir, Springer-Verlag, 2003. pdf

2002

• P. K. Agarwal, L. J. Guibas, H. Edelsbrunner, J. Erickson, M. Isard, S. Har-Peled, J. Hershberger, C. Jensen, L. Kavraki, P. Koehl, M. Lin, D. Minocha, D. Metaxas, B. Mirtich, D. Mount, S. Muthukrishnan, D. Pai, E. Sacks, J. Snoeyink, S. Suri and O. Wolefson. Algorithmic issues in modeling motion. ACM Computing Surveys 34 (2002), 550-533. pdf
• H. Edelsbrunner, D. Letscher and A. Zomorodian. Topological persistence and simplification. Discrete Comput. Geom. 28 (2002), 511-533. pdf
• H. Edelsbrunner and D. Guoy. An experimental study of sliver exudation. Engin. with Computers 18 (2002), 229-240. pdf
• H. Edelsbrunner and D. Guoy. Sink-insertion for mesh improvement. Internat. J. Found. Comput. Sci. 13 (2002), 223-242. pdf
• A. Zomorodian and H. Edelsbrunner. Fast software for box intersections. Internat. J. Comput. Geom. Appl. 12 (2002), 143-172. pdf

2001

• H. Edelsbrunner. Geometry and Topology for Mesh Generation. Cambridge Univ. Press, Cambridge, England, 2001.
• H. Edelsbrunner. 180 wrapped tubes. J. Univ. Comput. Sci. 7 (2001), 379-399. pdf
• H.-L. Cheng, T. K. Dey, H. Edelsbrunner and J. Sullivan. Dynamic skin triangulation. Discrete Comput. Geom. 25 (2001), 525-568. pdf
• H.-L. Cheng, H. Edelsbrunner and P. Fu. Shape space from deformation. Comput. Geom. Theory Appl. 19 (2001), 191-204. pdf
• S.-W. Cheng, H. Edelsbrunner, P. Fu and P. Lam. Design and analysis of planar shape deformation. Comput. Geom. Theory Appl. 19 (2001), 205-218. pdf

2000

• H. Edelsbrunner, X.-Y. Li, G. Miller, A. Stathopoulos, D. Talmor, S.-H. Teng, A. Ungor and N. Walkington. Smoothing and cleaning up slivers. In ``Proc. 32nd ACM Sympos. Theory Comput. 2000'', 273-277. pdf
• H. Edelsbrunner. Triangulations and meshes in computational geometry. Acta Numerica (2000), 133-213. pdf
• H. Edelsbrunner and D. R. Grayson. Edgewise subdivision of a simplex. Discrete Comput. Geom. 24 (2000), 707-719. pdf
• S.-W. Cheng, T. K. Dey, H. Edelsbrunner, M. A. Facello and S.-H. Teng. Sliver exudation. J. Assoc. Comput. Mach. 47 (2000), 883-904. pdf
• H. Edelsbrunner and R. Waupotitsch. Adaptive simplicial grids from cross-sections of monotone complexes. Computational Geometry: Theory and Applications 10 (2000), 267-284. pdf
• H. Edelsbrunner. Spielereien mit Kreisen und Kugeln. Zum Thema Form und Verformung. Zur Kunst des Formalen Denkens, 153-171, eds.: R. E. Burkard, W. Maas und P. Weibel, Passagen Verlag, Wien, Austria, 2000. pdf

1999

• X. Jiao, H. Edelsbrunner and M. T. Heath. Mesh association: formulation and algorithms. In ``Proc. 8th Internat. Meshing Roundtable, 1999'', South Lake Tahoe, California, 75-82. pdf
• T. K. Dey, H. Edelsbrunner, S. Guha and D. V. Nekhayev. Topology preserving edge contraction. Publ. Inst. Math. (Beograd) (N.S.) 66 (1999), 23-45. pdf
• H. Edelsbrunner. Deformable smooth surface design. Discrete Comput. Geom. 21 (1999), 87-115. pdf
• T. K. Dey, H. Edelsbrunner and S. Guha. Computational topology. Advances in Discrete and Computational Geometry, 109-143, eds.: B. Chazelle, J. E. Goodman and R. Pollack, Contemporary Mathematics 223, AMS, Providence, 1999. pdf

1998

• H. Edelsbrunner. Shape reconstruction with Delaunay complex. In ``Proc. Sympos. Latin American Theoret. Inform., 1998'', Campinas, Brazil, Springer-Verlag Lecture Notes 1380, 119-132. pdf
• H. Edelsbrunner, M. A. Facello, P. Fu, J. Qian and D. V. Nekhayev. Wrapping 3D scanning data. In ``Proc. IS&N/SPIE's Sympos. Electronic Imaging, 1998'', San Jose, California, 148-158. pdf
• J. Liang, H. Edelsbrunner and C. Woodward. Anatomy of protein pockets and cavities: measurement of binding site geometry and implications for ligand design. Protein Science 7 (1998), 1884-1897. pdf
• J. Liang, H. Edelsbrunner, P. Fu, P. V. Sudharkar and S. Subramaniam. Analytic shape computation of macromolecules II: inaccessible cavities in proteins. Proteins: Structure, Function, and Genetics 33 (1998), 18-29. pdf
• J. Liang, H. Edelsbrunner, P. Fu, P. V. Sudharkar and S. Subramaniam. Analytic shape computation of macromolecules I: molecular area and volume through alpha shape. Proteins: Structure, Function, and Genetics 33 (1998), 1-17. pdf
• H. Edelsbrunner, M. A. Facello and J. Liang. On the definition and the construction of pockets in macromolecules. Discrete Appl. Math. 88 (1998), 83-102. pdf
• U. Axen and H. Edelsbrunner. Auditory Morse analysis of triangulated manifolds. Mathematical Visualization, 223-236, ed. H.-C. Hege and K. Polthier, Springer-Verlag, Berlin, Germany, 1998. pdf
• H. Edelsbrunner. Geometry for modeling biomolecules. Robotics: The Algorithmic Perspective, The Third Workshop on the Algorithmic Foundations of Robotics, 265-277, ed.: P. Agarwal, L. Kavraki and M. Mason, A. K. Peters, Natick, Massachusetts, 1998. pdf

1997

• H. Edelsbrunner and R. Waupotitsch. A combinatorial approach to cartograms. J. Comput. Geom. Theory Appl. 7 (1997), 343-360. pdf
• H. Edelsbrunner and E. A. Ramos. Inclusion-exclusion complexes for pseudodisk collections. Discrete Comput. Geom. 17 (1997), 287-306. pdf
• H. Edelsbrunner, P. Valtr and E. Welzl. Cutting dense point sets in half. Discrete Comput. Geom. 17 (1997), 243-255. pdf
• H. Edelsbrunner and N. R. Shah. Triangulating topological spaces. Internat. J. Comput. Geom. Appl. 7 (1997), 365-378. pdf

1996

• H. Edelsbrunner, P. Fu and J. Qian. Geometric modeling in CAVE. In ``Proc. ACM Sympos. Virtual Reality Softw. Techn., 1996'', Hong Kong, 35-41 and 193-194. pdf
• N. Akkiraju, H. Edelsbrunner, P. Fu and J. Qian. Viewing geometric protein structures from inside a CAVE. IEEE Comput. Graphics Appl. 16 (1996), 58-61. pdf
• N. Akkiraju and H. Edelsbrunner. Triangulating the surface of a molecule. Discrete Appl. Math. 71 (1996), 5-22. pdf
• H. Edelsbrunner and N. R. Shah. Incremental topological flipping works for regular triangulations. Algorithmica 15 (1996), 223-241. pdf
• B. Chazelle, H. Edelsbrunner, L. J. Guibas, M. Sharir and J. Stolfi. Lines in space: combinatorics and algorithms. Algorithmica 15 (1996), 428-447. pdf

1995

• N. Akkiraju, H. Edelsbrunner, M. Facello, P. Fu, E. P. Mücke and C. Varela. Alpha shapes: definition and software. In ``Proc. Internat. Comput. Geom. Software Workshop'', ed. N. Amenta, Rpt. GCG 80, Geometry Center, Minneapolis, Minnesota, 1995. pdf
• H. Edelsbrunner. Algebraic decomposition of non-convex polyhedra. In ``Proc. 36th Ann. IEEE Sympos. Found. Comput. Sci. 1995'', 248-257. pdf
• H. Edelsbrunner, M. A. Facello, P. Fu and J. Liang. Measuring proteins and voids in proteins. In ``Proc. 28th Ann. Hawaii Internat. Conf. System Sciences, 1995'', vol. V: Biotechnology Computing, 256-264. pdf
• C. J. A. Delfinado and H. Edelsbrunner. An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere. Comput. Aided Geom. Design 12 (1995), 771-784. pdf
• H. Edelsbrunner. The union of balls and its dual shape. Discrete Comput. Geom. 13 (1995), 415-440. pdf
• B. Chazelle, H. Edelsbrunner, M. Grigni, L. J. Guibas, M. Sharir and E. Welzl. Improved bounds on weak epsilon-nets for convex sets. Discrete Comput. Geom. 13 (1995), 1-15. pdf

1994

• H. Edelsbrunner and P. Fu. Measuring space filling diagrams and voids. Molecular Biophysic Report UIUC-BI-MB-94-01, Beckman Institute, Univ. Illinois at Urbana-Champaign, Illinois, 1994. pdf
• H. Edelsbrunner. Modeling with simplicial complexes (topology, geometry, and algorithms). In ``Proc. 6th Canadian Conf. Comput. Geom., 1994'', 36-44. pdf
• T. R. Dey and H. Edelsbrunner. Counting triangle crossings and halving planes. Discrete Comput. Geom. 12 (1994), 281-289. pdf
• H. Edelsbrunner and E. P. Mücke. Three-dimensional alpha shapes. ACM Trans. Graphics 13 (1994), 43-72. pdf
• B. Chazelle, H. Edelsbrunner, M. Grigni, L. J. Guibas, J. E. Hershberger, M. Sharir and J. Snoeyink. Ray shooting in polygons using geodesic triangulations. Algorithmica 12 (1994), 54-68. pdf
• B. Chazelle, H. Edelsbrunner, L. J. Guibas and M. Sharir. Algorithms for bichromatic line-segment problems and polyhedral terrains. Algorithmica 11 (1994), 116-132. pdf
• B. Chazelle, H. Edelsbrunner, L. J. Guibas, J. E. Hershberger, R. Seidel and M. Sharir. Selecting heavily covered points. SIAM J. Comput. 23 (1994), 1138-1151. pdf

1993

• B. Chazelle, H. Edelsbrunner, L. J. Guibas and M. Sharir. Diameter, width, closest line pair, and parametric searching. Discrete Comput. Geom. 10 (1993), 183-196. pdf
• H. Edelsbrunner and T. S. Tan. An upper bound for conforming Delaunay triangulations. Discrete Comput. Geom. 10 (1993), 197-213. pdf
• H. Edelsbrunner and T. S. Tan. A quadratic time algorithm for the minmax length triangulation. SIAM J. Comput. 22 (1993), 527-551. pdf
• M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell and T. S. Tan. Edge insertion for optimal triangulations Discrete Comput. Geom. 10 (1993), 47-65. pdf
• B. Chazelle, H. Edelsbrunner, L. J. Guibas, M. Sharir and J. Snoeyink. Computing a face in an arrangement of line segments and related problems. SIAM J. Comput. 22 (1993), 1286-1302. pdf
• H. Edelsbrunner, R. Seidel and M. Sharir. On the zone theorem for hyperplane arrangements. SIAM J. Comput. 22 (1993), 418-429. pdf
• H. Edelsbrunner. Computational geometry. Chapter 1 in Current Trends in Theoretical Computer Science, Essays and Tutorials, 1-48, ed.: G. Rozenberg and A. Salomaa, World Scientific, Singapore, 1993. pdf

1992

• H. Edelsbrunner. Weighted alpha shapes. Report UIUCDCS-R-92-1760, Dept. Comput. Sci., Univ. Illinois, Urbana, Illinois, 1992. pdf
• A. Aggarwal, H. Edelsbrunner, P. Raghavan and P. Tiwari. Optimal time bounds for some proximity problems in the plane. Inform. Process. Lett. 42 (1992), 55-60. pdf
• H. Edelsbrunner, T. S. Tan and R. Waupotitsch. An O(n² log n) time algorithm for the minmax angle triangulation. SIAM J. Sci. Stat. Comput. 13 (1992), 994-1008. pdf
• B. Aronov, H. Edelsbrunner, L. J. Guibas and M. Sharir. The number of edges of many faces in a line segment arrangement. Combinatorica 12 (1992), 261-274. pdf
• B. Chazelle, H. Edelsbrunner, L. J. Guibas, R. Pollack, R. Seidel, M. Sharir, J. Snoeyink. Counting and cutting cycles of lines and rods in space. Computational Geometry: Theory and Applications 1 (1992), 305-323. pdf
• H. Edelsbrunner, L. J. Guibas, J. Pach, R. Pollack, R. Seidel and M. Sharir. Arrangements of curves in the plane - topology, combinatorics, and algorithms. Theoret. Comput. Sci. 92 (1992), 319-336. pdf
• B. Chazelle and H. Edelsbrunner. An optimal algorithm for intersecting line segments in the plane. J. Assoc. Comput. Mach. 39 (1992), 1-54. pdf
• H. Edelsbrunner. Geometric algorithms. Chapter 2.9 in Handbook of Convex Geometry, 699-735, ed. P. Gruber and J. Wills, North-Holland, 1992. pdf

1991

• B. Aronov, B. Chazelle, H. Edelsbrunner, L. J. Guibas, M. Sharir and R. Wenger. Points and triangles in the plane and halving planes in space. Discrete Comput. Geom. 6 (1991), 435-442. pdf
• P. K. Agarwal, H. Edelsbrunner, O. Schwarzkopf and E. Welzl. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete Comput. Geom. 6 (1991), 407-422. pdf
• H. Edelsbrunner and W. Shi. An O(n log² h) time algorithm for the three-dimensional convex hull problem. SIAM J. Comput. 20 (1991), 259-269. pdf
• B. Chazelle, H. Edelsbrunner, L. J. Guibas and M. Sharir. A singly exponential stratification scheme for real semi-algebraic varieties and its applications. Theoret. Comput. Sci. 84 (1991), 77-105. pdf
• H. Edelsbrunner and P. Hajnal. A lower bound on the number of unit distances between the vertices of a convex polygon. J. Combin. Theory Ser. A 56 (1991), 312-316. pdf
• H. Edelsbrunner. Lines in space - a collection of results. Discrete and Computational Geometry, 77-93, eds.: R. Pollack and W. Steiger, DIAMCS Series in Discrete Mathematics and Theoretical Computer Science 6, 1991. pdf
• H. Edelsbrunner and M. Sharir. A hyperplane incidence problem with applications to counting distances. Applied Geometry and Discrete Mathematics. The Victor Klee Festschrift, 253-263, eds.: P. Gritzmann and B. Sturmfels, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1991. pdf

1990

• H. Edelsbrunner, M. H. Overmars, E. Welzl, I. Ben-Arroyo Hartman and J. A. Feldman. Ranking intervals under visibility constraints. Internat. J. Comput. Math. 34 (1990), 129-144. pdf
• H. Edelsbrunner, F. P. Preparata and D. B. West. Tetrahedrizing point sets in three dimensions J. Symbolic Comput. 10 (1990), 335-347. pdf
• H. Edelsbrunner, L. J. Guibas and M. Sharir. The complexity of many cells in arrangements of planes and related problems. Discrete Comput. Geom. 5 (1990), 197-216. pdf
• H. Edelsbrunner, L. J. Guibas and M. Sharir. The complexity and construction of many faces in arrangements of lines and of segments. Discrete Comput. Geom. 5 (1990), 161-196. pdf
• K. L. Clarkson, H. Edelsbrunner, L. G. Guibas, M. Sharir and E. Welzl. Combinatorial complexity bounds for arrangements of curves and spheres. Discrete Comput. Geom. 5 (1990), 99-160. pdf
• H. Edelsbrunner. An acyclicity theorem for cell complexes in d dimensions. Combinatorica 10 (1990), 251-260. pdf
• H. Edelsbrunner and D. L. Souvaine. Computing least median of squares regression lines and guided topological sweep. J. Amer. Statist. Assoc. 85 (1990), 115-119. pdf
• D. P. Dobkin, H. Edelsbrunner and M. H. Overmars. Searching for empty convex polygons. Algorithmica 5 (1990), 561-571. pdf
• H. Edelsbrunner and E. P. Mücke. Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graphics 9 (1990), 66-104. pdf
• H. Edelsbrunner, A. D. Robison and X. J. Shen. Covering convex sets with non-overlapping polygons. Discrete Math. 81 (1990), 153-164. pdf
• H. Edelsbrunner and M. Sharir. The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2. Discrete Comput. Geom. 5 (1990), 35-42. pdf
• D. P. Dobkin, H. Edelsbrunner and C. K. Yap. Probing convex polytopes. Autonomous Robot Vehicles, 328-341, ed.: I. J. Cox and G. T. Wilfong, Springer-Verlag, New York, 1990. pdf

1989

• H. Edelsbrunner. Spatial triangulations with dihedral angle conditions. In ``Proc. Internat. Workshop Discrete Algorithms and Complexity, 1989'', 83-89, Fukuoka, Japan. pdf
• H. Edelsbrunner, L. J. Guibas, J. Hershberger, R. Seidel, M. Sharir, J. Snoeyink and E. Welzl. Implicitly representing arrangements of lines or segments. Discrete Comput. Geom. 4 (1989), 433-466. pdf
• H. Edelsbrunner, L. J. Guibas, J. Hershberger, J. Pach, R. Pollack, R. Seidel, M. Sharir and J. Snoeyink. On arrangements of Jordan arcs with three intersections per pair. Discrete Comput. Geom. 4 (1989), 523-539. pdf
• F. F. Yao, D. P. Dobkin, H. Edelsbrunner and M. S. Paterson. Partitioning space for range queries. SIAM J. Comput. 18 (1989), 371-384. pdf
• H. Edelsbrunner, N. Hasan, R. Seidel and X. J. Shen. Circles through two points that always enclose many points. Geometriae Dedicata 32 (1989), 1-12. pdf
• H. Edelsbrunner. The upper envelope of piecewise linear functions: tight bounds on the number of faces. Discrete Comput. Geom. 4 (1989), 337-343. pdf
• H. Edelsbrunner, L. J. Guibas and M. Sharir. The upper envelope of piecewise linear functions: algorithms and applications. Discrete Comput. Geom. 4 (1989), 311-336. pdf
• H. Edelsbrunner, G. Rote and E. Welzl. Testing the necklace condition for shortest tours and optimal factors in the plane. Theoret. Comput. Sci. 66 (1989), 157-180. pdf
• B. Chazelle, H. Edelsbrunner and L. J. Guibas. The complexity of cutting complexes. Discrete Comput. Geom. 4 (1989), 139-182. pdf
• H. Edelsbrunner and S. S. Skiena. On the number of furthest neighbour pairs in a point set. Amer. Math. Monthly 96 (1989), 614-618. pdf
• H. Edelsbrunner and L. J. Guibas. Topologically sweeping an arrangement. J. Comput. System Sci. 38 (1989), 165-194 and 42 (1991), 249-251. pdf, corrigendum

1988

• H. Edelsbrunner. Geometric structures in computational geometry. In ``Proc. 15th Internat. Coll. on Autom. Lang. and Progr., 1988'', 201-213, Springer-Verlag. pdf
• H. Edelsbrunner and S. S. Skiena. Probing convex polygons with x-rays. SIAM J. Comput. 17 (1988), 870-882. pdf
• H. Edelsbrunner and F. P. Preparata. Minimum polygonal separation. Inform. and Comput. 77 (1988), 218-232. pdf

1987

• H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Heidelberg, Germany, 1987.
• H. Edelsbrunner, J. Pach, J. T. Schwartz and M. Sharir. On the lower envelope of bivariate functions and its applications. In ``Proc. 28th Ann. IEEE Sympos. Found. Comput. Sci. 1987'', 27-37. pdf
• H. Edelsbrunner and X. J. Shen. A tight lower bound on the size of visibility graphs. Inform. Process. Lett. 26 (1987), 61-64. pdf
• B. Chazelle and H. Edelsbrunner. Linear space data structures for two types of range search. Discrete Comput. Geom. 2 (1987), 113-126. pdf
• B. Chazelle and H. Edelsbrunner. An improved algorithm for constructing kth-order Voronoi diagrams. IEEE Trans. Comput. C-36 (1987), 1349-1354. pdf
• M. H. Overmars and H. Edelsbrunner. Zooming by repeated range detection. Inform. Process. Lett. 24 (1987), 413-417. pdf
• D. P. Dobkin and H. Edelsbrunner. Space searching for intersecing objects. J. Algorithms 8 (1987), 348-361. pdf

1986

• H. Edelsbrunner and R. Waupotitsch. Computing a ham-sandwich cut in two dimensions. J. Symbolic Comput. 2 (1986), 171-178. pdf
• H. Edelsbrunner and R. Seidel. Voronoi diagrams and arrangements. Discrete Comput. Geom. 1 (1986), 25-44. pdf
• H. Edelsbrunner and G. Stöckl. The number of extreme pairs of finite point-sets in Euclidean spaces. J. Combin. Theory Ser. A 43 (1986), 344-349. pdf
• H. Edelsbrunner. Edge-skeletons in arrangements with applications. Algorithmica 1 (1986), 93-109. pdf
• H. Edelsbrunner and D. Haussler. The complexity of cells in three-dimensional arrangements. Discrete Math. 60 (1986), 139-146. pdf
• H. Edelsbrunner, J. O'Rourke and R. Seidel. Constructing arrangements of lines and hyperplanes with applications. SIAM J. Comput. 15 (1986), 341-363. pdf
• H. Edelsbrunner and J. W. Jaromczyk. How often can you see yourself in a convex configuration of mirrors? Congressus Numerantium 53 (1986), 193-200. pdf
• H. Edelsbrunner, G. Haring and D. Hilbert. Rectangular point location in d dimensions with applications. Comput. J. 29 (1986), 76-82. pdf
• H. Edelsbrunner, L. J. Guibas and J. Stolfi. Optimal point location in a monotone subdivision. SIAM J. Comput. 15 (1986), 317-340. pdf
• H. Edelsbrunner and H. Welzl. Halfplanar range search in linear space and O(n^0.695) query time. Inform. Process. Lett. 23 (1986), 289-293. pdf
• H. Edelsbrunner and E. Welzl. On the maximal number of edges of many faces in an arrangement. J. Combin. Theory Ser. A 41 (1986), 159-166. pdf
• H. Edelsbrunner and E. Welzl. Constructing belts in two-dimensional arrangements with applications. SIAM J. Comput. 15 (1986), 271-284. pdf

1985

• B. Chazelle and H. Edelsbrunner. Optimal solutions for a class of point retrieval problems. J. Symbolic Comput. 1 (1985), 47-56. pdf
• W. H. E. Day and H. Edelsbrunner. Investigation of proportional link linkage clustering methods. J. Classification 2 (1985), 239-254. pdf
• H. Edelsbrunner and H. A. Maurer. Finding extreme points in three dimensions and solving the post-office problem in the plane. Inform. Process. Lett. 21 (1985), 39-47. pdf
• H. Edelsbrunner and M. H. Overmars. Batched dynamic solutions to decomposable searching problems. J. Algorithms 6 (1985), 515-542. pdf
• H. Edelsbrunner and E. Welzl. On the number of line separations of a finite set in the plane. J. Combin. Theory Ser. A 38 (1985), 15-29. pdf
• H. Edelsbrunner. Computing the extreme distances between two convex polygons. J. Algorithms 6 (1985), 213-224. pdf
• H. Edelsbrunner. Finding transversals for sets of simple geometric figures. Theoret. Comput. Sci. 35 (1985), 55-69. pdf

1984

• H. Edelsbrunner. Key-problems and key-methods in computational geometry. In``Proc. Sympos. Theoret. Aspects Comput. Sci., 1984'', 1-13, Springer-Verlag. pdf
• D. P. Dobkin and H. Edelsbrunner. Ham-sandwich theorems applied to intersection problems. In ``Proc. Internat. Workshop on Graphtheoret. Concepts in Comput. Sci. 1984'', 88-99, Teubner. pdf
• W. H. E. Day and H. Edelsbrunner. Efficient algorithms for agglomerative hierarchical clustering methods. J. Classification 1 (1984), 7-24. pdf
• H. Edelsbrunner, M. H. Overmars and R. Seidel. Some methods of computational geometry applied to computer graphics. Comput. Vision, Graphics, Image Process. 28 (1984), 92-108. pdf
• H. Edelsbrunner, J. O'Rourke and E. Welzl. Stationing guards in rectilinear art galleries. Comput. Vision, Graphics, Image Process. 28 (1984), 167-176. pdf
• F. Aurenhammer and H. Edelsbrunner. An optimal algorithm for constructing the weighted Voronoi diagram in the plane. Pattern Recognition 17 (1984), 251-257. pdf
• H. Edelsbrunner, J. v. Leeuwen, Th. Ottmann and D. Wood. Computing the connected components of simple rectilinear geometrical objects in d-space. RAIRO Inform. Theor. 18 (1984), 171-183. pdf

1983

• H. Edelsbrunner, D. G. Kirkpatrick and R. Seidel. On the shape of a set of points in the plane. IEEE Trans. Inform. Theory IT-29 (1983), 551-559. pdf
• H. Edelsbrunner. A new approach to rectangle intersections -- part II. Internat. J. Comput. Math. 13 (1983), 221-229. pdf
• H. Edelsbrunner. A new approach to rectangle intersections -- part I. Internat. J. Comput. Math. 13 (1983), 209-219. pdf
• H. Edelsbrunner. Neue Entwicklungen im Bereich Datenstrukturen. Ueberblicke Informationsverarbeitung 1983, 55-109, ed.: H. A. Maurer, BI Wissenschaftsverlag, Mannheim, Germany. pdf
• H. Edelsbrunner, M. H. Overmars and D. Wood. Graphics in Flatland: a case study. Advances in Computing Research Vol. 1, 35-59, ed.: F. P. Preparata, Jai Press, London, 1983. pdf
• W. Bucher and H. Edelsbrunner. On expected- and worst-case segment trees. Advances in Computing Research Vol. 1, 109-125, ed.: F. P. Preparata, Jai Press, London, 1983. pdf

1982

• H. Edelsbrunner, H. A. Maurer, F. P. Preparata, A. L. Rosenberg, E. Welzl and D. Wood. Stabbing line segments. BIT 22 (1982), 274-281. pdf
• H. Edelsbrunner and M. H. Overmars. On the equivalence of some rectangle problems. Inform. Process. Lett. 14 (1982), 124-127. pdf
• H. Edelsbrunner, D. G. Kirkpatrick and H. A. Maurer. Polygonal intersection searching. Inform. Process. Lett. 14 (1982), 74-79. pdf

1981

• H. Edelsbrunner. Reporting intersections of geometric objects by means of covering rectangles. Bulletin of the EATCS 13 (1981), 7-11. pdf
• H. Edelsbrunner. A note on dynamic range searching. Bulletin of the EATCS 15 (1981), 34-40. pdf
• H. Edelsbrunner and H. A. Maurer. A space-optimal solution of general region location. Theoret. Comput. Sci. 16 (1981), 329-336. pdf
• H. Edelsbrunner and H. A. Maurer. On the intersection of orthogonal objects. Inform. Process. Lett. 13 (1981), 177-181. pdf

1980

• H. Edelsbrunner. Dynamic data structures for orthogonal intersection queries. Report F59, Inst. Information Process., Graz Univ. Technology, Austria, 1980. pdf