- Home
- Top Scientists - Mathematics
- Herbert Edelsbrunner

Discipline name
H-index
Citations
Publications
World Ranking
National Ranking

Mathematics
H-index
88
Citations
36,215
256
World Ranking
40
National Ranking
1

Computer Science
H-index
83
Citations
36,873
220
World Ranking
363
National Ranking
3

2018 - Wittgenstein Award

2014 - European Association for Theoretical Computer Science (EATCS) Fellow For his tremendous impact on the field of computational geometry

2009 - Member of Academia Europaea

2008 - German National Academy of Sciences Leopoldina - Deutsche Akademie der Naturforscher Leopoldina – Nationale Akademie der Wissenschaften Informatics

2005 - Fellow of the American Academy of Arts and Sciences

- Geometry
- Combinatorics
- Algorithm

His primary areas of study are Combinatorics, Discrete mathematics, Computational geometry, Algorithm and Voronoi diagram. His research integrates issues of Upper and lower bounds, Plane, Line segment and Finite set in his study of Combinatorics. His Discrete mathematics research includes themes of Function, Piecewise linear function, Combinatorial complexity and Point set triangulation.

His Computational geometry study combines topics in areas such as Intersection, Rectangle, Simple, Triangulation and Space. His work deals with themes such as Polytope, Point, Topology and Discrete geometry, which intersect with Algorithm. He has researched Voronoi diagram in several fields, including Measure, Computation, Euclidean space and Metric.

- Algorithms in Combinatorial Geometry (1867 citations)
- Three-dimensional alpha shapes (1709 citations)
- Computational Topology: An Introduction (1334 citations)

His main research concerns Combinatorics, Discrete mathematics, Delaunay triangulation, Algorithm and Computational geometry. The study incorporates disciplines such as Plane, Convex hull, Finite set, Voronoi diagram and Upper and lower bounds in addition to Combinatorics. The various areas that he examines in his Convex hull study include Convex polytope and Convex set.

His Discrete mathematics research is multidisciplinary, incorporating perspectives in Function, Piecewise linear function, Persistent homology and Metric. As a part of the same scientific family, Herbert Edelsbrunner mostly works in the field of Algorithm, focusing on Space and, on occasion, Point. His Computational geometry research includes elements of Theoretical computer science and Topology.

- Combinatorics (43.87%)
- Discrete mathematics (21.46%)
- Delaunay triangulation (19.10%)

- Combinatorics (43.87%)
- Delaunay triangulation (19.10%)
- Voronoi diagram (9.20%)

His scientific interests lie mostly in Combinatorics, Delaunay triangulation, Voronoi diagram, Discrete mathematics and Finite set. Herbert Edelsbrunner integrates Combinatorics with Poisson point process in his study. His study on Delaunay triangulation also encompasses disciplines like

- Discrete Morse theory that connect with fields like Topological data analysis, Endomorphism, Homotopy and Homology,
- Integer, Euclidean geometry and Alpha shape most often made with reference to Order,
- Morse theory which is related to area like Radius, Order, Algebraic topology, Field and Topology.

Herbert Edelsbrunner works mostly in the field of Alpha shape, limiting it down to concerns involving Construct and, occasionally, Algorithm. He combines subjects such as Centroidal Voronoi tessellation, Computational complexity theory, Degree, Weighted Voronoi diagram and Dual polyhedron with his study of Discrete mathematics. His study in Finite set is interdisciplinary in nature, drawing from both Plane, Uniform boundedness and Alpha.

- Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces (86 citations)
- The Topology of the Cosmic Web in Terms of Persistent Betti Numbers (62 citations)
- A Short Course in Computational Geometry and Topology (48 citations)

- Geometry
- Topology
- Artificial intelligence

Herbert Edelsbrunner mostly deals with Delaunay triangulation, Combinatorics, Discrete mathematics, Voronoi diagram and Morse theory. His biological study spans a wide range of topics, including Discrete Morse theory, Filtration, Order and Finite set. His Combinatorics study incorporates themes from Plane, Lattice and Diagonal.

His Discrete mathematics research is multidisciplinary, relying on both Computational complexity theory, Bowyer–Watson algorithm, Correctness, Constrained Delaunay triangulation and Digital geometry. His studies in Voronoi diagram integrate themes in fields like Point set triangulation, Pitteway triangulation and Topology. His Morse theory research incorporates themes from Algebraic topology, Radius, Field, Topology and Structure formation.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Algorithms in Combinatorial Geometry

Herbert Edelsbrunner.

**(1987)**

3369 Citations

Three-dimensional alpha shapes

Herbert Edelsbrunner;Ernst P. Mücke.

ACM Transactions on Graphics **(1994)**

2608 Citations

Topological persistence and simplification

H. Edelsbrunner;D. Letscher;A. Zomorodian.

foundations of computer science **(2000)**

1906 Citations

Computational Topology: An Introduction

Günter Rote;Gert Vegter.

**(2009)**

1842 Citations

On the shape of a set of points in the plane

H. Edelsbrunner;D. Kirkpatrick;R. Seidel.

IEEE Transactions on Information Theory **(1983)**

1495 Citations

Anatomy of protein pockets and cavities: Measurement of binding site geometry and implications for ligand design

Jie Liang;Herbert Edelsbrunner;Clare Woodward.

Protein Science **(1998)**

1137 Citations

Stability of Persistence Diagrams

David Cohen-Steiner;Herbert Edelsbrunner;John Harer.

Discrete and Computational Geometry **(2007)**

1070 Citations

Geometry and Topology for Mesh Generation

H Edelsbrunner;DJ Benson.

**(2001)**

848 Citations

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

Herbert Edelsbrunner;Ernst Peter Mücke.

ACM Transactions on Graphics **(1990)**

839 Citations

Efficient algorithms for agglomerative hierarchical clustering methods

William H. E. Day;Herbert Edelsbrunner.

Journal of Classification **(1984)**

799 Citations

Profile was last updated on December 6th, 2021.

Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).

The ranking h-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

Tel Aviv University

Stanford University

Princeton University

Duke University

ETH Zurich

Saarland University

University of Utah

University of North Carolina at Chapel Hill

Duke University

Princeton University

French Institute for Research in Computer Science and Automation - INRIA

Publications: 64

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Something went wrong. Please try again later.