H. Edelsbrunner

Herbert Edelsbrunner, Daria Malkova, Michael Machin, 2014, 2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing.

Counting triangle crossings and halving planes

Herbert Edelsbrunner, Tamal K. Dey, H. Edelsbrunner, 1993, SCG '93.

Stationing guards in rectilinear art galleries

J. O'Rourke, H. Edelsbrunner, E. Welzl, 1984 .

The Medusa of Spatial Sorting: Topological Construction pdf

Herbert Edelsbrunner, Michael Kerber, Carl-Philipp Heisenberg, 2012, ArXiv.

Covering and Packing with Spheres by Diagonal Distortion in ℝn

Herbert Edelsbrunner, Michael Kerber, H. Edelsbrunner, 2011, Rainbow of Computer Science.

Inequalities for the curvature of curves and surfaces

David Cohen-Steiner, Herbert Edelsbrunner, H. Edelsbrunner, 2005, SCG.

180 Wrapped Tubes

Herbert Edelsbrunner, H. Edelsbrunner, 2001, J. Univers. Comput. Sci..

Fast Geometric Algorithm for Rigid Protein Docking

Herbert Edelsbrunner, Pankaj K. Agarwal, Johannes Rudolph, 2004 .

Accurate Protein Docking by Shape Complementarity Alone

H. Edelsbrunner, Sergei N. Bespamyatnikh, J. Rudolph, 2022 .

Multiple covers with balls I: Inclusion-exclusion

Herbert Edelsbrunner, Mabel Iglesias Ham, H. Edelsbrunner, 2018, Comput. Geom..

A Short Course in Computational Geometry and Topology

Herbert Edelsbrunner, H. Edelsbrunner, 2014 .

Modes of gaussian mixtures and an inequality for the distance between curves in space

Brittany Terese Fasy, H. Edelsbrunner, 2012 .

Implicitly representing arrangements of lines or segments

Leonidas J. Guibas, Micha Sharir, Raimund Seidel, 2011, SCG '88.

Inferring Local Homology from Sampled Stratified Spaces

David Cohen-Steiner, Herbert Edelsbrunner, Dmitriy Morozov, 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

Foundations of Computational Mathematics: Minneapolis, 2002: Jacobi Sets

H. Edelsbrunner, J. Harer, 2004 .

Geometric probing

Steven Skiena, Herbert Edelsbrunner, H. Edelsbrunner, 1988 .

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

Herbert Edelsbrunner, Ernst P. Mücke, H. Edelsbrunner, 1988, SCG '88.

Euclidean minimum spanning trees and bichromatic closest pairs

Otfried Cheong, Herbert Edelsbrunner, Pankaj K. Agarwal, 1990, SCG '90.

Computing the Extreme Distances Between Two Convex Polygons

Herbert Edelsbrunner, H. Edelsbrunner, 1985, J. Algorithms.

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

Jean-Daniel Boissonnat, Herbert Edelsbrunner, Dominique Attali, 2009, Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration.

Triangulations and meshes in computational geometry

Herbert Edelsbrunner, H. Edelsbrunner, 2000, Acta Numerica.

The union of balls and its dual shape

Herbert Edelsbrunner, H. Edelsbrunner, 1993, SCG '93.

Surface Reconstruction by Wrapping Finite Sets in Space

H. Edelsbrunner, 2003 .

Protein-protein interfaces: properties, preferences, and projections.

Herbert Edelsbrunner, Madhuwanti Vaidya, Jeffrey J Headd, 2007, Journal of proteome research.

Mathematisches Forschungsinstitut Oberwolfach Report No . 4 / 2007 Geometric and Topological Combinatorics Organised

G. Ziegler, H. Edelsbrunner, A. Barvinok, 2007 .

3D phenotyping and quantitative trait locus mapping identify core regions of the rice genome controlling root architecture

Paul R Zurek, Brad T. Moore, H. Edelsbrunner, 2013, Proceedings of the National Academy of Sciences.

Experimental validation of the docking orientation of Cdc25 with its Cdk2-CycA protein substrate.

Jerry M. Parks, H. Edelsbrunner, J. Rudolph, 2005, Biochemistry.

Computational Topology by Herbert Edelsbrunner and John L . Harer

H. Edelsbrunner, J. Harer, 1999 .

65 COMPUTATIONAL TOPOLOGY FOR STRUCTURAL MOLECULAR BIOLOGY

P. Koehl, H. Edelsbrunner, 2017 .

Geometric and topological methods in protein structure analysis

P. Agarwal, H. Edelsbrunner, Yusu Wang, 2004 .

A new approach to rectangle intersections

H. Edelsbrunner, 2010 .

Topological Analysis Using Morse Theory and Auditory Display

H. Edelsbrunner, U. Axen, 1998 .

Circles through two points that always enclose many points

Raimund Seidel, Herbert Edelsbrunner, H. Edelsbrunner, 1989 .

An Upper Bound forConforming

H. Edelsbrunner, Delaunay Triangulations, T. Tan, 1993 .

Approximation and convergence of the intrinsic volume

Herbert Edelsbrunner, Florian Pausinger, H. Edelsbrunner, 2016 .

Semispaces of Configurations

Herbert Edelsbrunner, H. Edelsbrunner, 1987 .

Edge Insertion for Optimal Triangulations 1 Edge Insertion for Optimal Triangulations

S. Mitchell, D. Eppstein, M. Bern, 1993 .

Protein Docking by Exhaustive Search

H. Edelsbrunner, Sergei N. Bespamyatnikh, 2002 .

Topological data analysis

H. Edelsbrunner, C. Epstein, Gunnar E Carlsson, 2011 .

A step in the Delaunay mosaic of order k

H. Edelsbrunner, G. Osang, A. Nikitenko, 2021, Journal of geometry.

Shape Reconstruction with Delaunay Complex (Invited Paper)

H. Edelsbrunner, 1998 .

Geometric Techniques for Molecular Shape Analysis

Herbert Edelsbrunner, Michael A. Facello, H. Edelsbrunner, 1996 .

A point calculus for interlevel set homology

Herbert Edelsbrunner, Sergio Cabello, Paul Bendich, 2012, Pattern Recognit. Lett..

Weighted Poisson-Delaunay mosaics

H. Edelsbrunner, A. Nikitenko, 2017, Teoriya Veroyatnostei i ee Primeneniya.

Revisiting Alexander Duality with Tessellations and Mosaics

H. Edelsbrunner, S. Montesano, R. Biswas, 2019 .

Multiple Covers with Balls II : Weighted Averages 1

H. Edelsbrunner, Mabel Iglesias-Ham, 2016 .

On the Shape o f a Set o f Points in the Plane

H. Edelsbrunner, R. Seidel, D. Kirkpatrick, 2022 .

On the Intersection of Orthogonal Objects

Herbert Edelsbrunner, Hermann A. Maurer, H. Edelsbrunner, 1981, Inf. Process. Lett..

Corrigendum: Topologically Sweeping an Arrangement

Leonidas J. Guibas, Herbert Edelsbrunner, H. Edelsbrunner, 1991, J. Comput. Syst. Sci..

Polygonal Intersection Searching

David G. Kirkpatrick, Herbert Edelsbrunner, Hermann A. Maurer, 1982, Inf. Process. Lett..

Open Problems in Discrete and Computational Geometry

H. Edelsbrunner, A. Ivanov, R. Karasev, 2012 .

Weighted alpha shapes

Herbert Edelsbrunner, H. Edelsbrunner, 1992 .

Three-dimensional alpha shapes

Ernst P. Mücke, H. Edelsbrunner, 1992 .

A Hyperplane Incidence Problem with Applications to Counting Distances

Micha Sharir, Herbert Edelsbrunner, M. Sharir, 1990, SIGAL International Symposium on Algorithms.

Lines in space - combinatorics, algorithms and applications

Leonidas J. Guibas, Micha Sharir, Herbert Edelsbrunner, 1989, Symposium on the Theory of Computing.

Counting and cutting cycles of lines and rods in space

Leonidas J. Guibas, Bernard Chazelle, Micha Sharir, 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

ITR/ACS+IM Computational Geometry for Structural Biology and Bioinformatics

M. Levitt, J. Latombe, P. Agarwal, 2002 .

On the Equivalence of Some Rectangle Problems

Mark H. Overmars, Herbert Edelsbrunner, H. Edelsbrunner, 1982, Inf. Process. Lett..

Unexpected topology of the temperature fluctuations in the cosmic microwave background

H. Edelsbrunner, R. Adler, H. Wagner, 2018, Astronomy & Astrophysics.

The Beauty of Random Polytopes Inscribed in the 2-Sphere

Herbert Edelsbrunner, Arseniy Akopyan, Anton Nikitenko, 2020, Experimental Mathematics.

Geometry and Topology for Mesh Generation

Herbert Edelsbrunner, H. Edelsbrunner, 2001, Cambridge monographs on applied and computational mathematics.

COMPLEXITY OF CUTTING CONVEX POLYTOPES.

Leonidas J. Guibas, Bernard Chazelle, Herbert Edelsbrunner, 1987, Symposium on the Theory of Computing.

On the configuration space of Steiner minimal trees

H. Edelsbrunner, N. P. Strelkova, 2012, 1906.06577.

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

Ernst P. Mücke, H. Edelsbrunner, 1990, TOGS.

Depth in Arrangements: Dehn–Sommerville–Euler Relations with Applications

H. Edelsbrunner, M. Saghafian, R. Biswas, 2022 .

A Window to the Persistence of 1D Maps. I: Geometric Characterization of Critical Point Pairs

H. Edelsbrunner, M. Saghafian, R. Biswas, 2022 .

Discovering Metrics and Scale Space

H. Edelsbrunner, 2010 .

Persistent Homology of Chromatic Alpha Complexes

H. Edelsbrunner, M. Saghafian, S. C. D. Montesano, 2022, ArXiv.

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

Herbert Edelsbrunner, Emo Welzl, E. Welzl, 1983, ICALP.

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

Herbert Edelsbrunner, Emo Welzl, E. Welzl, 1984, MFCS.

Analytical shape computation of macromolecules: I. molecular area and volume through alpha shape

S Subramaniam, J Liang, H Edelsbrunner, 1998, Proteins.

Interface surfaces for protein-protein complexes

Herbert Edelsbrunner, Johannes Rudolph, Yih-En Andrew Ban, 2004, JACM.

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

Franz Aurenhammer, Herbert Edelsbrunner, H. Edelsbrunner, 1984, Pattern Recognit..

Topological Data Analysis

Moo K. Chung, H. Edelsbrunner, C. Epstein, 2012 .

On the lower envelope of bivariate functions and its applications

Micha Sharir, János Pach, Herbert Edelsbrunner, 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

Edge insertion for optimal triangulations

David Eppstein, Tiow Seng Tan, Herbert Edelsbrunner, 1993, Discret. Comput. Geom..

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

Tiow Seng Tan, Herbert Edelsbrunner, Roman Waupotitsch, 1992, SIAM J. Sci. Comput..

An upper bound for conforming Delaunay triangulations

Tiow Seng Tan, Herbert Edelsbrunner, H. Edelsbrunner, 1992, SCG '92.

A topological hierarchy for functions on triangulated surfaces

Bernd Hamann, Valerio Pascucci, Herbert Edelsbrunner, 2004, IEEE Transactions on Visualization and Computer Graphics.

A multi-resolution data structure for two-dimensional Morse-Smale functions

B. Hamann, P.-T. Bremer, H. Edelsbrunner, 2003, IEEE Visualization, 2003. VIS 2003..

The geometry of biomolecular solvation

Herbert Edelsbrunner, Patrice Koehl, P. Koehl, 2005 .

The Weighted Mean Curvature Derivative of a Space-Filling Diagram

Arseniy Akopyan, Herbert Edelsbrunner, H. Edelsbrunner, 2019, Computational and Mathematical Biophysics.

The Weighted Gaussian Curvature Derivative of a Space-Filling Diagram

Arseniy Akopyan, Herbert Edelsbrunner, H. Edelsbrunner, 2019, Computational and Mathematical Biophysics.

On the Definition and the Construction of Pockets in Macromolecules

Herbert Edelsbrunner, Michael A. Facello, Jie Liang, 1998, Discret. Appl. Math..

Three-dimensional alpha shapes

Herbert Edelsbrunner, Ernst P. Mücke, H. Edelsbrunner, 1992, VVS.

Topological analysis of scalar functions for scientific data visualization

Herbert Edelsbrunner, Vijay Natarajan, H. Edelsbrunner, 2004 .

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

Herbert Edelsbrunner, Salman Parsa, H. Edelsbrunner, 2014, SODA.

Computational Topology - an Introduction

Herbert Edelsbrunner, John Harer, H. Edelsbrunner, 2009 .

Stability of Persistence Diagrams

David Cohen-Steiner, Herbert Edelsbrunner, John Harer, 2005, Discret. Comput. Geom..

Topological Persistence and Simplification

Herbert Edelsbrunner, Afra Zomorodian, David Letscher, 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

The Topology of the Cosmic Web in Terms of Persistent Betti Numbers

Herbert Edelsbrunner, Mathijs Wintraecken, Rien van de Weygaert, 2016, 1608.04519.

The upper envelope of piecewise linear functions: Algorithms and applications

Leonidas J. Guibas, Micha Sharir, Herbert Edelsbrunner, 2015, Discret. Comput. Geom..

Genotypic recognition and spatial responses by rice roots

H. Edelsbrunner, P. Benfey, J. Weitz, 2013, Proceedings of the National Academy of Sciences.

Expected sizes of Poisson–Delaunay mosaics and their discrete Morse functions

Herbert Edelsbrunner, Matthias Reitzner, Anton Nikitenko, 2016, Advances in Applied Probability.

Computational Topology for Structural Molecular Biology

Herbert Edelsbrunner, Patrice Koehl, P. Koehl, 2017 .

Measuring proteins and voids in proteins

Herbert Edelsbrunner, Ping Fu, Michael A. Facello, 1995, Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences.

Diffusion runs low on persistence fast

Chao Chen, Herbert Edelsbrunner, H. Edelsbrunner, 2011, 2011 International Conference on Computer Vision.

Lipschitz Functions Have Lp-Stable Persistence

David Cohen-Steiner, Herbert Edelsbrunner, John Harer, 2010, Found. Comput. Math..

Topologically sweeping an arrangement

Leonidas J. Guibas, Herbert Edelsbrunner, H. Edelsbrunner, 1986, STOC '86.

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

Brittany Terese Fasy, H. Edelsbrunner, G. Rote, 2012, SoCG '12.

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

Herbert Edelsbrunner, Monique Teillaud, Johan Hidding, 2013, Trans. Comput. Sci..

On the Optimality of the FCC Lattice for Soft Sphere Packing

Herbert Edelsbrunner, Mabel Iglesias Ham, H. Edelsbrunner, 2018, SIAM J. Discret. Math..

Relaxed Disk Packing pdf

Vitaliy Kurlin, Mabel Iglesias Ham, Herbert Edelsbrunner, 2015, CCCG.

The weighted-volume derivative of a space-filling diagram

Herbert Edelsbrunner, Patrice Koehl, P. Koehl, 2003, Proceedings of the National Academy of Sciences of the United States of America.

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

H. Edelsbrunner, M. Saghafian, A. Garber, 2022, ArXiv.

Radius Functions on Poisson–Delaunay Mosaics and Related Complexes Experimentally

H. Edelsbrunner, P. Synak, A. Nikitenko, 2020 .

Weighted Poisson--Delaunay Mosaics

H. Edelsbrunner, A. Nikitenko, 2019 .

Random inscribed polytopes have similar radius functions as Poisson–Delaunay mosaics

Herbert Edelsbrunner, Anton Nikitenko, H. Edelsbrunner, 2017, The Annals of Applied Probability.

Geometry and Topology for Mesh Generation

Herbert Edelsbrunner, H. Edelsbrunner, 2001, Cambridge monographs on applied and computational mathematics.

On the shape of a set of points in the plane

David G. Kirkpatrick, Raimund Seidel, Herbert Edelsbrunner, 1983, IEEE Trans. Inf. Theory.

Morse-smale complexes for piecewise linear 3-manifolds

Valerio Pascucci, Herbert Edelsbrunner, Vijay Natarajan, 2003, SCG '03.

Morse Complexes for Piecewise Linear 3-Manifolds

Valerio Pascucci, Herbert Edelsbrunner, Vijay Natarajan, 2003 .

PROOF OF CORRECTNESS OF THE DIGITAL DELAUNAY TRIANGULATION

THANH-TUNG CAO, HERBERT EDELSBRUNNER, TIOW-SENG TAN, 2010 .

Skeletal Structures

Jean-Daniel Boissonnat, Gershon Elber, Remco C. Veltkamp, 2008, Shape Analysis and Structuring.

Optimal Point Location in a Monotone Subdivision

Leonidas J. Guibas, Jorge Stolfi, Herbert Edelsbrunner, 1986, SIAM J. Comput..

Three-dimensional Alpha Shapes 1

Herbert Edelsbrunner, H. Edelsbrunner, 1994 .

Inclusion-exclusion complexes for pseudodisk collections

Herbert Edelsbrunner, Edgar A. Ramos, H. Edelsbrunner, 1997, Discret. Comput. Geom..

On the Zone Theorem for Hyperplane Arrangements

Micha Sharir, Raimund Seidel, Herbert Edelsbrunner, 1991, SIAM J. Comput..

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

Leonidas J. Guibas, Micha Sharir, Raimund Seidel, 2018, Theor. Comput. Sci..

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

Leonidas J. Guibas, Micha Sharir, Boris Aronov, 1992, Comb..

Computing a face in an arrangement of line segments

Leonidas J. Guibas, Bernard Chazelle, Micha Sharir, 1991, SODA '91.

Combinatorial complexity bounds for arrangements of curves and spheres

Leonidas J. Guibas, Kenneth L. Clarkson, Micha Sharir, 1990, Discret. Comput. Geom..

The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2

Micha Sharir, Herbert Edelsbrunner, M. Sharir, 1990, Discret. Comput. Geom..

On arrangements of Jordan arcs with three intersections per pair

Leonidas J. Guibas, Micha Sharir, Raimund Seidel, 2018, SCG '88.

Constructing arrangements of lines and hyperplanes with applications

Raimund Seidel, Herbert Edelsbrunner, Joseph O'Rourke, 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

Stabbing line segments

Arnold L. Rosenberg, Derick Wood, Herbert Edelsbrunner, 1982, BIT.

Voronoi diagrams and arrangements

Raimund Seidel, Herbert Edelsbrunner, H. Edelsbrunner, 1985, SCG '85.

Algorithmic issues in modeling motion

Leonidas J. Guibas, Dinesh Manocha, Christian S. Jensen, 2002, CSUR.

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

P. Koehl, H. Edelsbrunner, A. Akopyan, 2023, J. Chem. Inf. Model..

Optimal Time Bounds for Some Proximity Problems in the Plane

Alok Aggarwal, Herbert Edelsbrunner, Prabhakar Raghavan, 1992, Inf. Process. Lett..

Loops in Reeb Graphs of 2-Manifolds

Valerio Pascucci, Herbert Edelsbrunner, Vijay Natarajan, 2003, SCG '03.

An incremental algorithm for Betti numbers of simplicial complexes

Herbert Edelsbrunner, Cecil Jose A. Delfinado, C. J. A. Delfinado, 1993, SCG '93.

Triangulating topological spaces

Herbert Edelsbrunner, Nimish R. Shah, H. Edelsbrunner, 1994, SCG '94.

Computing and Comprehending Topology: Persistence and Hierarchical Morse Complexes

Herbert Edelsbrunner, Afra Zomorodian, H. Edelsbrunner, 2001 .

Persistence-sensitive simplification functions on 2-manifolds

Valerio Pascucci, Herbert Edelsbrunner, Dmitriy Morozov, 2006, SCG '06.

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

Bernd Hamann, Valerio Pascucci, Herbert Edelsbrunner, 2003, IEEE Visualization.

Hierarchical morse complexes for piecewise linear 2-manifolds

Herbert Edelsbrunner, Afra Zomorodian, John Harer, 2001, SCG '01.

Auditory Morse Analysis of Triangulated Manifolds

Herbert Edelsbrunner, Ulrike Axen, H. Edelsbrunner, 1997, VisMath.

Extreme Elevation on a 2-Manifold

Herbert Edelsbrunner, Pankaj K. Agarwal, Yusu Wang, 2004, SCG '04.

Dynamic Skin Triangulation

Ho-Lun Cheng, Herbert Edelsbrunner, Tamal K. Dey, 2001, SODA '01.

Hierarchical Morse—Smale Complexes for Piecewise Linear 2-Manifolds

Herbert Edelsbrunner, Afra Zomorodian, John Harer, 2003, Discret. Comput. Geom..

Emerging Challenges in Computational Topology

Leonidas J. Guibas, David Eppstein, David P. Dobkin, 1999, ArXiv.

Evaluating the quality of NMR structures by local density of protons

Pei Zhou, Herbert Edelsbrunner, H. Edelsbrunner, 2005, Proteins.

Persistent homology for kernels, images, and cokernels

David Cohen-Steiner, Herbert Edelsbrunner, Dmitriy Morozov, 2009, SODA.

Topological signatures and stability of hexagonal close packing and Barlow stackings.

H. Edelsbrunner, M. Saadatfar, G. Osang, 2021, Soft matter.

Persistent Homology in Image Processing

Herbert Edelsbrunner, H. Edelsbrunner, 2013, GbRPR.

An acyclicity theorem for cell complexes ind dimension

Herbert Edelsbrunner, H. Edelsbrunner, 1990, Comb..

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

Leonidas J. Guibas, Bernard Chazelle, Micha Sharir, 1991, Theor. Comput. Sci..

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

Leonidas J. Guibas, Bernard Chazelle, Micha Sharir, 1989, ICALP.

Modeling with Simplicial Complexes

Herbert Edelsbrunner, H. Edelsbrunner, 1994, Canadian Conference on Computational Geometry.

Computational Geometry

Herbert Edelsbrunner, H. Edelsbrunner, 1993, Current Trends in Theoretical Computer Science.

Persistent Homology: Theory and Practice

Herbert Edelsbrunner, Dmitriy Morozov, H. Edelsbrunner, 2013 .

Tri-partitions and Bases of an Ordered Complex

Herbert Edelsbrunner, Katharina Ölsböck, H. Edelsbrunner, 2020, Discrete & Computational Geometry.

The Persistent Homology of a Self-Map

H. Edelsbrunner, M. Mrozek, Grzegorz Jablonski, 2015, Found. Comput. Math..

An Improved Algorithm for Constructing k th-Order Voronoi Diagrams

Bernard Chazelle, Herbert Edelsbrunner, B. Chazelle, 1987, IEEE Trans. Computers.

An Improved Algorithm for Constructing kth-Order Voronoi Diagrams

Bernard Chazelle, Herbert Edelsbrunner, B. Chazelle, 1985, IEEE Transactions on Computers.

Computing Robustness and Persistence for Images

Herbert Edelsbrunner, Paul Bendich, Michael Kerber, 2010, IEEE Transactions on Visualization and Computer Graphics.

Computing the Writhing Number of a Polygonal Knot

Herbert Edelsbrunner, Pankaj K. Agarwal, Yusu Wang, 2002, SODA '02.

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

Herbert Edelsbrunner, Emo Welzl, E. Welzl, 1986, J. Comb. Theory, Ser. A.

Tetrahedrizing Point Sets in Three Dimensions

H. Edelsbrunner, F.P. Preparata, D.B. West, 1988, ISSAC.

Diameter, width, closest line pair, and parametric searching

Leonidas J. Guibas, Bernard Chazelle, Micha Sharir, 1992, SCG '92.

Vines and vineyards by updating persistence in linear time

David Cohen-Steiner, Herbert Edelsbrunner, Dmitriy Morozov, 2006, SCG '06.

Extending Persistence Using Poincaré and Lefschetz Duality

David Cohen-Steiner, Herbert Edelsbrunner, John Harer, 2009, Found. Comput. Math..

Reeb spaces of piecewise linear mappings

Herbert Edelsbrunner, John Harer, Amit K. Patel, 2008, SCG '08.

Algorithms for bichromatic line-segment problems and polyhedral terrains

Leonidas J. Guibas, Bernard Chazelle, Micha Sharir, 1994, Algorithmica.

The Density Fingerprint of a Periodic Point Set

H. Edelsbrunner, M. Wintraecken, V. Kurlin, 2021, SoCG.

The complexity of cutting complexes

Leonidas J. Guibas, Bernard Chazelle, Herbert Edelsbrunner, 1989, Discret. Comput. Geom..

The Morse theory of Čech and Delaunay complexes

Ulrich Bauer, Herbert Edelsbrunner, H. Edelsbrunner, 2013, 1312.1231.

Computational Geometric and Algebraic Topology

Benjamin A. Burton, Herbert Edelsbrunner, Stephan Tillmann, 2015 .

An optimal algorithm for intersecting line segments in the plane

Bernard Chazelle, Herbert Edelsbrunner, B. Chazelle, 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

Homology and Robustness of Level and Interlevel Sets pdf

Herbert Edelsbrunner, Dmitriy Morozov, Paul Bendich, 2011, ArXiv.

The Morse Theory of Čech and Delaunay Filtrations

Ulrich Bauer, Herbert Edelsbrunner, H. Edelsbrunner, 2013, SoCG.

Topology preserving edge contraction

Herbert Edelsbrunner, Tamal K. Dey, Sumanta Guha, 1998 .

The upper envelope of piecewise linear functions: Tight bounds on the number of faces

Herbert Edelsbrunner, H. Edelsbrunner, 1989, Discret. Comput. Geom..

Deformable Smooth Surface Design

Herbert Edelsbrunner, H. Edelsbrunner, 1999, Discret. Comput. Geom..

Hierarchical Ordering of Reticular Networks

Herbert Edelsbrunner, Yuriy Mileyko, Joshua S. Weitz, 2011, PloS one.

Dual Complexes of Cubical Subdivisions of ℝn

H. Edelsbrunner, Michael Kerber, 2012, Discret. Comput. Geom..

The Multi-Cover Persistence of Euclidean Balls

Herbert Edelsbrunner, Georg Osang, H. Edelsbrunner, 2021, Discrete & Computational Geometry.

A Simple Algorithm for Computing Higher Order Delaunay Mosaics

H. Edelsbrunner, G. Osang, 2019 .

Batched Dynamic Solutions to Decomposable Searching Problems

Mark H. Overmars, Herbert Edelsbrunner, H. Edelsbrunner, 1985, J. Algorithms.

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

Jan van Leeuwen, Derick Wood, Herbert Edelsbrunner, 1984, RAIRO Theor. Informatics Appl..

Sink-insertion for mesh improvement

Herbert Edelsbrunner, Damrong Guoy, H. Edelsbrunner, 2001, SCG '01.

Some methods of computational geometry applied to computer graphics

Raimund Seidel, Mark H. Overmars, Herbert Edelsbrunner, 1984, Comput. Vis. Graph. Image Process..

Key-Problems and Key-Methods in Computational Geormetry

Herbert Edelsbrunner, H. Edelsbrunner, 1984, STACS.

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

Herbert Edelsbrunner, Péter Hajnal, P. Hajnal, 1991, J. Comb. Theory, Ser. A.

Constructing Belts in Two-Dimensional Arrangements with Applications

Herbert Edelsbrunner, Emo Welzl, E. Welzl, 1986, SIAM J. Comput..

On the Size of Chromatic Delaunay Mosaics

H. Edelsbrunner, R. Biswas, M. Saghafian, 2022, ArXiv.

Local Search Heuristic for Rigid Protein Docking

Herbert Edelsbrunner, Pankaj K. Agarwal, Vicky Choi, 2004, WABI.

Smooth Surfaces for Multi-Scale Shape Representation

Herbert Edelsbrunner, H. Edelsbrunner, 1995, FSTTCS.

Quantifying Transversality by Measuring the Robustness of Intersections

Herbert Edelsbrunner, Dmitriy Morozov, Amit K. Patel, 2009, Found. Comput. Math..

The Area Derivative of a Space-Filling Diagram

Herbert Edelsbrunner, Patrice Koehl, Michael Levitt, 2004, Discret. Comput. Geom..

Fast software for box intersections

Herbert Edelsbrunner, Afra Zomorodian, H. Edelsbrunner, 2000, SCG '00.

Computing Linking Numbers of a Filtration

Herbert Edelsbrunner, Afra Zomorodian, H. Edelsbrunner, 2001, WABI.

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

Herbert Edelsbrunner, Cecil Jose A. Delfinado, C. J. A. Delfinado, 1995, Comput. Aided Geom. Des..

A combinatorial approach to cartograms

Herbert Edelsbrunner, Roman Waupotitsch, H. Edelsbrunner, 1995, SCG '95.

Computing Robustness and Persistence for Images

H. Edelsbrunner, Paul Bendich, Michael Kerber, 2010, IEEE Transactions on Visualization and Computer Graphics.

Shape Reconstruction with Delaunay Complex

Herbert Edelsbrunner, H. Edelsbrunner, 1998, LATIN.

Three-dimensional alpha shapes

Ernst P. Mücke, H. Edelsbrunner, 1994, TOGS.

Smoothing and cleaning up slivers

Xiang-Yang Li, Gary L. Miller, Herbert Edelsbrunner, 2000, STOC '00.

An Experimental Study of Sliver Exudation

Herbert Edelsbrunner, Damrong Guoy, H. Edelsbrunner, 2002, Engineering with Computers.

Ray shooting in polygons using geodesic triangulations

Leonidas J. Guibas, Bernard Chazelle, Micha Sharir, 1991, Algorithmica.

An O(n2log n) time algorithm for the MinMax angle triangulation

Tiow Seng Tan, Herbert Edelsbrunner, Roman Waupotitsch, 1990, SCG '90.

Incremental topological flipping works for regular triangulations

Herbert Edelsbrunner, Nimish R. Shah, H. Edelsbrunner, 1992, SCG '92.

The Persistent Morse Complex Segmentation of a 3-Manifold

Herbert Edelsbrunner, John Harer, H. Edelsbrunner, 2009, 3DPH.

Holes and dependences in an ordered complex

Herbert Edelsbrunner, Katharina Ölsböck, H. Edelsbrunner, 2019, Comput. Aided Geom. Des..

Topological Data Analysis in Information Space pdf

Herbert Edelsbrunner, Hubert Wagner, Ziga Virk, 2019, SoCG.

Persistence in sampled dynamical systems faster pdf

Ulrich Bauer, Grzegorz Jablonski, Herbert Edelsbrunner, 2017, ArXiv.

Stable Length Estimates of Tube-Like Shapes

Herbert Edelsbrunner, Florian Pausinger, H. Edelsbrunner, 2014, Journal of Mathematical Imaging and Vision.

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

Herbert Edelsbrunner, Michael Kerber, H. Edelsbrunner, 2012, ArXiv.

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

Herbert Edelsbrunner, Michael Kerber, H. Edelsbrunner, 2011, SoCG '12.

Partitioning Space for Range Queries

David P. Dobkin, Herbert Edelsbrunner, F. Frances Yao, 1989, SIAM J. Comput..

Shape space from deformation

Ho-Lun Cheng, Herbert Edelsbrunner, Ping Fu, 1998, Proceedings Pacific Graphics '98. Sixth Pacific Conference on Computer Graphics and Applications (Cat. No.98EX208).

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

Ernst P. Mücke, H. Edelsbrunner, 1990, TOGS.

Local and global comparison of continuous functions

Valerio Pascucci, Herbert Edelsbrunner, Vijay Natarajan, 2004, IEEE Visualization 2004.

A quadratic time algorithm for the minmax length triangulation

Tiow Seng Tan, Herbert Edelsbrunner, H. Edelsbrunner, 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

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

Herbert Edelsbrunner, Weiping Shi, H. Edelsbrunner, 1991, SIAM J. Comput..

An acyclicity theorem for cell complexes in d dimensions

Herbert Edelsbrunner, H. Edelsbrunner, 1989, SCG '89.

The Adaptive Topology of a Digital Image

Herbert Edelsbrunner, Olga Symonova, H. Edelsbrunner, 2012, 2012 Ninth International Symposium on Voronoi Diagrams in Science and Engineering.

Triangulating the Surface of a Molecule

Herbert Edelsbrunner, Nataraj Akkiraju, H. Edelsbrunner, 1996, Discret. Appl. Math..

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

Günter Rote, Herbert Edelsbrunner, Emo Welzl, 1987, ICALP.

Geometric modeling in CAVE

Herbert Edelsbrunner, Jiang Qian, Ping Fu, 1996, VRST.

Edgewise Subdivision of a Simplex

Herbert Edelsbrunner, Daniel R. Grayson, H. Edelsbrunner, 2000, Discret. Comput. Geom..

Minimum Polygonal Separation 1

H. Edelsbrunner, F. Preparata, 2017 .

Ieee Transactions on Visualization and Computer Graphics Simplification of Three-dimensional Density Maps

H. Edelsbrunner, V. Natarajan, 2022 .