Herbert Edelsbrunner

32.9k total citations · 8 hit papers
288 papers, 19.2k citations indexed

About

Herbert Edelsbrunner is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Computer Vision and Pattern Recognition. According to data from OpenAlex, Herbert Edelsbrunner has authored 288 papers receiving a total of 19.2k indexed citations (citations by other indexed papers that have themselves been cited), including 177 papers in Computer Graphics and Computer-Aided Design, 108 papers in Computational Theory and Mathematics and 107 papers in Computer Vision and Pattern Recognition. Recurrent topics in Herbert Edelsbrunner's work include Computational Geometry and Mesh Generation (171 papers), Topological and Geometric Data Analysis (84 papers) and Digital Image Processing Techniques (75 papers). Herbert Edelsbrunner is often cited by papers focused on Computational Geometry and Mesh Generation (171 papers), Topological and Geometric Data Analysis (84 papers) and Digital Image Processing Techniques (75 papers). Herbert Edelsbrunner collaborates with scholars based in United States, Austria and Israel. Herbert Edelsbrunner's co-authors include John Harer, Ernst P. Mücke, Raimund Seidel, Leonidas Guibas, Jie Liang, David Kirkpatrick, David Cohen‐Steiner, W. H. Day, Bernard Chazelle and Micha Sharir and has published in prestigious journals such as Proceedings of the National Academy of Sciences, SHILAP Revista de lepidopterología and Journal of the American Statistical Association.

In The Last Decade

Herbert Edelsbrunner

278 papers receiving 17.9k citations

Hit Papers

5 papers align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Three-dimensional alpha shapes

1994 1.7k citations Herbert Edelsbrunner et al. profile →
On the shape of a set of points in the plane

1983 1.2k citations Herbert Edelsbrunner, David Kirkpatrick et al. profile →
Algorithms in Combinatorial Geometry

1987 1.0k citations Herbert Edelsbrunner profile →
Computational Topology: An Introduction

2009 871 citations Herbert Edelsbrunner, John Harer profile →
Anatomy of protein pockets and cavities: Measurement of binding site geometry and implications for ligand design

1998 815 citations Herbert Edelsbrunner et al. profile →
Efficient algorithms for agglomerative hierarchical clustering methods

1984 625 citations Herbert Edelsbrunner et al. profile →
Stability of Persistence Diagrams

2006 596 citations David Cohen‐Steiner, Herbert Edelsbrunner et al. Discrete & Computational Geometry profile →
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms

1990 464 citations Herbert Edelsbrunner et al. profile →

Peers

Countries citing papers authored by Herbert Edelsbrunner

Since Specialization

Citations

This map shows the geographic impact of Herbert Edelsbrunner's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Herbert Edelsbrunner with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Herbert Edelsbrunner more than expected).

Fields of papers citing papers by Herbert Edelsbrunner

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Herbert Edelsbrunner. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Herbert Edelsbrunner. The network helps show where Herbert Edelsbrunner may publish in the future.

Co-authorship network of co-authors of Herbert Edelsbrunner

This figure shows the co-authorship network connecting the top 25 collaborators of Herbert Edelsbrunner. A scholar is included among the top collaborators of Herbert Edelsbrunner based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Herbert Edelsbrunner. Herbert Edelsbrunner is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	Computing the Volume, Surface Area, Mean, and Gaussian Curvatures of Molecules and Their Derivatives 2023 ·Journal of Chemical Information and Modeling ·Patrice Koehl, Arseniy Akopyan, Herbert Edelsbrunner	9
2	Computational Geometric and Algebraic Topology 2016 ·Oberwolfach Reports ·Benjamin A. Burton, Herbert Edelsbrunner, Jeff Erickson, Stephan Tillmann	1
3	The First Yaroslavl Summer School on Discrete and Computational Geometry 2015 ·SHILAP Revista de lepidopterología ·(unknown), Herbert Edelsbrunner, Alexander Ivanov, Oleg R. Musin	1
4	Genotypic recognition and spatial responses by rice roots 2013 ·Proceedings of the National Academy of Sciences ·Suqin Fang, Randy T. Clark, Ying Zheng, Anjali S. Iyer‐Pascuzzi, Joshua S. Weitz, Leon V. Kochian, Herbert Edelsbrunner, Hong Liao, Philip N. Benfey	121
5	Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions 2013 ·Discrete & Computational Geometry ·Herbert Edelsbrunner, Brittany Terese Fasy, Günter Rote	2
6	Computing Robustness and Persistence for Images 2010 ·IEEE Transactions on Visualization and Computer Graphics ·Paul Bendich, Herbert Edelsbrunner, Michael Kerber	65
7	Persistent homology for kernels, images, and cokernels 2009 ·Symposium on Discrete Algorithms ·David Cohen‐Steiner, Herbert Edelsbrunner, John Harer, Dmitriy Morozov	20
8	Geometry and Topology for Mesh Generation (Cambridge Monographs on Applied and Computational Mathematics) 2006 ·Cambridge University Press eBooks ·Herbert Edelsbrunner, Mark J. Ablowitz, (unknown), E. J. Hinch, Arieh Iserles, J. R. Ockendon, Peter J. Olver	32
9	Persistence-sensitive simplification of functions on 2-manlfolds 2006 ·Herbert Edelsbrunner, Dmitriy Morozov, Valerio Pascucci	11
10	180 Wrapped Tubes 2001 ·JUCS - Journal of Universal Computer Science ·Herbert Edelsbrunner	1
11	Cutting dense point sets in half 1994 ·Refubium (Universitätsbibliothek der Freien Universität Berlin) ·Herbert Edelsbrunner, Pável Valtr, Emo Welzl	5
12	Modeling with Simplicial Complexes. 1994 ·Canadian Conference on Computational Geometry ·Herbert Edelsbrunner	7
13	Arrangements of curves in the plane 1992 ·Theoretical Computer Science ·Herbert Edelsbrunner	1
14	Counting and cutting cycles of lines and rods in space 1992 ·Computational Geometry ·Bernard Chazelle, Herbert Edelsbrunner, Leonidas Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink	40
15	Spatial Triangulations with Dihedral Angle Conditions 1989 ·Herbert Edelsbrunner	2
16	Lines in space - combinatorics, algorithms and applications 1989 ·Bernard Chazelle, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir	34
17	Computing a ham-sandwich cut in two dimensions 1986 ·Journal of Symbolic Computation ·Herbert Edelsbrunner, Roman Waupotitsch	27
18	On the maximal number of edges of many faces in an arrangement 1986 ·Journal of Combinatorial Theory Series A ·Herbert Edelsbrunner, (unknown)	21
19	Finding Extreme Distances between Convex Polygons. 1983 ·Herbert Edelsbrunner	3
20	The Shape of a Set of Points in the Plane. 1981 ·Herbert Edelsbrunner, David Kirkpatrick, Raimund Seidel	0

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact