Algorithms in combinatorial geometry H Edelsbrunner Springer Science & Business Media, 2012 | 3294 | 2012 |

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

Topological persistence and simplification H Edelsbrunner, D Letscher, A Zomorodian Proceedings 41st Annual Symposium on Foundations of Computer Science, 454-463, 2000 | 1670 | 2000 |

Computational topology: an introduction H Edelsbrunner, J Harer American Mathematical Soc., 2010 | 1530 | 2010 |

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 | 1345 | 1983 |

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 | 1088 | 1998 |

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 | 950 | 1990 |

Stability of persistence diagrams D Cohen-Steiner, H Edelsbrunner, J Harer Discrete & Computational Geometry 37 (1), 103-120, 2007 | 913 | 2007 |

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

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

Persistent homology-a survey H Edelsbrunner, J Harer Contemporary mathematics 453, 257-282, 2008 | 657 | 2008 |

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

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

Hierarchical Morse-Smale complexes for piecewise linear 2-manifolds H Edelsbrunner, J Harer, A Zomorodian Discrete and Computational Geometry 30 (1), 87-107, 2003 | 562* | 2003 |

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

Incremental topological flipping works for regular triangulations H Edelsbrunner, NR Shah Algorithmica 15 (3), 223-241, 1996 | 546 | 1996 |

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

Topologically sweeping an arrangement H Edelsbrunner, LJ Guibas Journal of Computer and System Sciences 38 (1), 165-194, 1989 | 431 | 1989 |

Voronoi diagrams and arrangements H Edelsbrunner, R Seidel Discrete & Computational Geometry 1 (1), 25-44, 1986 | 418 | 1986 |

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 | 396 | 1990 |