Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHerbert Edelsbrunner
Person information
- affiliation: Institute of Science and Technology Austria, Klosterneuburg, Austria
- affiliation (former): Duke University, Durham, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2010
[b3]Herbert Edelsbrunner, John Harer:
Computational Topology - an Introduction. American Mathematical Society 2010, ISBN 978-0-8218-4925-5, pp. I-XII, 1-241- 2001
- [b2]Herbert Edelsbrunner:
Geometry and Topology for Mesh Generation. Cambridge monographs on applied and computational mathematics 7, Cambridge University Press 2001, ISBN 978-0-521-68207-7, pp. I-XII, 1-177 - 1987
- [b1]Herbert Edelsbrunner:
Algorithms in Combinatorial Geometry. EATCS Monographs on Theoretical Computer Science 10, Springer 1987, ISBN 978-3-642-64873-1, pp. I-XV, 1-423
Journal Articles
- 2023
- [j147]Herbert Edelsbrunner
, Georg Osang:
A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes. Algorithmica 85(1): 277-295 (2023) - [j146]Patrice Koehl, Arseniy V. Akopyan, Herbert Edelsbrunner:
Computing the Volume, Surface Area, Mean, and Gaussian Curvatures of Molecules and Their Derivatives. J. Chem. Inf. Model. 63(3): 973-985 (2023) - 2022
- [j145]Ranita Biswas, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Morteza Saghafian:
Continuous and Discrete Radius Functions on Voronoi Tessellations and Delaunay Mosaics. Discret. Comput. Geom. 67(3): 811-842 (2022) - 2021
- [j144]Herbert Edelsbrunner, Georg Osang:
The Multi-Cover Persistence of Euclidean Balls. Discret. Comput. Geom. 65(4): 1296-1313 (2021) - 2020
- [j143]Herbert Edelsbrunner, Katharina Ölsböck:
Tri-partitions and Bases of an Ordered Complex. Discret. Comput. Geom. 64(3): 759-775 (2020) - [j142]Ulrich Bauer, Herbert Edelsbrunner, Grzegorz Jablonski, Marian Mrozek:
Čech-Delaunay gradient flow and homology inference for self-maps. J. Appl. Comput. Topol. 4(4): 455-480 (2020) - [j141]Herbert Edelsbrunner, Ziga Virk, Hubert Wagner:
Topological data analysis in information space. J. Comput. Geom. 11(2): 162-182 (2020) - 2019
- [j140]Herbert Edelsbrunner, Katharina Ölsböck:
Holes and dependences in an ordered complex. Comput. Aided Geom. Des. 73: 1-15 (2019) - [j139]Herbert Edelsbrunner, Anton V. Nikitenko:
Poisson-Delaunay Mosaics of Order k. Discret. Comput. Geom. 62(4): 865-878 (2019) - 2018
- [j138]Herbert Edelsbrunner, Mabel Iglesias Ham:
Multiple covers with balls I: Inclusion-exclusion. Comput. Geom. 68: 119-133 (2018) - [j137]Herbert Edelsbrunner, Hubert Wagner:
Topological data analysis with Bregman divergences. J. Comput. Geom. 9(2): 67-86 (2018) - [j136]Herbert Edelsbrunner, Mabel Iglesias Ham:
On the Optimality of the FCC Lattice for Soft Sphere Packing. SIAM J. Discret. Math. 32(1): 750-782 (2018) - 2017
- [j135]Herbert Edelsbrunner, Alexey A. Glazyrin, Oleg R. Musin, Anton V. Nikitenko:
The Voronoi functional is maximized by the Delaunay triangulation in the plane. Comb. 37(5): 887-910 (2017) - 2016
- [j134]Herbert Edelsbrunner, Mabel Iglesias Ham:
Multiple Covers with Balls II: Weighted Averages. Electron. Notes Discret. Math. 54: 169-174 (2016) - [j133]Olga D. Dunaeva, Herbert Edelsbrunner, Anton Lukyanov, Michael Machin, Daria Malkova, Roman Kuvaev, Sergey Kashin:
The classification of endoscopy images with persistent homology. Pattern Recognit. Lett. 83: 13-22 (2016) - 2015
- [j132]Thanh-Tung Cao, Herbert Edelsbrunner, Tiow Seng Tan:
Triangulations from topologically correct digital Voronoi diagrams. Comput. Geom. 48(7): 507-519 (2015) - [j131]Herbert Edelsbrunner, Grzegorz Jablonski, Marian Mrozek:
The Persistent Homology of a Self-Map. Found. Comput. Math. 15(5): 1213-1244 (2015) - 2014
- [j130]Herbert Edelsbrunner, Florian Pausinger:
Stable Length Estimates of Tube-Like Shapes. J. Math. Imaging Vis. 50(1-2): 164-177 (2014) - 2013
- [j129]Herbert Edelsbrunner, Brittany Terese Fasy, Günter Rote:
Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions. Discret. Comput. Geom. 49(4): 797-822 (2013) - 2012
- [j128]Herbert Edelsbrunner, Michael Kerber:
Dual Complexes of Cubical Subdivisions of ℝ n. Discret. Comput. Geom. 47(2): 393-414 (2012) - [j127]Paul Bendich, Sergio Cabello, Herbert Edelsbrunner:
A point calculus for interlevel set homology. Pattern Recognit. Lett. 33(11): 1436-1444 (2012) - 2011
- [j126]Herbert Edelsbrunner, János Pach, Günter M. Ziegler:
Letter from the New Editors-in-Chief. Discret. Comput. Geom. 45(1): 1-2 (2011) - [j125]Herbert Edelsbrunner, Dmitriy Morozov, Amit K. Patel:
Quantifying Transversality by Measuring the Robustness of Intersections. Found. Comput. Math. 11(3): 345-361 (2011) - [j124]Bei Wang, Herbert Edelsbrunner, Dmitriy Morozov:
Computing elevation maxima by searching the gauss sphere. ACM J. Exp. Algorithmics 16 (2011) - [j123]Rien van de Weygaert, Gert Vegter, Herbert Edelsbrunner, Bernard J. T. Jones, Pratyush Pranav, Changbom Park, Wojciech A. Hellwing, Bob Eldering, Nico Kruithof, E. G. P. (Patrick) Bos, Johan Hidding, Job Feldbrugge, Eline ten Have, Matti van Engelen, Manuel Caroli, Monique Teillaud:
Alpha, Betti and the Megaparsec Universe: On the Topology of the Cosmic Web. Trans. Comput. Sci. 14: 60-101 (2011) - 2010
- [j122]David Cohen-Steiner, Herbert Edelsbrunner, John Harer, Yuriy Mileyko:
Lipschitz Functions Have Lp-Stable Persistence. Found. Comput. Math. 10(2): 127-139 (2010) - [j121]Paul Bendich, Herbert Edelsbrunner, Michael Kerber:
Computing Robustness and Persistence for Images. IEEE Trans. Vis. Comput. Graph. 16(6): 1251-1260 (2010) - 2009
- [j120]David Cohen-Steiner, Herbert Edelsbrunner, John Harer:
Extending Persistence Using Poincaré and Lefschetz Duality. Found. Comput. Math. 9(1): 79-103 (2009) - [j119]David Cohen-Steiner, Herbert Edelsbrunner, John Harer:
Extending Persistence Using Poincaré and Lefschetz Duality. Found. Comput. Math. 9(1): 133-134 (2009) - 2008
- [j118]Herbert Edelsbrunner, John Harer, Ajith Mascarenhas, Valerio Pascucci, Jack Snoeyink:
Time-varying Reeb graphs for continuous space-time data. Comput. Geom. 41(3): 149-166 (2008) - 2007
- [j117]Dominique Attali, Herbert Edelsbrunner:
Inclusion-Exclusion Formulas from Independent Complexes. Discret. Comput. Geom. 37(1): 59-77 (2007) - [j116]David Cohen-Steiner, Herbert Edelsbrunner, John Harer:
Stability of Persistence Diagrams. Discret. Comput. Geom. 37(1): 103-120 (2007) - [j115]David Cohen-Steiner, Herbert Edelsbrunner:
Inequalities for the Curvature of Curves and Surfaces. Found. Comput. Math. 7(4): 391-404 (2007) - 2006
- [j114]Pankaj K. Agarwal, Herbert Edelsbrunner, John Harer, Yusu Wang:
Extreme Elevation on a 2-Manifold. Discret. Comput. Geom. 36(4): 553-572 (2006) - [j113]Yih-En Andrew Ban, Herbert Edelsbrunner, Johannes Rudolph:
Interface surfaces for protein-protein complexes. J. ACM 53(3): 361-378 (2006) - 2004
- [j112]Pankaj K. Agarwal, Herbert Edelsbrunner, Yusu Wang:
Computing the Writhing Number of a Polygonal Knot. Discret. Comput. Geom. 32(1): 37-53 (2004) - [j111]Kree Cole-McLaughlin, Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci:
Loops in Reeb Graphs of 2-Manifolds. Discret. Comput. Geom. 32(2): 231-244 (2004) - [j110]Robert L. Bryant, Herbert Edelsbrunner, Patrice Koehl, Michael Levitt:
The Area Derivative of a Space-Filling Diagram. Discret. Comput. Geom. 32(3): 293-308 (2004) - [j109]Peer-Timo Bremer, Herbert Edelsbrunner, Bernd Hamann, Valerio Pascucci:
A Topological Hierarchy for Functions on Triangulated Surfaces. IEEE Trans. Vis. Comput. Graph. 10(4): 385-396 (2004) - [j108]Vijay Natarajan, Herbert Edelsbrunner:
Simplification of Three-Dimensional Density Maps. IEEE Trans. Vis. Comput. Graph. 10(5): 587-597 (2004) - 2003
- [j107]Ho-Lun Cheng, Herbert Edelsbrunner:
Area, perimeter and derivatives of a skin curve. Comput. Geom. 26(2): 173-192 (2003) - [j106]Herbert Edelsbrunner, John Harer, Afra Zomorodian:
Hierarchical Morse - Smale Complexes for Piecewise Linear 2-Manifolds. Discret. Comput. Geom. 30(1): 87-107 (2003) - 2002
- [j105]Pankaj K. Agarwal, Leonidas J. Guibas, Herbert Edelsbrunner, Jeff Erickson, Michael Isard, Sariel Har-Peled, John Hershberger, Christian S. Jensen, Lydia E. Kavraki, Patrice Koehl, Ming C. Lin, Dinesh Manocha, Dimitris N. Metaxas, Brian Mirtich, David M. Mount, S. Muthukrishnan, Dinesh K. Pai, Elisha Sacks, Jack Snoeyink, Subhash Suri, Ouri Wolfson:
Algorithmic issues in modeling motion. ACM Comput. Surv. 34(4): 550-572 (2002) - [j104]Herbert Edelsbrunner, David Letscher, Afra Zomorodian:
Topological Persistence and Simplification. Discret. Comput. Geom. 28(4): 511-533 (2002) - [j103]Herbert Edelsbrunner, Damrong Guoy:
An Experimental Study of Sliver Exudation. Eng. Comput. 18(3): 229-240 (2002) - [j102]Afra Zomorodian, Herbert Edelsbrunner:
Fast Software for Box Intersections. Int. J. Comput. Geom. Appl. 12(1-2): 143-172 (2002) - [j101]Herbert Edelsbrunner, Damrong Guoy:
Sink Insertion for Mesh Improvement. Int. J. Found. Comput. Sci. 13(2): 223-242 (2002) - 2001
- [j100]Ho-Lun Cheng, Herbert Edelsbrunner, Ping Fu:
Shape space from deformation. Comput. Geom. 19(2-3): 191-204 (2001) - [j99]Siu-Wing Cheng, Herbert Edelsbrunner, Ping Fu, Ka-Po Lam:
Design and analysis of planar shape deformation. Comput. Geom. 19(2-3): 205-218 (2001) - [j98]Ho-Lun Cheng, Tamal K. Dey, Herbert Edelsbrunner, John Sullivan:
Dynamic Skin Triangulation. Discret. Comput. Geom. 25(4): 525-568 (2001) - [j97]Herbert Edelsbrunner:
180 Wrapped Tubes. J. Univers. Comput. Sci. 7(5): 379-399 (2001) - 2000
- [j96]Herbert Edelsbrunner, Daniel R. Grayson:
Edgewise Subdivision of a Simplex. Discret. Comput. Geom. 24(4): 707-719 (2000) - [j95]Herbert Edelsbrunner, Roman Waupotitsch:
Adaptive Simplicial Grids from Cross-Sections of Monotone Complexes. Int. J. Comput. Geom. Appl. 10(3): 267-284 (2000) - [j94]Siu-Wing Cheng, Tamal K. Dey, Herbert Edelsbrunner, Michael A. Facello, Shang-Hua Teng:
Sliver exudation. J. ACM 47(5): 883-904 (2000) - 1999
- [j93]Herbert Edelsbrunner:
Deformable Smooth Surface Design. Discret. Comput. Geom. 21(1): 87-115 (1999) - 1998
- [j92]Herbert Edelsbrunner, Michael A. Facello, Jie Liang:
On the Definition and the Construction of Pockets in Macromolecules. Discret. Appl. Math. 88(1-3): 83-102 (1998) - 1997
- [j91]Herbert Edelsbrunner, Roman Waupotitsch:
A Combinatorial Approach to Cartograms. Comput. Geom. 7: 343-360 (1997) - [j90]Herbert Edelsbrunner, Pavel Valtr, Emo Welzl:
Cutting Dense Point Sets in Half. Discret. Comput. Geom. 17(3): 243-255 (1997) - [j89]Herbert Edelsbrunner, Edgar A. Ramos:
Inclusion - Exclusion Complexes for Pseudodisk Collections. Discret. Comput. Geom. 17(3): 287-306 (1997) - [j88]Herbert Edelsbrunner, Nimish R. Shah:
Triangulating Topological Spaces. Int. J. Comput. Geom. Appl. 7(4): 365-378 (1997) - 1996
- [j87]Herbert Edelsbrunner, Nimish R. Shah:
Incremental Topological Flipping Works for Regular Triangulations. Algorithmica 15(3): 223-241 (1996) - [j86]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jorge Stolfi:
Lines in Space: Combinatorics and Algorithms. Algorithmica 15(5): 428-447 (1996) - [j85]Nataraj Akkiraju, Herbert Edelsbrunner, Ping Fu, Jiang Qian:
Viewing geometric protein structures from inside a CAVE. IEEE Computer Graphics and Applications 16(4): 58-61 (1996) - [j84]Nataraj Akkiraju, Herbert Edelsbrunner:
Triangulating the Surface of a Molecule. Discret. Appl. Math. 71(1-3): 5-22 (1996) - 1995
- [j83]Cecil Jose A. Delfinado, Herbert Edelsbrunner:
An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere. Comput. Aided Geom. Des. 12(7): 771-784 (1995) - [j82]Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl:
Improved Bounds on Weak epsilon-Nets for Convex Sets. Discret. Comput. Geom. 13: 1-15 (1995) - [j81]Herbert Edelsbrunner:
The Union of Balls and Its Dual Shape. Discret. Comput. Geom. 13: 415-440 (1995) - 1994
- [j80]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
Algorithms for Bichromatic Line-Segment Problems Polyhedral Terrains. Algorithmica 11(2): 116-132 (1994) - [j79]Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink:
Ray Shooting in Polygons Using Geodesic Triangulations. Algorithmica 12(1): 54-68 (1994) - [j78]Tamal K. Dey, Herbert Edelsbrunner:
Counting Triangle Crossing and Halving Planes. Discret. Comput. Geom. 12: 231-289 (1994) - [j77]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir:
Selecting Heavily Covered Points. SIAM J. Comput. 23(6): 1138-1151 (1994) - [j76]Herbert Edelsbrunner, Ernst P. Mücke:
Three-dimensional alpha shapes. ACM Trans. Graph. 13(1): 43-72 (1994) - 1993
- [j75]Marshall W. Bern, Herbert Edelsbrunner, David Eppstein, Scott A. Mitchell, Tiow Seng Tan:
Edge Insertion for Optimal Triangulations. Discret. Comput. Geom. 10: 47-65 (1993) - [j74]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
Diameter, Width, Closest Line Pair, and Parametric Searching. Discret. Comput. Geom. 10: 183-196 (1993) - [j73]Herbert Edelsbrunner, Tiow Seng Tan:
An Upper Bound for Conforming Delaunary Triangulations. Discret. Comput. Geom. 10: 193-213 (1993) - [j72]Herbert Edelsbrunner, Raimund Seidel, Micha Sharir:
On the Zone Theorem for Hyperplane Arrangements. SIAM J. Comput. 22(2): 418-429 (1993) - [j71]Herbert Edelsbrunner, Tiow Seng Tan:
A Quadratic Time Algorithm for the Minimax Length Triangulation. SIAM J. Comput. 22(3): 527-551 (1993) - [j70]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink:
Computing a Face in an Arrangement of Line Segments and Related Problems. SIAM J. Comput. 22(6): 1286-1302 (1993) - 1992
- [j69]Boris Aronov, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
The number of edges of many faces in a line segment arrangement. Comb. 12(3): 261-274 (1992) - [j68]Alok Aggarwal, Herbert Edelsbrunner, Prabhakar Raghavan, Prasoon Tiwari:
Optimal Time Bounds for Some Proximity Problems in the Plane. Inf. Process. Lett. 42(1): 55-60 (1992) - [j67]Bernard Chazelle, Herbert Edelsbrunner:
An Optimal Algorithm for Intersecting Line Segments in the Plane. J. ACM 39(1): 1-54 (1992) - [j66]Herbert Edelsbrunner, Tiow Seng Tan, Roman Waupotitsch:
An O(n2 log n) Time Algorithm for the Minmax Angle Triangulation. SIAM J. Sci. Comput. 13(4): 994-1008 (1992) - [j65]Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir:
Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms. Theor. Comput. Sci. 92(2): 319-336 (1992) - 1991
- [j64]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink:
Counting and Cutting Cycles of Lines and Rods in Space. Comput. Geom. 1: 305-323 (1991) - [j63]Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf:
Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. Discret. Comput. Geom. 6: 407-422 (1991) - [j62]Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Rephael Wenger:
Points and Triangles in the Plane and Halving Planes in Space. Discret. Comput. Geom. 6: 435-442 (1991) - [j61]Herbert Edelsbrunner, Leonidas J. Guibas:
Corrigendum: Topologically Sweeping an Arrangement. J. Comput. Syst. Sci. 42(2): 249-251 (1991) - [j60]Herbert Edelsbrunner, Péter Hajnal:
A lower bound on the number of unit distances between the vertices of a convex polygon. J. Comb. Theory, Ser. A 56(2): 312-316 (1991) - [j59]Herbert Edelsbrunner, Weiping Shi:
An O(n log² h) Time Algorithm for the Three-Dimensional Convex Hull Problem. SIAM J. Comput. 20(2): 259-269 (1991) - [j58]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications. Theor. Comput. Sci. 84(1): 77-105 (1991) - 1990
- [j57]David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars:
Searching for Empty Convex Polygons. Algorithmica 5(4): 561-571 (1990) - [j56]Herbert Edelsbrunner:
An acyclicity theorem for cell complexes in d dimension. Comb. 10(3): 251-260 (1990) - [j55]Herbert Edelsbrunner, Micha Sharir:
The Maximum Number of Ways To Stab n Convex Nonintersecting Sets in the Plane Is 2n-2. Discret. Comput. Geom. 5: 35-42 (1990) - [j54]Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl:
Combinatorial Complexity Bounds for Arrangement of Curves and Spheres. Discret. Comput. Geom. 5: 99-160 (1990) - [j53]Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
The Complexity and Construction of Many Faces in Arrangement of Lines and of Segments. Discret. Comput. Geom. 5: 161-196 (1990) - [j52]Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
The Complexity of Many Cells in Arrangements of Planes and Related Problems. Discret. Comput. Geom. 5: 197-216 (1990) - [j51]Herbert Edelsbrunner, Arch Douglas Robison, Xiaojun Shen:
Covering convex sets with non-overlapping polygons. Discret. Math. 81(2): 153-164 (1990) - [j50]Herbert Edelsbrunner:
The Computational Geometry Column. Bull. EATCS 42: 132-134 (1990) - [j49]Herbert Edelsbrunner, Mark H. Overmars, Emo Welzl, Irith Ben-Arroyo Hartman, Jack A. Feldman:
Ranking intervals under visibility constraints. Int. J. Comput. Math. 34(3-4): 129-144 (1990) - [j48]Herbert Edelsbrunner, Franco P. Preparata, Douglas B. West:
Tetrahedrizing Point Sets in Three Dimensions. J. Symb. Comput. 10(3/4): 335-348 (1990) - [j47]Herbert Edelsbrunner, Ernst P. Mücke:
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graph. 9(1): 66-104 (1990) - 1989
- [j46]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas:
The Complexity of Cutting Complexes. Discret. Comput. Geom. 4: 139-181 (1989) - [j45]Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications. Discret. Comput. Geom. 4: 311-336 (1989) - [j44]Herbert Edelsbrunner:
The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces. Discret. Comput. Geom. 4: 337-343 (1989) - [j43]Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl:
Implicitly Representing Arrangements of Lines or Segments. Discret. Comput. Geom. 4: 433-466 (1989) - [j42]Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink:
On Arrangement of Jordan Arcs with Three Intersection per Pair. Discret. Comput. Geom. 4: 523-539 (1989) - [j41]Herbert Edelsbrunner:
The Computation Geometry Column. Bull. EATCS 37: 109-116 (1989) - [j40]Herbert Edelsbrunner:
The Computation Geometry Column. Bull. EATCS 38: 74-78 (1989) - [j39]Herbert Edelsbrunner, Leonidas J. Guibas:
Topologically Sweeping an Arrangement. J. Comput. Syst. Sci. 38(1): 165-194 (1989) - [j38]F. Frances Yao, David P. Dobkin, Herbert Edelsbrunner, Mike Paterson:
Partitioning Space for Range Queries. SIAM J. Comput. 18(2): 371-384 (1989) - [j37]Herbert Edelsbrunner, Günter Rote, Emo Welzl:
Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane. Theor. Comput. Sci. 66(2): 157-180 (1989) - 1988
- [j36]Herbert Edelsbrunner:
The computational Geometry Column. Bull. EATCS 34: 32-38 (1988) - [j35]Herbert Edelsbrunner:
The computational Geometry Column. Bull. EATCS 35: 66-68 (1988) - [j34]Herbert Edelsbrunner, Franco P. Preparata:
Minimum Polygonal Separation. Inf. Comput. 77(3): 218-232 (1988) - [j33]Herbert Edelsbrunner, Steven Skiena:
Probing Convex Polygons with X-Rays. SIAM J. Comput. 17(5): 870-882 (1988) - 1987
- [j32]Bernard Chazelle, Herbert Edelsbrunner:
Linear Space Data Structures for Two Types of Range Search. Discret. Comput. Geom. 2: 113-126 (1987) - [j31]Herbert Edelsbrunner:
The Computational Geometry Column. Bull. EATCS 33: 23-24 (1987) - [j30]Herbert Edelsbrunner, Mark H. Overmars:
Zooming by Repeated Range Detection. Inf. Process. Lett. 24(6): 413-417 (1987) - [j29]Xiaojun Shen, Herbert Edelsbrunner:
A Tight Lower Bound on the Size of Visibility Graphs. Inf. Process. Lett. 26(2): 61-64 (1987) - [j28]David P. Dobkin, Herbert Edelsbrunner:
Space Searching for Intersecting Objects. J. Algorithms 8(3): 348-361 (1987) - [j27]Bernard Chazelle, Herbert Edelsbrunner:
An Improved Algorithm for Constructing k th-Order Voronoi Diagrams. IEEE Trans. Computers 36(11): 1349-1354 (1987) - 1986
- [j26]Herbert Edelsbrunner:
Edge-Skeletons in Arrangements with Applications. Algorithmica 1(1): 93-109 (1986) - [j25]Herbert Edelsbrunner, G. Haring, D. Hilbert:
Rectangular Point Location in d Dimensions with Applications. Comput. J. 29(1): 76-82 (1986) - [j24]Herbert Edelsbrunner, Raimund Seidel:
Voronoi Diagrams and Arrangements. Discret. Comput. Geom. 1: 25-44 (1986) - [j23]Herbert Edelsbrunner, David Haussler:
The complexity of cells in three-dimensional arrangements. Discret. Math. 60: 139-146 (1986) - [j22]Herbert Edelsbrunner, Emo Welzl:
Halfplanar Range Search in Linear Space and O(n^(0.695)) Query Time. Inf. Process. Lett. 23(6): 289-293 (1986) - [j21]Herbert Edelsbrunner, Emo Welzl:
On the maximal number of edges of many faces in an arrangement. J. Comb. Theory, Ser. A 41(2): 159-166 (1986) - [j20]Herbert Edelsbrunner, Gerd Stöckl:
The number of extreme pairs of finite point-sets in Euclidean spaces. J. Comb. Theory, Ser. A 43(2): 344-349 (1986) - [j19]Herbert Edelsbrunner, Roman Waupotitsch:
Computing a Ham-Sandwich Cut in Two Dimensions. J. Symb. Comput. 2(2): 171-178 (1986) - [j18]Herbert Edelsbrunner, Emo Welzl:
Constructing Belts in Two-Dimensional Arrangements with Applications. SIAM J. Comput. 15(1): 271-284 (1986) - [j17]Herbert Edelsbrunner, Leonidas J. Guibas, Jorge Stolfi:
Optimal Point Location in a Monotone Subdivision. SIAM J. Comput. 15(2): 317-340 (1986) - [j16]Herbert Edelsbrunner, Joseph O'Rourke, Raimund Seidel:
Constructing Arrangements of Lines and Hyperplanes with Applications. SIAM J. Comput. 15(2): 341-363 (1986) - 1985
- [j15]Herbert Edelsbrunner, Hermann A. Maurer:
Finding Extreme Points in Three Dimensions and Solving the Post-Office Problem in the Plane. Inf. Process. Lett. 21(1): 39-47 (1985) - [j14]Herbert Edelsbrunner:
Computing the Extreme Distances Between Two Convex Polygons. J. Algorithms 6(2): 213-224 (1985) - [j13]Herbert Edelsbrunner, Mark H. Overmars:
Batched Dynamic Solutions to Decomposable Searching Problems. J. Algorithms 6(4): 515-542 (1985) - [j12]Herbert Edelsbrunner, Emo Welzl:
On the Number of Line Separations of a Finite Set in the Plane. J. Comb. Theory, Ser. A 38(1): 15-29 (1985) - [j11]Bernard Chazelle, Herbert Edelsbrunner:
Optimal Solutions for a Class of Point Retrieval Problems. J. Symb. Comput. 1(1): 47-56 (1985) - [j10]Herbert Edelsbrunner:
Finding Transversals for Sets of Simple Geometric Figures. Theor. Comput. Sci. 35: 55-69 (1985) - 1984
- [j9]Herbert Edelsbrunner, Mark H. Overmars, Raimund Seidel:
Some methods of computational geometry applied to computer graphics. Comput. Vis. Graph. Image Process. 28(1): 92-108 (1984) - [j8]Herbert Edelsbrunner, Jan van Leeuwen, Thomas Ottmann, Derick Wood:
Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space. RAIRO Theor. Informatics Appl. 18(2): 171-183 (1984) - [j7]Franz Aurenhammer, Herbert Edelsbrunner:
An optimal algorithm for constructing the weighted voronoi diagram in the plane. Pattern Recognit. 17(2): 251-257 (1984) - 1983
- [j6]Herbert Edelsbrunner, David G. Kirkpatrick, Raimund Seidel:
On the shape of a set of points in the plane. IEEE Trans. Inf. Theory 29(4): 551-558 (1983) - 1982
- [j5]Herbert Edelsbrunner, Hermann A. Maurer, Franco P. Preparata, Arnold L. Rosenberg, Emo Welzl, Derick Wood:
Stabbing Line Segments. BIT 22(3): 274-281 (1982) - [j4]Herbert Edelsbrunner, Hermann A. Maurer, David G. Kirkpatrick:
Polygonal Intersection Searching. Inf. Process. Lett. 14(2): 74-79 (1982) - [j3]Herbert Edelsbrunner, Mark H. Overmars:
On the Equivalence of Some Rectangle Problems. Inf. Process. Lett. 14(3): 124-127 (1982) - 1981
- [j2]Herbert Edelsbrunner, Hermann A. Maurer:
On the Intersection of Orthogonal Objects. Inf. Process. Lett. 13(4/5): 177-181 (1981) - [j1]Herbert Edelsbrunner, Hermann A. Maurer:
A Space-Optimal Solution of General Region Location. Theor. Comput. Sci. 16: 329-336 (1981)
Conference and Workshop Papers
- 2024
- [c128]Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Monika Henzinger, Lara Ost:
Dynamically Maintaining the Persistent Homology of Time Series. SODA 2024: 243-295 - 2021
- [c127]Ranita Biswas, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Morteza Saghafian:
Counting Cells of Order-k Voronoi Tessellations in ℝ³ with Morse Theory. SoCG 2021: 16:1-16:15 - [c126]Herbert Edelsbrunner, Teresa Heiss, Vitaliy Kurlin, Philip Smith, Mathijs Wintraecken:
The Density Fingerprint of a Periodic Point Set. SoCG 2021: 32:1-32:16 - 2019
- [c125]Herbert Edelsbrunner, Ziga Virk, Hubert Wagner:
Topological Data Analysis in Information Space. SoCG 2019: 31:1-31:14 - 2018
- [c124]Herbert Edelsbrunner, Georg Osang:
The Multi-cover Persistence of Euclidean Balls. SoCG 2018: 34:1-34:14 - [c123]Herbert Edelsbrunner, Ziga Virk, Hubert Wagner:
Smallest Enclosing Spheres and Chernoff Points in BregmanGeometry. SoCG 2018: 35:1-35:13 - 2017
- [c122]Herbert Edelsbrunner, Hubert Wagner:
Topological Data Analysis with Bregman Divergences. SoCG 2017: 39:1-39:16 - 2015
- [c121]Mabel Iglesias Ham, Herbert Edelsbrunner, Vitaliy Kurlin:
Relaxed Disk Packing. CCCG 2015 - 2014
- [c120]Ulrich Bauer, Herbert Edelsbrunner:
The Morse Theory of Čech and Delaunay Filtrations. SoCG 2014: 484 - [c119]Herbert Edelsbrunner:
The Geometry and Topology of Data Analysis. DATA 2014: IS-5 - [c118]Herbert Edelsbrunner, Salman Parsa:
On the Computational Complexity of Betti Numbers: Reductions from Matrix Rank. SODA 2014: 152-160 - [c117]Olga D. Dunaeva, Herbert Edelsbrunner, Anton Lukyanov, Michael Machin, Daria Malkova:
The Classification of Endoscopy Images with Persistent Homology. SYNASC 2014: 565-570 - 2013
- [c116]Michael Kerber, Herbert Edelsbrunner:
3D kinetic alpha complexes and their implementation. ALENEX 2013: 70-77 - [c115]Herbert Edelsbrunner:
Persistent Homology in Image Processing. GbRPR 2013: 182-183 - 2012
- [c114]Herbert Edelsbrunner, Brittany Terese Fasy, Günter Rote:
Add isotropic Gaussian kernels at own risk: more and more resilient modes in higher dimensions. SCG 2012: 91-100 - [c113]Herbert Edelsbrunner, Michael Kerber:
Alexander duality for functions: the persistent behavior of land and water and shore. SCG 2012: 249-258 - [c112]Herbert Edelsbrunner, Olga Symonova:
The Adaptive Topology of a Digital Image. ISVD 2012: 41-48 - 2011
- [c111]Herbert Edelsbrunner, Michael Kerber:
Covering and Packing with Spheres by Diagonal Distortion in ℝn. Rainbow of Computer Science 2011: 20-35 - [c110]Chao Chen, Herbert Edelsbrunner:
Diffusion runs low on persistence fast. ICCV 2011: 423-430 - [c109]Ying Zheng, Steve Gu, Herbert Edelsbrunner, Carlo Tomasi, Philip Benfey:
Detailed reconstruction of 3D plant root shape. ICCV 2011: 2026-2033 - 2010
- [c108]Krishnendu Chatterjee, Laurent Doyen, Herbert Edelsbrunner, Thomas A. Henzinger, Philippe Rannou:
Mean-Payoff Automaton Expressions. CONCUR 2010: 269-283 - [c107]Paul Bendich, Herbert Edelsbrunner, Dmitriy Morozov, Amit K. Patel:
The Robustness of Level Sets. ESA (1) 2010: 1-10 - [c106]Paul Bendich, Herbert Edelsbrunner, Michael Kerber, Amit K. Patel:
Persistent Homology under Non-uniform Error. MFCS 2010: 12-23 - 2009
- [c105]Herbert Edelsbrunner, John Harer:
The Persistent Morse Complex Segmentation of a 3-Manifold. 3DPH 2009: 36-50 - [c104]David Cohen-Steiner, Herbert Edelsbrunner, John Harer, Dmitriy Morozov:
Persistent homology for kernels, images, and cokernels. SODA 2009: 1011-1020 - [c103]Bei Wang, Herbert Edelsbrunner, Dmitriy Morozov:
Computing Elevation Maxima by Searching the Gauss Sphere. SEA 2009: 281-292 - 2008
- [c102]Herbert Edelsbrunner, John Harer, Amit K. Patel:
Reeb spaces of piecewise linear mappings. SCG 2008: 242-250 - 2007
- [c101]Paul Bendich, David Cohen-Steiner, Herbert Edelsbrunner, John Harer, Dmitriy Morozov:
Inferring Local Homology from Sampled Stratified Spaces. FOCS 2007: 536-546 - [c100]Herbert Edelsbrunner:
An introduction to persistent homology. Symposium on Solid and Physical Modeling 2007: 9 - [c99]Dominique Attali, Herbert Edelsbrunner, Yuriy Mileyko:
Weak witnesses for Delaunay triangulations of submanifolds. Symposium on Solid and Physical Modeling 2007: 143-150 - [c98]Dominique Attali, Herbert Edelsbrunner, John Harer, Yuriy Mileyko:
Alpha-Beta Witness Complexes. WADS 2007: 386-397 - 2006
- [c97]David Cohen-Steiner, Herbert Edelsbrunner, Dmitriy Morozov:
Vines and vineyards by updating persistence in linear time. SCG 2006: 119-126 - [c96]Herbert Edelsbrunner, Dmitriy Morozov, Valerio Pascucci:
Persistence-sensitive simplification functions on 2-manifolds. SCG 2006: 127-134 - 2005
- [c95]Dominique Attali, Herbert Edelsbrunner:
Inclusion-exclusion formulas from independent complexes. SCG 2005: 247-254 - [c94]David Cohen-Steiner, Herbert Edelsbrunner, John Harer:
Stability of persistence diagrams. SCG 2005: 263-271 - [c93]David Cohen-Steiner, Herbert Edelsbrunner:
Inequalities for the curvature of curves and surfaces. SCG 2005: 272-277 - [c92]Alexander Tropsha, Herbert Edelsbrunner:
Session Introduction: Biogeometry: Applications of Computational Geometry to Molecular Structure. Pacific Symposium on Biocomputing 2005: 3-4 - [c91]Yusu Wang, Pankaj K. Agarwal, P. Brown, Herbert Edelsbrunner, Johannes Rudolph:
Coarse and Reliable Geometric Alignment for Protein Docking. Pacific Symposium on Biocomputing 2005: 66-77 - [c90]Herbert Edelsbrunner:
Surface Tiling with Differential Topology. Symposium on Geometry Processing 2005: 9-11 - [c89]Dominique Attali, David Cohen-Steiner, Herbert Edelsbrunner:
Extraction and Simplification of Iso-surfaces in Tandem. Symposium on Geometry Processing 2005: 139-148 - 2004
- [c88]Pankaj K. Agarwal, Herbert Edelsbrunner, John Harer, Yusu Wang:
Extreme elevation on a 2-manifold. SCG 2004: 357-365 - [c87]Herbert Edelsbrunner, John Harer, Ajith Mascarenhas, Valerio Pascucci:
Time-varying reeb graphs for continuous space-time data. SCG 2004: 366-372 - [c86]Yih-En Andrew Ban, Herbert Edelsbrunner, Johannes Rudolph:
Interface surfaces for protein-protein complexes. RECOMB 2004: 205-212 - [c85]Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci:
Local and Global Comparison of Continuous Functions. IEEE Visualization 2004: 275-280 - [c84]Vicky Choi, Pankaj K. Agarwal, Herbert Edelsbrunner, Johannes Rudolph:
Local Search Heuristic for Rigid Protein Docking. WABI 2004: 218-229 - 2003
- [c83]Ho-Lun Cheng, Herbert Edelsbrunner:
Area and Perimeter Derivatives of a Union of Disks. Computer Science in Perspective 2003: 88-97 - [c82]Kree Cole-McLaughlin, Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci:
Loops in reeb graphs of 2-manifolds. SCG 2003: 344-350 - [c81]Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci:
Morse-smale complexes for piecewise linear 3-manifolds. SCG 2003: 361-370 - [c80]Peer-Timo Bremer, Herbert Edelsbrunner, Bernd Hamann, Valerio Pascucci:
A Multi-Resolution Data Structure for 2-Dimensional Morse Functions. IEEE Visualization 2003: 139-146 - 2002
- [c79]Herbert Edelsbrunner:
Element Quality and Tetrahedral Meshes (Invited Talk). IMR 2002: 113 - [c78]Herbert Edelsbrunner, Alper Üngör:
Relaxed Scheduling in Dynamic Skin Triangulation. JCDCG 2002: 135-151 - [c77]Pankaj K. Agarwal, Herbert Edelsbrunner, Yusu Wang:
Computing the writhing number of a polygonal knot. SODA 2002: 791-799 - 2001
- [c76]Herbert Edelsbrunner, John Harer, Afra Zomorodian:
Hierarchical morse complexes for piecewise linear 2-manifolds. SCG 2001: 70-79 - [c75]Herbert Edelsbrunner, Damrong Guoy:
Sink-insertion for mesh improvement. SCG 2001: 115-123 - [c74]Herbert Edelsbrunner, Damrong Guoy:
An Experimental Study of Sliver Exudation. IMR 2001 - [c73]Ho-Lun Cheng, Tamal K. Dey, Herbert Edelsbrunner, John Sullivan:
Dynamic skin triangulation. SODA 2001: 47-56 - [c72]Herbert Edelsbrunner, Afra Zomorodian:
Computing Linking Numbers of a Filtration. WABI 2001: 112-127 - 2000
- [c71]Afra Zomorodian, Herbert Edelsbrunner:
Fast software for box intersections. SCG 2000: 129-138 - [c70]Herbert Edelsbrunner, David Letscher, Afra Zomorodian:
Topological Persistence and Simplification. FOCS 2000: 454-463 - [c69]Herbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua Teng, Alper Üngör, Noel Walkington:
Smoothing and cleaning up slivers. STOC 2000: 273-277 - 1999
- [c68]Siu-Wing Cheng, Tamal K. Dey, Herbert Edelsbrunner, Michael A. Facello, Shang-Hua Teng:
Sliver Exudation. SCG 1999: 1-13 - [c67]Herbert Edelsbrunner, Daniel R. Grayson:
Edgewise Subdivision of a Simplex. SCG 1999: 24-30 - [c66]Xiangmin Jiao, Herbert Edelsbrunner, Michael T. Heath:
Mesh Association: Formulation and Algorithms. IMR 1999: 75-82 - 1998
- [c65]Herbert Edelsbrunner, Michael A. Facello, Ping Fu, Jiang Qian, Dmitry V. Nekhayev:
Wrapping 3D Scanning Data. Three-Dimensional Image Capture and Applications 1998: 148-158 - [c64]Siu-Wing Cheng, Herbert Edelsbrunner, Ping Fu, Ka-Po Lam:
Design and Analysis of Planar Shape Deformation. SCG 1998: 29-38 - [c63]Herbert Edelsbrunner:
Shape Reconstruction with Delaunay Complex. LATIN 1998: 119-132 - [c62]Ho-Lun Cheng, Herbert Edelsbrunner, Ping Fu:
Shape Space from Deformation. PG 1998: 104- - 1997
- [c61]Ulrike Axen, Herbert Edelsbrunner:
Auditory Morse Analysis of Triangulated Manifolds. VisMath 1997: 223-236 - 1996
- [c60]Herbert Edelsbrunner, Ping Fu, Jiang Qian:
Geometric modeling in CAVE. VRST 1996: 35-41 - 1995
- [c59]Herbert Edelsbrunner, Roman Waupotitsch:
A Combinatorial Approach to Cartograms. SCG 1995: 98-108 - [c58]Herbert Edelsbrunner:
Algebraic Decompositions of Non-Convex Polyhedra. FOCS 1995: 248-257 - [c57]Herbert Edelsbrunner:
Smooth Surfaces for Multi-Scale Shape Representation. FSTTCS 1995: 391-412 - [c56]Herbert Edelsbrunner, Michael A. Facello, Ping Fu, Jie Liang:
Measuring proteins and voids in proteins. HICSS (5) 1995: 256-264 - 1994
- [c55]Herbert Edelsbrunner:
Modeling with Simplicial Complexes. CCCG 1994: 36-44 - [c54]Herbert Edelsbrunner, Pavel Valtr, Emo Welzl:
Cutting Dense Point Sets in Half. SCG 1994: 203-209 - [c53]Herbert Edelsbrunner, Nimish R. Shah:
Triangulating Topological Spaces. SCG 1994: 285-292 - 1993
- [c52]Herbert Edelsbrunner:
The Union of Balls and Its Dual Shape. SCG 1993: 218-231 - [c51]Cecil Jose A. Delfinado, Herbert Edelsbrunner:
An Incremental Algorithm for Betti Numbers of Simplicial Complexes. SCG 1993: 232-239 - [c50]Tamal K. Dey, Herbert Edelsbrunner:
Counting Triangle Crossings and Halving Planes. SCG 1993: 270-273 - [c49]Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl:
Improved bounds on weak epsilon-nets for convex sets. STOC 1993: 495-504 - 1992
- [c48]Herbert Edelsbrunner, Nimish R. Shah:
Incremental Topological Flipping Works for Regular Triangulations. SCG 1992: 43-52 - [c47]Herbert Edelsbrunner, Tiow Seng Tan:
An Upper Bound for Conforming Delaunay Triangulations. SCG 1992: 53-62 - [c46]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
Diameter, Width, Closest Line Pair, and Parametric Searching. SCG 1992: 120-129 - [c45]Marshall W. Bern, Herbert Edelsbrunner, David Eppstein, Scott A. Mitchell, Tiow Seng Tan:
Edge Insertion for Optional Triangulations. LATIN 1992: 46-60 - [c44]Herbert Edelsbrunner, Ernst P. Mücke:
Three-Dimensional Alpha Shapes. VVS 1992: 75-82 - 1991
- [c43]Herbert Edelsbrunner, Raimund Seidel, Micha Sharir:
On the Zone Theorem for Hyperplane Arrangements. New Results and New Trends in Computer Science 1991: 108-123 - [c42]Herbert Edelsbrunner, Tiow Seng Tan:
A Quadratic Time Algorithm for The MinMax Length Triangulation (Extended Abstract). FOCS 1991: 414-423 - [c41]Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink:
Ray Shooting in Polygons Using Geodesic Triangulations. ICALP 1991: 661-646 - [c40]Herbert Edelsbrunner:
Optimal Triangulations by Retriangulating. ISA 1991: 150 - [c39]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink:
Computing a Face in an Arrangement of Line Segments. SODA 1991: 441-448 - 1990
- [c38]Herbert Edelsbrunner, Tiow Seng Tan, Roman Waupotitsch:
An O(n2log n) Time Algorithm for the MinMax Angle Triangulation. SCG 1990: 44-52 - [c37]Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Rephael Wenger:
Points and Triangles in the Plane and Halving Planes in Space. SCG 1990: 112-115 - [c36]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir:
Slimming Down by Adding: Selecting Heavily Covered Points. SCG 1990: 116-127 - [c35]Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf, Emo Welzl:
Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. SCG 1990: 203-210 - [c34]Herbert Edelsbrunner:
Lines in Space-A Collection of Results. Discrete and Computational Geometry 1990: 77-94 - [c33]Herbert Edelsbrunner, Micha Sharir:
A Hyperplane Incidence Problem with Applications to Counting Distances. Applied Geometry And Discrete Mathematics 1990: 253-264 - [c32]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink:
Counting and Cutting Cycles of Lines and Rods in Space. FOCS 1990: 242-251 - [c31]Herbert Edelsbrunner, Micha Sharir:
A Hyperplane Incidence Problem with Applications to Counting Distances. SIGAL International Symposium on Algorithms 1990: 419-428 - 1989
- [c30]Herbert Edelsbrunner:
An Acyclicity Theorem for Cell Complexes in d Dimensions. SCG 1989: 145-151 - [c29]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
A Singly-Expenential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications. ICALP 1989: 179-193 - [c28]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
Lines in Space-Combinatorics, Algorithms and Applications. STOC 1989: 382-393 - [c27]Herbert Edelsbrunner:
Combinatorial and Computational Results for Line Arrangements in Space. WADS 1989: 591 - 1988
- [c26]Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
The Complexity of Many Faces in Arrangements of Lines and of Segments. SCG 1988: 44-55 - [c25]Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl:
Implicitly Representing Arrangements of Lines or Segments. SCG 1988: 56-69 - [c24]Herbert Edelsbrunner, Ernst P. Mücke:
Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms. SCG 1988: 118-133 - [c23]David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars:
Searching for Empty Convex Polygons. SCG 1988: 224-228 - [c22]Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink:
On Arrangements of Jordan Arcs with Three Intersections per Pair. SCG 1988: 258-265 - [c21]Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl:
Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces. FOCS 1988: 568-579 - [c20]Bernard Chazelle, Herbert Edelsbrunner:
An Optimal Algorithm for Intersecting Line Segments in the Plane. FOCS 1988: 590-600 - [c19]Herbert Edelsbrunner:
Geometric Structures in Computational Geometry. ICALP 1988: 201-213 - [c18]Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir:
Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms. ICALP 1988: 214-229 - [c17]Herbert Edelsbrunner, Franco P. Preparata:
Tetrahedrizing Point Sets in Three Dimensions. ISSAC 1988: 315-331 - 1987
- [c16]Herbert Edelsbrunner, János Pach, Jacob T. Schwartz, Micha Sharir:
On the Lower Envelope of Bivariate Functions and its Applications. FOCS 1987: 27-37 - [c15]Herbert Edelsbrunner, Günter Rote, Emo Welzl:
Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane. ICALP 1987: 364-375 - [c14]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas:
The Complexity of Cutting Convex Polytopes. STOC 1987: 66-76 - 1986
- [c13]Bernard Chazelle, Herbert Edelsbrunner:
Linear Data Structures for Two Types of Range Search. SCG 1986: 293-302 - [c12]Herbert Edelsbrunner, Leonidas J. Guibas:
Topologically Sweeping an Arrangement. STOC 1986: 389-403 - [c11]David P. Dobkin, Herbert Edelsbrunner, Chee-Keng Yap:
Probing Convex Polytopes. STOC 1986: 424-432 - 1985
- [c10]Bernard Chazelle, Herbert Edelsbrunner:
An improved algorithm for constructing kth-order Voronoi diagrams. SCG 1985: 228-234 - [c9]Herbert Edelsbrunner, Raimund Seidel:
Voronoi diagrams and arrangements. SCG 1985: 251-262 - [c8]Bernard Chazelle, Herbert Edelsbrunner:
Optimal Solutions for a Class of Point Retrieval Problems. ICALP 1985: 80-89 - 1984
- [c7]David P. Dobkin, Herbert Edelsbrunner:
Space Searching for Intersecting Objects. FOCS 1984: 387-392 - [c6]Herbert Edelsbrunner, Emo Welzl:
Monotone Edge Sequences in Line Arrangements and Applications (Extended Abstract). MFCS 1984: 265-272 - [c5]Herbert Edelsbrunner:
Key-Problems and Key-Methods in Computational Geormetry. STACS 1984: 1-13 - 1983
- [c4]Herbert Edelsbrunner, Joseph O'Rourke, Raimund Seidel:
Constructing Arrangements of Lines and Hyperplanes with Applications. FOCS 1983: 83-91 - [c3]Herbert Edelsbrunner, Emo Welzl:
On the Number of Equal-Sized Semisapces of a Set of Points in the Plane (Extended Abstract). ICALP 1983: 182-187 - [c2]Herbert Edelsbrunner:
Finding Extreme Distances between Convex Polygons. WG 1983: 61-75 - 1981
- [c1]Herbert Edelsbrunner, David G. Kirkpatrick, Raimund Seidel:
The Shape of a Set of Points in the Plane. WG 1981: 157-162
Parts in Books or Collections
- 2011
- [p6]Herbert Edelsbrunner, Dmitriy Morozov, Amit K. Patel:
The Stability of the Apparent Contour of an Orientable 2-Manifold. Topological Methods in Data Analysis and Visualization 2011: 27-41 - 2009
- [p5]Dominique Attali, Jean-Daniel Boissonnat, Herbert Edelsbrunner:
Stability and Computation of Medial Axes - a State-of-the-Art Report. Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration 2009: 109-125 - 2008
- [p4]Silvia Biasotti, Dominique Attali, Jean-Daniel Boissonnat, Herbert Edelsbrunner, Gershon Elber, Michela Mortara, Gabriella Sanniti di Baja, Michela Spagnuolo, Mirela Tanase, Remco C. Veltkamp:
Skeletal Structures. Shape Analysis and Structuring 2008: 145-183 - 1993
- [p3]Herbert Edelsbrunner:
Computational Geometry. Current Trends in Theoretical Computer Science 1993: 1-2 - [p2]Herbert Edelsbrunner:
Computational Geometry. Current Trends in Theoretical Computer Science 1993: 3-48 - 1990
- [p1]David P. Dobkin, Herbert Edelsbrunner, Chee K. Yap:
Probing Convex Polytopes. Autonomous Robot Vehicles 1990: 328-341
Editorship
- 1988
- [e1]Herbert Edelsbrunner:
Proceedings of the Fourth Annual Symposium on Computational Geometry, Urbana-Champaign, IL, USA, June 6-8, 1988. ACM 1988, ISBN 0-89791-270-5 [contents]
Reference Works
- 2004
- [r1]Herbert Edelsbrunner:
Biological applications of computational topology. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 1395-1412
Informal and Other Publications
- 2024
- [i28]Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, Morteza Saghafian:
The Euclidean MST-ratio for Bi-colored Lattices. CoRR abs/2403.10204 (2024) - 2023
- [i27]Herbert Edelsbrunner, Alexey Garber, Morteza Saghafian:
Order-2 Delaunay Triangulations Optimize Angles. CoRR abs/2310.18238 (2023) - [i26]Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Monika Henzinger, Lara Ost:
Dynamically Maintaining the Persistent Homology of Time Series. CoRR abs/2311.01115 (2023) - [i25]Herbert Edelsbrunner, Marian Mrozek:
The Depth Poset of a Filtered Lefschetz Complex. CoRR abs/2311.14364 (2023) - 2022
- [i24]Herbert Edelsbrunner, Alexey Garber, Mohadese Ghafari, Teresa Heiss, Morteza Saghafian:
On Angles in Higher Order Brillouin Tessellations and Related Tilings in the Plane. CoRR abs/2204.01076 (2022) - [i23]Herbert Edelsbrunner, Alexey Garber, Mohadese Ghafari, Teresa Heiss, Morteza Saghafian, Mathijs Wintraecken:
Brillouin Zones of Integer Lattices and Their Perturbations. CoRR abs/2204.01077 (2022) - [i22]Ranita Biswas, Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, Morteza Saghafian:
On the Size of Chromatic Delaunay Mosaics. CoRR abs/2212.03121 (2022) - [i21]Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, Morteza Saghafian:
Persistent Homology of Chromatic Alpha Complexes. CoRR abs/2212.03128 (2022) - 2021
- [i20]Herbert Edelsbrunner, Katharina Ölsböck:
Tri-Partitions and Bases of an Ordered Complex. CoRR abs/2103.10830 (2021) - [i19]Herbert Edelsbrunner, Teresa Heiss, Vitaliy Kurlin, Philip Smith, Mathijs Wintraecken:
The Density Fingerprint of a Periodic Point Set. CoRR abs/2104.11046 (2021) - 2020
- [i18]Herbert Edelsbrunner, Georg Osang:
A Simple Algorithm for Higher-order Delaunay Mosaics and Alpha Shapes. CoRR abs/2011.03617 (2020) - 2019
- [i17]Herbert Edelsbrunner, Ziga Virk, Hubert Wagner:
Topological Data Analysis in Information Space. CoRR abs/1903.08510 (2019) - [i16]Arseniy V. Akopyan, Herbert Edelsbrunner:
The Weighted Gaussian Curvature Derivative of a Space-Filling Diagram. CoRR abs/1908.06777 (2019) - [i15]Arseniy V. Akopyan, Herbert Edelsbrunner:
The Weighted Mean Curvature Derivative of a Space-Filling Diagram. CoRR abs/1908.06779 (2019) - 2017
- [i14]Ulrich Bauer, Herbert Edelsbrunner, Grzegorz Jablonski, Marian Mrozek:
Persistence in sampled dynamical systems faster. CoRR abs/1709.04068 (2017) - 2016
- [i13]Herbert Edelsbrunner, Hubert Wagner:
Topological Data Analysis with Bregman Divergences. CoRR abs/1607.06274 (2016) - 2015
- [i12]Herbert Edelsbrunner, Mabel Iglesias Ham, Vitaliy Kurlin:
Relaxed Disk Packing. CoRR abs/1505.03402 (2015) - 2013
- [i11]Ulrich Bauer, Herbert Edelsbrunner:
The Morse theory of Čech and Delaunay filtrations. CoRR abs/1312.1231 (2013) - 2012
- [i10]Herbert Edelsbrunner, Carl-Philipp Heisenberg, Michael Kerber, Gabriel Krens:
The Medusa of Spatial Sorting: Topological Construction. CoRR abs/1207.6474 (2012) - [i9]Michael Kerber, Herbert Edelsbrunner:
The Medusa of Spatial Sorting: 3D Kinetic Alpha Complexes and Implementation. CoRR abs/1209.5434 (2012) - 2011
- [i8]Paul Bendich, Herbert Edelsbrunner, Dmitriy Morozov, Amit K. Patel:
Homology and Robustness of Level and Interlevel Sets. CoRR abs/1102.3389 (2011) - [i7]Herbert Edelsbrunner, Michael Kerber:
Alexander Duality for Functions: the Persistent Behavior of Land and Water and Shore. CoRR abs/1109.5052 (2011) - 2010
- [i6]Krishnendu Chatterjee, Laurent Doyen, Herbert Edelsbrunner, Thomas A. Henzinger, Philippe Rannou:
Mean-payoff Automaton Expressions. CoRR abs/1006.1492 (2010) - 2009
- [i5]Herbert Edelsbrunner, Dmitriy Morozov, Amit K. Patel:
Quantifying Transversality by Measuring the Robustness of Intersections. CoRR abs/0911.2142 (2009) - 2003
- [i4]Herbert Edelsbrunner, Alper Üngör:
Relaxed Scheduling in Dynamic Skin Triangulation. CoRR cs.CG/0302031 (2003) - 1999
- [i3]Marshall W. Bern, David Eppstein, Pankaj K. Agarwal, Nina Amenta, L. Paul Chew, Tamal K. Dey, David P. Dobkin, Herbert Edelsbrunner, Cindy Grimm, Leonidas J. Guibas, John Harer, Joel Hass, Andrew Hicks, Carroll K. Johnson, Gilad Lerman, David Letscher, Paul E. Plassmann, Eric Sedgwick, Jack Snoeyink, Jeff Weeks, Chee-Keng Yap, Denis Zorin:
Emerging Challenges in Computational Topology. CoRR cs.CG/9909001 (1999) - 1994
- [i2]Herbert Edelsbrunner, Ernst P. Mücke:
Three-dimensional alpha shapes. CoRR abs/math/9410208 (1994) - [i1]Herbert Edelsbrunner, Ernst P. Mücke:
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. CoRR abs/math/9410209 (1994)
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
