Herbert Edelsbrunner

Edelsbrunner Group

300 Publications

Mark all

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

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed

Grants


300 Publications

Mark all

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

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed