Herbert Edelsbrunner

According to our database, Herbert Edelsbrunner authored at least 254 papers between 1981 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

Geometric characterization of the persistence of 1D maps.

Ranita Biswas, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Morteza Saghafian

J. Appl. Comput. Topol., October, 2024

Depth in arrangements: Dehn-Sommerville-Euler relations with applications.

Ranita Biswas, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Morteza Saghafian

J. Appl. Comput. Topol., September, 2024

Understanding Higher-Order Interactions in Information Space.

Herbert Edelsbrunner, Katharina Ölsböck, Hubert Wagner

Entropy, August, 2024

On Angles in Higher Order Brillouin Tessellations and Related Tilings in the Plane.

Herbert Edelsbrunner, Alexey Garber, Mohadese Ghafari, Teresa Heiss, Morteza Saghafian

Discret. Comput. Geom., July, 2024

Brillouin Zones of Integer Lattices and Their Perturbations.

Herbert Edelsbrunner, Alexey Garber, Mohadese Ghafari, Teresa Heiss, Morteza Saghafian, Mathijs Wintraecken

SIAM J. Discret. Math., 2024

Merge Trees of Periodic Filtrations.

Herbert Edelsbrunner, Teresa Heiss

CoRR, 2024

Chromatic Topological Data Analysis.

Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, Morteza Saghafian

CoRR, 2024

Banana Trees for the Persistence in Time Series Experimentally.

Lara Ost, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner

CoRR, 2024

Dynamically Maintaining the Persistent Homology of Time Series.

Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Monika Henzinger, Lara Ost

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

The Euclidean MST-Ratio for Bi-Colored Lattices.

Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, Morteza Saghafian

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

Maximum Betti Numbers of Čech Complexes.

Herbert Edelsbrunner, János Pach

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Computing the Volume, Surface Area, Mean, and Gaussian Curvatures of Molecules and Their Derivatives.

Patrice Koehl, Arseniy V. Akopyan, Herbert Edelsbrunner

J. Chem. Inf. Model., February, 2023

The Depth Poset of a Filtered Lefschetz Complex.

Herbert Edelsbrunner, Marian Mrozek

CoRR, 2023

Order-2 Delaunay Triangulations Optimize Angles.

Herbert Edelsbrunner, Alexey Garber, Morteza Saghafian

CoRR, 2023

A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes.

Herbert Edelsbrunner, Georg Osang

Algorithmica, 2023

2022

Continuous and Discrete Radius Functions on Voronoi Tessellations and Delaunay Mosaics.

Ranita Biswas, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Morteza Saghafian

Discret. Comput. Geom., 2022

Persistent Homology of Chromatic Alpha Complexes.

Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, Morteza Saghafian

CoRR, 2022

On the Size of Chromatic Delaunay Mosaics.

Ranita Biswas, Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, Morteza Saghafian

CoRR, 2022

2021

The Multi-Cover Persistence of Euclidean Balls.

Herbert Edelsbrunner, Georg Osang

Discret. Comput. Geom., 2021

The Density Fingerprint of a Periodic Point Set.

Herbert Edelsbrunner, Teresa Heiss, Vitaliy Kurlin, Philip Smith, Mathijs Wintraecken

Proceedings of the 37th International Symposium on Computational Geometry, 2021

Counting Cells of Order-k Voronoi Tessellations in ℝ³ with Morse Theory.

Ranita Biswas, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Morteza Saghafian

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

Topological data analysis in information space.

Herbert Edelsbrunner, Ziga Virk, Hubert Wagner

J. Comput. Geom., 2020

Čech-Delaunay gradient flow and homology inference for self-maps.

Ulrich Bauer, Herbert Edelsbrunner, Grzegorz Jablonski, Marian Mrozek

J. Appl. Comput. Topol., 2020

Tri-partitions and Bases of an Ordered Complex.

Herbert Edelsbrunner, Katharina Ölsböck

Discret. Comput. Geom., 2020

2019

Poisson-Delaunay Mosaics of Order k.

Herbert Edelsbrunner, Anton V. Nikitenko

Discret. Comput. Geom., 2019

The Weighted Mean Curvature Derivative of a Space-Filling Diagram.

Arseniy V. Akopyan, Herbert Edelsbrunner

CoRR, 2019

The Weighted Gaussian Curvature Derivative of a Space-Filling Diagram.

Arseniy V. Akopyan, Herbert Edelsbrunner

CoRR, 2019

Holes and dependences in an ordered complex.

Herbert Edelsbrunner, Katharina Ölsböck

Comput. Aided Geom. Des., 2019

2018

On the Optimality of the FCC Lattice for Soft Sphere Packing.

Herbert Edelsbrunner, Mabel Iglesias Ham

SIAM J. Discret. Math., 2018

Topological data analysis with Bregman divergences.

Herbert Edelsbrunner, Hubert Wagner

J. Comput. Geom., 2018

Multiple covers with balls I: Inclusion-exclusion.

Herbert Edelsbrunner, Mabel Iglesias Ham

Comput. Geom., 2018

Smallest Enclosing Spheres and Chernoff Points in BregmanGeometry.

Herbert Edelsbrunner, Ziga Virk, Hubert Wagner

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

Persistence in sampled dynamical systems faster.

Ulrich Bauer, Herbert Edelsbrunner, Grzegorz Jablonski, Marian Mrozek

CoRR, 2017

The Voronoi functional is maximized by the Delaunay triangulation in the plane.

Herbert Edelsbrunner, Alexey A. Glazyrin, Oleg R. Musin, Anton V. Nikitenko

Comb., 2017

2016

The classification of endoscopy images with persistent homology.

Olga D. Dunaeva, Herbert Edelsbrunner, Anton Lukyanov, Michael Machin, Daria Malkova, Roman Kuvaev, Sergey Kashin

Pattern Recognit. Lett., 2016

Multiple Covers with Balls II: Weighted Averages.

Herbert Edelsbrunner, Mabel Iglesias Ham

Electron. Notes Discret. Math., 2016

2015

The Persistent Homology of a Self-Map.

Herbert Edelsbrunner, Grzegorz Jablonski, Marian Mrozek

Found. Comput. Math., 2015

Triangulations from topologically correct digital Voronoi diagrams.

Thanh-Tung Cao, Herbert Edelsbrunner, Tiow Seng Tan

Comput. Geom., 2015

Relaxed Disk Packing.

Mabel Iglesias Ham, Herbert Edelsbrunner, Vitaliy Kurlin

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014

Stable Length Estimates of Tube-Like Shapes.

Herbert Edelsbrunner, Florian Pausinger

J. Math. Imaging Vis., 2014

The Classification of Endoscopy Images with Persistent Homology.

Olga D. Dunaeva, Herbert Edelsbrunner, Anton Lukyanov, Michael Machin, Daria Malkova

Proceedings of the 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2014

On the Computational Complexity of Betti Numbers: Reductions from Matrix Rank.

Herbert Edelsbrunner, Salman Parsa

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

The Geometry and Topology of Data Analysis.

Herbert Edelsbrunner

Proceedings of the DATA 2014, 2014

The Morse Theory of Čech and Delaunay Filtrations.

Ulrich Bauer, Herbert Edelsbrunner

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013

Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.

Herbert Edelsbrunner, Brittany Terese Fasy, Günter Rote

Discret. Comput. Geom., 2013

Persistent Homology in Image Processing.

Herbert Edelsbrunner

Proceedings of the Graph-Based Representations in Pattern Recognition, 2013

3D kinetic alpha complexes and their implementation.

Michael Kerber, Herbert Edelsbrunner

Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, 2013

2012

A point calculus for interlevel set homology.

Paul Bendich, Sergio Cabello, Herbert Edelsbrunner

Pattern Recognit. Lett., 2012

Dual Complexes of Cubical Subdivisions of ℝ n.

Herbert Edelsbrunner, Michael Kerber

Discret. Comput. Geom., 2012

The Medusa of Spatial Sorting: 3D Kinetic Alpha Complexes and Implementation

Michael Kerber, Herbert Edelsbrunner

CoRR, 2012

The Medusa of Spatial Sorting: Topological Construction

Herbert Edelsbrunner, Carl-Philipp Heisenberg, Michael Kerber, Gabriel Krens

CoRR, 2012

The Adaptive Topology of a Digital Image.

Herbert Edelsbrunner, Olga Symonova

Proceedings of the Ninth International Symposium on Voronoi Diagrams in Science and Engineering, 2012

Alexander duality for functions: the persistent behavior of land and water and shore.

Herbert Edelsbrunner, Michael Kerber

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2011

Alpha, Betti and the Megaparsec Universe: On the Topology of the Cosmic Web.

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

Trans. Comput. Sci., 2011

Computing elevation maxima by searching the gauss sphere.

Bei Wang, Herbert Edelsbrunner, Dmitriy Morozov

ACM J. Exp. Algorithmics, 2011

Quantifying Transversality by Measuring the Robustness of Intersections.

Herbert Edelsbrunner, Dmitriy Morozov, Amit K. Patel

Found. Comput. Math., 2011

Letter from the New Editors-in-Chief.

Herbert Edelsbrunner, János Pach, Günter M. Ziegler

Discret. Comput. Geom., 2011

Homology and Robustness of Level and Interlevel Sets

Paul Bendich, Herbert Edelsbrunner, Dmitriy Morozov, Amit K. Patel

CoRR, 2011

Detailed reconstruction of 3D plant root shape.

Ying Zheng, Steve Gu, Herbert Edelsbrunner, Carlo Tomasi, Philip Benfey

Proceedings of the IEEE International Conference on Computer Vision, 2011

Diffusion runs low on persistence fast.

Chao Chen, Herbert Edelsbrunner

Proceedings of the IEEE International Conference on Computer Vision, 2011

Covering and Packing with Spheres by Diagonal Distortion in ℝ^<i>n</i>.

Herbert Edelsbrunner, Michael Kerber

Proceedings of the Rainbow of Computer Science, 2011

The Stability of the Apparent Contour of an Orientable 2-Manifold.

Herbert Edelsbrunner, Dmitriy Morozov, Amit K. Patel

Proceedings of the Topological Methods in Data Analysis and Visualization, 2011

2010

Computing Robustness and Persistence for Images.

Paul Bendich, Herbert Edelsbrunner, Michael Kerber

IEEE Trans. Vis. Comput. Graph., 2010

Lipschitz Functions Have <i>L</i>_<i>p</i>-Stable Persistence.

David Cohen-Steiner, Herbert Edelsbrunner, John Harer, Yuriy Mileyko

Found. Comput. Math., 2010

Persistent Homology under Non-uniform Error.

Paul Bendich, Herbert Edelsbrunner, Michael Kerber, Amit K. Patel

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

The Robustness of Level Sets.

Paul Bendich, Herbert Edelsbrunner, Dmitriy Morozov, Amit K. Patel

Proceedings of the Algorithms, 2010

Mean-Payoff Automaton Expressions.

Krishnendu Chatterjee, Laurent Doyen, Herbert Edelsbrunner, Thomas A. Henzinger, Philippe Rannou

Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

Computational Topology - an Introduction.

Herbert Edelsbrunner, John Harer

American Mathematical Society, ISBN: 978-0-8218-4925-5, 2010

2009

Extending Persistence Using Poincaré and Lefschetz Duality.

David Cohen-Steiner, Herbert Edelsbrunner, John Harer

Found. Comput. Math., 2009

Persistent homology for kernels, images, and cokernels.

David Cohen-Steiner, Herbert Edelsbrunner, John Harer, Dmitriy Morozov

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

The Persistent Morse Complex Segmentation of a 3-Manifold.

Herbert Edelsbrunner, John Harer

Proceedings of the Modelling the Physiological Human, 3D Physiological Human Workshop, 2009

Stability and Computation of Medial Axes - a State-of-the-Art Report.

Dominique Attali, Jean-Daniel Boissonnat, Herbert Edelsbrunner

Proceedings of the Mathematical Foundations of Scientific Visualization, 2009

2008

Time-varying Reeb graphs for continuous space-time data.

Herbert Edelsbrunner, John Harer, Ajith Mascarenhas, Valerio Pascucci, Jack Snoeyink

Comput. Geom., 2008

Reeb spaces of piecewise linear mappings.

Herbert Edelsbrunner, John Harer, Amit K. Patel

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

Skeletal Structures.

Silvia Biasotti, Dominique Attali, Jean-Daniel Boissonnat, Herbert Edelsbrunner, Gershon Elber, Michela Mortara, Gabriella Sanniti di Baja, Michela Spagnuolo, Mirela Tanase, Remco C. Veltkamp

Proceedings of the Shape Analysis and Structuring, 2008

2007

Inequalities for the Curvature of Curves and Surfaces.

David Cohen-Steiner, Herbert Edelsbrunner

Found. Comput. Math., 2007

Stability of Persistence Diagrams.

David Cohen-Steiner, Herbert Edelsbrunner, John Harer

Discret. Comput. Geom., 2007

Inclusion-Exclusion Formulas from Independent Complexes.

Dominique Attali, Herbert Edelsbrunner

Discret. Comput. Geom., 2007

Alpha-Beta Witness Complexes.

Dominique Attali, Herbert Edelsbrunner, John Harer, Yuriy Mileyko

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

An introduction to persistent homology.

Herbert Edelsbrunner

Proceedings of the 2007 ACM Symposium on Solid and Physical Modeling, 2007

Weak witnesses for Delaunay triangulations of submanifolds.

Dominique Attali, Herbert Edelsbrunner, Yuriy Mileyko

Proceedings of the 2007 ACM Symposium on Solid and Physical Modeling, 2007

Inferring Local Homology from Sampled Stratified Spaces.

Paul Bendich, David Cohen-Steiner, Herbert Edelsbrunner, John Harer, Dmitriy Morozov

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2006

Interface surfaces for protein-protein complexes.

Yih-En Andrew Ban, Herbert Edelsbrunner, Johannes Rudolph

J. ACM, 2006

Extreme Elevation on a 2-Manifold.

Pankaj K. Agarwal, Herbert Edelsbrunner, John Harer, Yusu Wang

Discret. Comput. Geom., 2006

Persistence-sensitive simplification functions on 2-manifolds.

Herbert Edelsbrunner, Dmitriy Morozov, Valerio Pascucci

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

Vines and vineyards by updating persistence in linear time.

David Cohen-Steiner, Herbert Edelsbrunner, Dmitriy Morozov

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005

Surface Tiling with Differential Topology.

Herbert Edelsbrunner

Proceedings of the Third Eurographics Symposium on Geometry Processing, 2005

Extraction and Simplification of Iso-surfaces in Tandem.

Dominique Attali, David Cohen-Steiner, Herbert Edelsbrunner

Proceedings of the Third Eurographics Symposium on Geometry Processing, 2005

Coarse and Reliable Geometric Alignment for Protein Docking.

Yusu Wang, Pankaj K. Agarwal, P. Brown, Herbert Edelsbrunner, Johannes Rudolph

Proceedings of the Biocomputing 2005, 2005

Session Introduction: Biogeometry: Applications of Computational Geometry to Molecular Structure.

Alexander Tropsha, Herbert Edelsbrunner

Proceedings of the Biocomputing 2005, 2005

2004

Biological applications of computational topology.

Herbert Edelsbrunner

Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Simplification of Three-Dimensional Density Maps.

Vijay Natarajan, Herbert Edelsbrunner

IEEE Trans. Vis. Comput. Graph., 2004

A Topological Hierarchy for Functions on Triangulated Surfaces.

Peer-Timo Bremer, Herbert Edelsbrunner, Bernd Hamann, Valerio Pascucci

IEEE Trans. Vis. Comput. Graph., 2004

Loops in Reeb Graphs of 2-Manifolds.

Kree Cole-McLaughlin, Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci

Discret. Comput. Geom., 2004

The Area Derivative of a Space-Filling Diagram.

Robert L. Bryant, Herbert Edelsbrunner, Patrice Koehl, Michael Levitt

Discret. Comput. Geom., 2004

Computing the Writhing Number of a Polygonal Knot.

Pankaj K. Agarwal, Herbert Edelsbrunner, Yusu Wang

Discret. Comput. Geom., 2004

Local Search Heuristic for Rigid Protein Docking.

Vicky Choi, Pankaj K. Agarwal, Herbert Edelsbrunner, Johannes Rudolph

Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

Local and Global Comparison of Continuous Functions.

Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci

Proceedings of the 15th IEEE Visualization Conference, 2004

Time-varying reeb graphs for continuous space-time data.

Herbert Edelsbrunner, John Harer, Ajith Mascarenhas, Valerio Pascucci

Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2003

Hierarchical Morse - Smale Complexes for Piecewise Linear 2-Manifolds.

Herbert Edelsbrunner, John Harer, Afra Zomorodian

Discret. Comput. Geom., 2003

Area, perimeter and derivatives of a skin curve.

Ho-Lun Cheng, Herbert Edelsbrunner

Comput. Geom., 2003

A Multi-Resolution Data Structure for 2-Dimensional Morse Functions.

Peer-Timo Bremer, Herbert Edelsbrunner, Bernd Hamann, Valerio Pascucci

Proceedings of the 14th IEEE Visualization Conference, 2003

Morse-smale complexes for piecewise linear 3-manifolds.

Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci

Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

Area and Perimeter Derivatives of a Union of Disks.

Ho-Lun Cheng, Herbert Edelsbrunner

Proceedings of the Computer Science in Perspective, Essays Dedicated to Thomas Ottmann, 2003

2002

Sink Insertion for Mesh Improvement.

Herbert Edelsbrunner, Damrong Guoy

Int. J. Found. Comput. Sci., 2002

Fast Software for Box Intersections.

Afra Zomorodian, Herbert Edelsbrunner

Int. J. Comput. Geom. Appl., 2002

An Experimental Study of Sliver Exudation.

Herbert Edelsbrunner, Damrong Guoy

Eng. Comput., 2002

Topological Persistence and Simplification.

Herbert Edelsbrunner, David Letscher, Afra Zomorodian

Discret. Comput. Geom., 2002

Algorithmic issues in modeling motion.

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

ACM Comput. Surv., 2002

Relaxed Scheduling in Dynamic Skin Triangulation.

Herbert Edelsbrunner, Alper Üngör

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

Element Quality and Tetrahedral Meshes (Invited Talk).

Herbert Edelsbrunner

Proceedings of the 11th International Meshing Roundtable, 2002

2001

180 Wrapped Tubes.

Herbert Edelsbrunner

J. Univers. Comput. Sci., 2001

Dynamic Skin Triangulation.

Ho-Lun Cheng, Tamal K. Dey, Herbert Edelsbrunner, John Sullivan

Discret. Comput. Geom., 2001

Design and analysis of planar shape deformation.

Siu-Wing Cheng, Herbert Edelsbrunner, Ping Fu, Ka-Po Lam

Comput. Geom., 2001

Shape space from deformation.

Ho-Lun Cheng, Herbert Edelsbrunner, Ping Fu

Comput. Geom., 2001

Computing Linking Numbers of a Filtration.

Herbert Edelsbrunner, Afra Zomorodian

Proceedings of the Algorithms in Bioinformatics, First International Workshop, 2001

Hierarchical morse complexes for piecewise linear 2-manifolds.

Herbert Edelsbrunner, John Harer, Afra Zomorodian

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

Geometry and Topology for Mesh Generation.

Herbert Edelsbrunner

Cambridge monographs on applied and computational mathematics 7, Cambridge University Press, ISBN: 978-0-521-68207-7, 2001

2000

Sliver exudation.

Siu-Wing Cheng, Tamal K. Dey, Herbert Edelsbrunner, Michael A. Facello, Shang-Hua Teng

J. ACM, 2000

Adaptive Simplicial Grids from Cross-Sections of Monotone Complexes.

Herbert Edelsbrunner, Roman Waupotitsch

Int. J. Comput. Geom. Appl., 2000

Edgewise Subdivision of a Simplex.

Herbert Edelsbrunner, Daniel R. Grayson

Discret. Comput. Geom., 2000

Smoothing and cleaning up slivers.

Herbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua Teng, Alper Üngör, Noel Walkington

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999

Deformable Smooth Surface Design.

Herbert Edelsbrunner

Discret. Comput. Geom., 1999

Emerging Challenges in Computational Topology

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

CoRR, 1999

Mesh Association: Formulation and Algorithms.

Xiangmin Jiao, Herbert Edelsbrunner, Michael T. Heath

Proceedings of the 8th International Meshing Roundtable, 1999

1998

On the Definition and the Construction of Pockets in Macromolecules.

Herbert Edelsbrunner, Michael A. Facello, Jie Liang

Discret. Appl. Math., 1998

Shape Reconstruction with Delaunay Complex.

Herbert Edelsbrunner

Proceedings of the LATIN '98: Theoretical Informatics, 1998

Wrapping 3D Scanning Data.

Herbert Edelsbrunner, Michael A. Facello, Ping Fu, Jiang Qian, Dmitry V. Nekhayev

Proceedings of the Conference on Three-Dimensional Image Capture and Applications, 1998

1997

Triangulating Topological Spaces.

Herbert Edelsbrunner, Nimish R. Shah

Int. J. Comput. Geom. Appl., 1997

Cutting Dense Point Sets in Half.

Herbert Edelsbrunner, Pavel Valtr, Emo Welzl

Discret. Comput. Geom., 1997

Inclusion - Exclusion Complexes for Pseudodisk Collections.

Herbert Edelsbrunner, Edgar A. Ramos

Discret. Comput. Geom., 1997

A Combinatorial Approach to Cartograms.

Herbert Edelsbrunner, Roman Waupotitsch

Comput. Geom., 1997

Auditory Morse Analysis of Triangulated Manifolds.

Ulrike Axen, Herbert Edelsbrunner

Proceedings of the Mathematical Visualization, Algorithms, Applications and Numerics, 1997

1996

Triangulating the Surface of a Molecule.

Nataraj Akkiraju, Herbert Edelsbrunner

Discret. Appl. Math., 1996

Viewing geometric protein structures from inside a CAVE.

Nataraj Akkiraju, Herbert Edelsbrunner, Ping Fu, Jiang Qian

IEEE Computer Graphics and Applications, 1996

Incremental Topological Flipping Works for Regular Triangulations.

Herbert Edelsbrunner, Nimish R. Shah

Algorithmica, 1996

Lines in Space: Combinatorics and Algorithms.

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jorge Stolfi

Algorithmica, 1996

Geometric modeling in CAVE.

Herbert Edelsbrunner, Ping Fu, Jiang Qian

Proceedings of the ACM Symposium on Virtual Reality Software and Technology, 1996

1995

The Union of Balls and Its Dual Shape.

Herbert Edelsbrunner

Discret. Comput. Geom., 1995

Improved Bounds on Weak epsilon-Nets for Convex Sets.

Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl

Discret. Comput. Geom., 1995

An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere.

Cecil Jose A. Delfinado, Herbert Edelsbrunner

Comput. Aided Geom. Des., 1995

Measuring proteins and voids in proteins.

Herbert Edelsbrunner, Michael A. Facello, Ping Fu, Jie Liang

Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 1995

Smooth Surfaces for Multi-Scale Shape Representation.

Herbert Edelsbrunner

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

Algebraic Decompositions of Non-Convex Polyhedra.

Herbert Edelsbrunner

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994

Three-dimensional alpha shapes.

Herbert Edelsbrunner, Ernst P. Mücke

ACM Trans. Graph., 1994

Selecting Heavily Covered Points.

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir

SIAM J. Comput., 1994

Counting Triangle Crossing and Halving Planes.

Tamal K. Dey, Herbert Edelsbrunner

Discret. Comput. Geom., 1994

Algorithms for Bichromatic Line-Segment Problems Polyhedral Terrains.

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir

Algorithmica, 1994

Ray Shooting in Polygons Using Geodesic Triangulations.

Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink

Algorithmica, 1994

Modeling with Simplicial Complexes.

Herbert Edelsbrunner

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993

Computational Geometry.

Herbert Edelsbrunner

Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

Computational Geometry.

Herbert Edelsbrunner

Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

A Quadratic Time Algorithm for the Minimax Length Triangulation.

Herbert Edelsbrunner, Tiow Seng Tan

SIAM J. Comput., 1993

On the Zone Theorem for Hyperplane Arrangements.

Herbert Edelsbrunner, Raimund Seidel, Micha Sharir

SIAM J. Comput., 1993

Computing a Face in an Arrangement of Line Segments and Related Problems.

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink

SIAM J. Comput., 1993

An Upper Bound for Conforming Delaunary Triangulations.

Herbert Edelsbrunner, Tiow Seng Tan

Discret. Comput. Geom., 1993

Diameter, Width, Closest Line Pair, and Parametric Searching.

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir

Discret. Comput. Geom., 1993

Edge Insertion for Optimal Triangulations.

Marshall W. Bern, Herbert Edelsbrunner, David Eppstein, Scott A. Mitchell, Tiow Seng Tan

Discret. Comput. Geom., 1993

Counting Triangle Crossings and Halving Planes.

Tamal K. Dey, Herbert Edelsbrunner

Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

An Incremental Algorithm for Betti Numbers of Simplicial Complexes.

Cecil Jose A. Delfinado, Herbert Edelsbrunner

Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

1992

Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms.

Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir

Theor. Comput. Sci., 1992

An O(n² log n) Time Algorithm for the Minmax Angle Triangulation.

Herbert Edelsbrunner, Tiow Seng Tan, Roman Waupotitsch

SIAM J. Sci. Comput., 1992

An Optimal Algorithm for Intersecting Line Segments in the Plane.

Bernard Chazelle, Herbert Edelsbrunner

J. ACM, 1992

Optimal Time Bounds for Some Proximity Problems in the Plane.

Alok Aggarwal, Herbert Edelsbrunner, Prabhakar Raghavan, Prasoon Tiwari

Inf. Process. Lett., 1992

The number of edges of many faces in a line segment arrangement.

Boris Aronov, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir

Comb., 1992

Edge Insertion for Optional Triangulations.

Marshall W. Bern, Herbert Edelsbrunner, David Eppstein, Scott A. Mitchell, Tiow Seng Tan

Proceedings of the LATIN '92, 1992

An Upper Bound for Conforming Delaunay Triangulations.

Herbert Edelsbrunner, Tiow Seng Tan

Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991

A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications.

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir

Theor. Comput. Sci., 1991

An O(n log² h) Time Algorithm for the Three-Dimensional Convex Hull Problem.

Herbert Edelsbrunner, Weiping Shi

SIAM J. Comput., 1991

A lower bound on the number of unit distances between the vertices of a convex polygon.

Herbert Edelsbrunner, Péter Hajnal

J. Comb. Theory A, 1991

Corrigendum: Topologically Sweeping an Arrangement.

Herbert Edelsbrunner, Leonidas J. Guibas

J. Comput. Syst. Sci., 1991

Points and Triangles in the Plane and Halving Planes in Space.

Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Rephael Wenger

Discret. Comput. Geom., 1991

Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.

Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf

Discret. Comput. Geom., 1991

Counting and Cutting Cycles of Lines and Rods in Space.

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink

Comput. Geom., 1991

Computing a Face in an Arrangement of Line Segments.

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Optimal Triangulations by Retriangulating.

Herbert Edelsbrunner

Proceedings of the ISA '91 Algorithms, 1991

A Quadratic Time Algorithm for The MinMax Length Triangulation (Extended Abstract)

Herbert Edelsbrunner, Tiow Seng Tan

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms.

Herbert Edelsbrunner, Ernst P. Mücke

ACM Trans. Graph., 1990

Tetrahedrizing Point Sets in Three Dimensions.

Herbert Edelsbrunner, Franco P. Preparata, Douglas B. West

J. Symb. Comput., 1990

Ranking intervals under visibility constraints.

Herbert Edelsbrunner, Mark H. Overmars, Emo Welzl, Irith Ben-Arroyo Hartman, Jack A. Feldman

Int. J. Comput. Math., 1990

Covering convex sets with non-overlapping polygons.

Herbert Edelsbrunner, Arch Douglas Robison, Xiaojun Shen

Discret. Math., 1990

The Maximum Number of Ways To Stab n Convex Nonintersecting Sets in the Plane Is 2n-2.

Herbert Edelsbrunner, Micha Sharir

Discret. Comput. Geom., 1990

The Complexity of Many Cells in Arrangements of Planes and Related Problems.

Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir

Discret. Comput. Geom., 1990

The Complexity and Construction of Many Faces in Arrangement of Lines and of Segments.

Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir

Discret. Comput. Geom., 1990

Combinatorial Complexity Bounds for Arrangement of Curves and Spheres.

Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl

Discret. Comput. Geom., 1990

An acyclicity theorem for cell complexes in d dimension.

Herbert Edelsbrunner

Comb., 1990

Searching for Empty Convex Polygons.

David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars

Algorithmica, 1990

A Hyperplane Incidence Problem with Applications to Counting Distances.

Herbert Edelsbrunner, Micha Sharir

Proceedings of the Algorithms, 1990

Lines in Space-A Collection of Results.

Herbert Edelsbrunner

Proceedings of the Discrete and Computational Geometry: Papers from the DIMACS Special Year, 1990

Slimming Down by Adding: Selecting Heavily Covered Points.

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.

Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf, Emo Welzl

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

Probing Convex Polytopes.

David P. Dobkin, Herbert Edelsbrunner, Chee K. Yap

Proceedings of the Autonomous Robot Vehicles, 1990

1989

Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.

Herbert Edelsbrunner, Günter Rote, Emo Welzl

Theor. Comput. Sci., 1989

Partitioning Space for Range Queries.

F. Frances Yao, David P. Dobkin, Herbert Edelsbrunner, Mike Paterson

SIAM J. Comput., 1989

Topologically Sweeping an Arrangement.

Herbert Edelsbrunner, Leonidas J. Guibas

J. Comput. Syst. Sci., 1989

The Computation Geometry Column.

Herbert Edelsbrunner

Bull. EATCS, 1989

The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.

Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir

Discret. Comput. Geom., 1989

Implicitly Representing Arrangements of Lines or Segments.

Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl

Discret. Comput. Geom., 1989

On Arrangement of Jordan Arcs with Three Intersection per Pair.

Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink

Discret. Comput. Geom., 1989

The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces.

Herbert Edelsbrunner

Discret. Comput. Geom., 1989

The Complexity of Cutting Complexes.

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas

Discret. Comput. Geom., 1989

Combinatorial and Computational Results for Line Arrangements in Space.

Herbert Edelsbrunner

Proceedings of the Algorithms and Data Structures, 1989

Lines in Space-Combinatorics, Algorithms and Applications

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

A Singly-Expenential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications.

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir

Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

An Acyclicity Theorem for Cell Complexes in <i>d</i> Dimensions.

Herbert Edelsbrunner

Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988

Minimum Polygonal Separation

Herbert Edelsbrunner, Franco P. Preparata

Inf. Comput., June, 1988

Probing Convex Polygons with X-Rays.

Herbert Edelsbrunner, Steven Skiena

SIAM J. Comput., 1988

The computational Geometry Column.

Herbert Edelsbrunner

Bull. EATCS, 1988

Tetrahedrizing Point Sets in Three Dimensions.

Herbert Edelsbrunner, Franco P. Preparata

Proceedings of the Symbolic and Algebraic Computation, 1988

Geometric Structures in Computational Geometry.

Herbert Edelsbrunner

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces

Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

The Complexity of Many Faces in Arrangements of Lines and of Segments.

Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

On Arrangements of Jordan Arcs with Three Intersections per Pair.

Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987

Algorithms in Combinatorial Geometry

Herbert Edelsbrunner

EATCS Monographs on Theoretical Computer Science 10, Springer, ISBN: 038713722X, 1987

An Improved Algorithm for Constructing <i>k</i> th-Order Voronoi Diagrams.

Bernard Chazelle, Herbert Edelsbrunner

IEEE Trans. Computers, 1987

Space Searching for Intersecting Objects.

David P. Dobkin, Herbert Edelsbrunner

J. Algorithms, 1987

A Tight Lower Bound on the Size of Visibility Graphs.

Xiaojun Shen, Herbert Edelsbrunner

Inf. Process. Lett., 1987

Zooming by Repeated Range Detection.

Herbert Edelsbrunner, Mark H. Overmars

Inf. Process. Lett., 1987

Linear Space Data Structures for Two Types of Range Search.

Bernard Chazelle, Herbert Edelsbrunner

Discret. Comput. Geom., 1987

The Complexity of Cutting Convex Polytopes

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

On the Lower Envelope of Bivariate Functions and its Applications

Herbert Edelsbrunner, János Pach, Jacob T. Schwartz, Micha Sharir

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986

Constructing Belts in Two-Dimensional Arrangements with Applications.

Herbert Edelsbrunner, Emo Welzl

SIAM J. Comput., 1986

Constructing Arrangements of Lines and Hyperplanes with Applications.

Herbert Edelsbrunner, Joseph O'Rourke, Raimund Seidel

SIAM J. Comput., 1986

Optimal Point Location in a Monotone Subdivision.

Herbert Edelsbrunner, Leonidas J. Guibas, Jorge Stolfi

SIAM J. Comput., 1986

Computing a Ham-Sandwich Cut in Two Dimensions.

Herbert Edelsbrunner, Roman Waupotitsch

J. Symb. Comput., 1986

On the maximal number of edges of many faces in an arrangement.

Herbert Edelsbrunner, Emo Welzl

J. Comb. Theory A, 1986

The number of extreme pairs of finite point-sets in Euclidean spaces.

Herbert Edelsbrunner, Gerd Stöckl

J. Comb. Theory A, 1986

Halfplanar Range Search in Linear Space and O(n^(0.695)) Query Time.

Herbert Edelsbrunner, Emo Welzl

Inf. Process. Lett., 1986

The complexity of cells in three-dimensional arrangements.

Herbert Edelsbrunner, David Haussler

Discret. Math., 1986

Voronoi Diagrams and Arrangements.

Herbert Edelsbrunner, Raimund Seidel

Discret. Comput. Geom., 1986

Rectangular Point Location in d Dimensions with Applications.

Herbert Edelsbrunner, G. Haring, D. Hilbert

Comput. J., 1986

Edge-Skeletons in Arrangements with Applications.

Herbert Edelsbrunner

Algorithmica, 1986

Probing Convex Polytopes

David P. Dobkin, Herbert Edelsbrunner, Chee-Keng Yap

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

Linear Data Structures for Two Types of Range Search.

Bernard Chazelle, Herbert Edelsbrunner

Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985

Finding Transversals for Sets of Simple Geometric Figures.

Herbert Edelsbrunner

Theor. Comput. Sci., 1985

Optimal Solutions for a Class of Point Retrieval Problems.

Bernard Chazelle, Herbert Edelsbrunner

J. Symb. Comput., 1985

On the Number of Line Separations of a Finite Set in the Plane.

Herbert Edelsbrunner, Emo Welzl

J. Comb. Theory A, 1985

Batched Dynamic Solutions to Decomposable Searching Problems.

Herbert Edelsbrunner, Mark H. Overmars

J. Algorithms, 1985

Computing the Extreme Distances Between Two Convex Polygons.

Herbert Edelsbrunner

J. Algorithms, 1985

Finding Extreme Points in Three Dimensions and Solving the Post-Office Problem in the Plane.

Herbert Edelsbrunner, Hermann A. Maurer

Inf. Process. Lett., 1985

An improved algorithm for constructing kth-order Voronoi diagrams.

Bernard Chazelle, Herbert Edelsbrunner

Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984

An optimal algorithm for constructing the weighted voronoi diagram in the plane.

Franz Aurenhammer, Herbert Edelsbrunner

Pattern Recognit., 1984

Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space.

Herbert Edelsbrunner, Jan van Leeuwen, Thomas Ottmann, Derick Wood

RAIRO Theor. Informatics Appl., 1984

Some methods of computational geometry applied to computer graphics.

Herbert Edelsbrunner, Mark H. Overmars, Raimund Seidel

Comput. Vis. Graph. Image Process., 1984

Key-Problems and Key-Methods in Computational Geormetry.

Herbert Edelsbrunner

Proceedings of the STACS 84, 1984

Monotone Edge Sequences in Line Arrangements and Applications (Extended Abstract).

Herbert Edelsbrunner, Emo Welzl

Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

1983

On the shape of a set of points in the plane.

Herbert Edelsbrunner, David G. Kirkpatrick, Raimund Seidel

IEEE Trans. Inf. Theory, 1983

Finding Extreme Distances between Convex Polygons.

Herbert Edelsbrunner

Proceedings of the WG '83, 1983

On the Number of Equal-Sized Semisapces of a Set of Points in the Plane (Extended Abstract).

Herbert Edelsbrunner, Emo Welzl

Proceedings of the Automata, 1983

1982

On the Equivalence of Some Rectangle Problems.

Herbert Edelsbrunner, Mark H. Overmars

Inf. Process. Lett., 1982

Polygonal Intersection Searching.

Herbert Edelsbrunner, Hermann A. Maurer, David G. Kirkpatrick

Inf. Process. Lett., 1982

Stabbing Line Segments.

Herbert Edelsbrunner, Hermann A. Maurer, Franco P. Preparata, Arnold L. Rosenberg, Emo Welzl, Derick Wood

BIT, 1982

1981

A Space-Optimal Solution of General Region Location.

Herbert Edelsbrunner, Hermann A. Maurer

Theor. Comput. Sci., 1981

On the Intersection of Orthogonal Objects.

Herbert Edelsbrunner, Hermann A. Maurer

Inf. Process. Lett., 1981