Algorithms in combinatorial geometry H Edelsbrunner Springer Science & Business Media, 1987 | 3636 | 1987 |

Three-dimensional alpha shapes H Edelsbrunner, EP Mücke ACM Transactions On Graphics (TOG) 13 (1), 43-72, 1994 | 3337 | 1994 |

Computational topology: an introduction H Edelsbrunner, JL Harer American Mathematical Society, 2022 | 3029 | 2022 |

Topological persistence and simplification Edelsbrunner, Letscher, Zomorodian Discrete & Computational Geometry 28, 511-533, 2002 | 2786 | 2002 |

On the shape of a set of points in the plane H Edelsbrunner, D Kirkpatrick, R Seidel IEEE Transactions on information theory 29 (4), 551-559, 1983 | 2084 | 1983 |

Stability of persistence diagrams D Cohen-Steiner, H Edelsbrunner, J Harer Proceedings of the twenty-first annual symposium on Computational geometry …, 2005 | 1707 | 2005 |

Anatomy of protein pockets and cavities: measurement of binding site geometry and implications for ligand design J Liang, C Woodward, H Edelsbrunner Protein science 7 (9), 1884-1897, 1998 | 1262 | 1998 |

Persistent homology-a survey H Edelsbrunner, J Harer Contemporary mathematics 453 (26), 257-282, 2008 | 1255 | 2008 |

Efficient algorithms for agglomerative hierarchical clustering methods WHE Day, H Edelsbrunner Journal of classification 1, 7-24, 1984 | 1194 | 1984 |

Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms H Edelsbrunner, EP Mücke ACM Transactions on Graphics (tog) 9 (1), 66-104, 1990 | 1098 | 1990 |

Geometry and topology for mesh generation H Edelsbrunner Cambridge University Press, 2001 | 946 | 2001 |

Constructing arrangements of lines and hyperplanes with applications H Edelsbrunner, J O’Rourke, R Seidel SIAM Journal on Computing 15 (2), 341-363, 1986 | 655 | 1986 |

Optimal point location in a monotone subdivision H Edelsbrunner, LJ Guibas, J Stolfi SIAM Journal on Computing 15 (2), 317-340, 1986 | 641 | 1986 |

Incremental topological flipping works for regular triangulations H Edelsbrunner, NR Shah Proceedings of the Eighth Annual Symposium on Computational Geometry, 43-52, 1992 | 618 | 1992 |

The union of balls and its dual shape H Edelsbrunner Proceedings of the ninth annual symposium on Computational geometry, 218-231, 1993 | 569 | 1993 |

Voronoi diagrams and arrangements H Edelsbrunner, R Seidel Proceedings of the first annual symposium on Computational geometry, 251-262, 1985 | 523 | 1985 |

An optimal algorithm for intersecting line segments in the plane B Chazelle, H Edelsbrunner Journal of the ACM (JACM) 39 (1), 1-54, 1992 | 501 | 1992 |

Topologically sweeping an arrangement H Edelsbrunner, LJ Guibas Proceedings of the eighteenth annual ACM symposium on Theory of computing …, 1986 | 493 | 1986 |

Analytical shape computation of macromolecules: I. Molecular area and volume through alpha shape J Liang, H Edelsbrunner, P Fu, PV Sudhakar, S Subramaniam Proteins: Structure, Function, and Bioinformatics 33 (1), 1-17, 1998 | 448 | 1998 |

Combinatorial complexity bounds for arrangements of curves and spheres KL Clarkson, H Edelsbrunner, LJ Guibas, M Sharir, E Welzl Discrete & Computational Geometry 5 (2), 99-160, 1990 | 437 | 1990 |