Most important publications#

Books:#

• 1. H. Edelsbrunner. Geometry and Topology for Mesh Generation. Cambridge Univ. Press, 2001
• 2. H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Heidelberg, 1987.
  

Journal Publications in Computer Science, Mathematics, and Biology:#

• 1. Cohen-Steiner, H. Edelsbrunner and J. Harer. Stability of persistence diagrams. Discrete Comput. Geom. 37 (2007), 103-120.
• 2. J. Sohn, J. Parks, G. Buhrman, P. Brown, H. Edelsbrunner, K. Kristjansdottir, A. Safi, W. Yang and J. Rudolph. Experimental validation of the docking orientation of Cdc25 with its Cdk2-CycA protein substrate. Biochemistry 44 (2005), 16563-16573.
• 3. Y.-H. A. Ban, H. Edelsbrunner and J. Rudolph. Interface surfaces for protein-protein complexes. J. Assoc. Comput. Mach. 53 (2006), 361-378.
• 4. H. Edelsbrunner, D. Letscher and A. Zomorodian. Topological persistence and simplification. Discrete Comput. Geom. 28 (2002), 511-533.
• 5. S.-W. Cheng, T. K. Dey, H. Edelsbrunner, M. A. Facello and S.-H. Teng. Sliver exudation. J. Assoc. Comput. Mach. 47 (2000), 883-904.
• 6. H. Edelsbrunner. The union of balls and its dual shape. Discrete Comput. Geom. 13 (1995), 415-440.
• 7. H. Edelsbrunner and E. P. Muecke. Three-dimensional alpha shapes. ACM Trans. Graphics 13 (1994), 43-72.
• 8. B. Chazelle and H. Edelsbrunner. An optimal algorithm for intersecting line segments in the plane. J. Assoc. Comput. Mach. 39 (1992), 1-54.
• 9. H. Edelsbrunner and E. P. Muecke. Simulation of Simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graphics 9 (1990), 66-104.
• 10. H. Edelsbrunner and L. J. Guibas. Topoligcally sweeping an arrangement. J. Comput. Systems Sci. 38 (1989), 165-194.