278 Publications

Mark all

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

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed

278 Publications

Mark all

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

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed