Triangulations in the Plane

• H. Edelsbrunner and R. Waupotitsch. A combinatorial approach to cartograms. J. Comput. Geom. Theory Appl. 7 (1997), 343-360. pdf-file
• B. Chazelle, H. Edelsbrunner, M. Grigni, L. J. Guibas, J. E. Hershberger, M. Sharir and J. Snoeyink. Ray shooting in polygons using geodesic triangulations. Algorithmica 12 (1994), 54-68. pdf-file
• H. Edelsbrunner and T. S. Tan. An upper bound for conforming Delaunay triangulations. Discrete Comput. Geom. 10 (1993), 197-213. pdf-file
• H. Edelsbrunner and T. S. Tan. A quadratic time algorithm for the minmax length triangulation. SIAM J. Comput. 22 (1993), 527-551. pdf-file
• M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell and T. S. Tan. Edge insertion for optimal triangulations Discrete Comput. Geom. 10 (1993), 47-65. pdf-file
• H. Edelsbrunner, T. S. Tan and R. Waupotitsch. An O(n^2 log n) time algorithm for the minmax angle triangulation. SIAM J. Sci. Stat. Comput. 13 (1992), 994-1008. pdf-file

Triangulated Surfaces

• D. Attali, H. Edelsbrunner and Y. Mileyko. Weak witnesses for Delaunay triangulations of submanifolds. In ``Proc. ACM Sympos. Solid Phys. Modeling, 2007'', 143-150. pdf-file
• D. Attali, D. Cohen-Steiner and H. Edelsbrunner. Extraction and simplification of iso-surfaces in tandem. In ``Proc. 3rd Ann. Sympos. Geom. Process., 2005'', 139-148. pdf-file
• H. Edelsbrunner. 180 wrapped tubes. J. Univ. Comput. Sci. 7 (2001), 379-399. pdf-file
• X. Jiao, H. Edelsbrunner and M. T. Heath. Mesh association: formulation and algorithms. In ``Proc. 8th Internat. Meshing Roundtable, 1999'', South Lake Tahoe, California, 75-82. pdf-file
• T. K. Dey, H. Edelsbrunner, S. Guha and D. V. Nekhayev. Topology preserving edge contraction. Publ. Inst. Math. (Beograd) (N.S.) 66 (1999), 23-45. pdf-file

Tetrahedrizations and Slivers

• H. Edelsbrunner and D. Guoy. An experimental study of sliver exudation. Engin. with Computers 18 (2002), 229-240. pdf-file
• H. Edelsbrunner and D. Guoy. Sink-insertion for mesh improvement. Internat. J. Found. Comput. Sci. 13 (2002), 223-242. pdf-file
• H. Edelsbrunner, X.-Y. Li, G. Miller, A. Stathopoulos, D. Talmor, S.-H. Teng, A. Ungor and N. Walkington. Smoothing and cleaning up slivers. In ``Proc. 32nd ACM Sympos. Theory Comput. 2000'', 273-277. pdf-file
• 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. pdf-file
• B. Chazelle, H. Edelsbrunner, L. J. Guibas, J. E. Hershberger, R. Seidel and M. Sharir. Selecting heavily covered points. SIAM J. Comput. 23 (1994), 1138-1151. pdf-file
• H. Edelsbrunner, F. P. Preparata and D. B. West. Tetrahedrizing point sets in three dimensions J. Symbolic Comput. 10 (1990), 335-347. pdf-file
• H. Edelsbrunner. Spatial triangulations with dihedral angle conditions. In ``Proc. Internat. Workshop Discrete Algorithms and Complexity, 1989'', 83-89, Fukuoka, Japan. pdf-file

Beyond Three Dimensions

• D. Attali, H. Edelsbrunner, J. Harer and Y. Mileyko. Alpha-beta witness complexes. In ``Proc. 10th Workshop Algor. Data Struct., 2007'', Springer LNCS 4619, 386-397. pdf-file
• H. Edelsbrunner and D. R. Grayson. Edgewise subdivision of a simplex. Discrete Comput. Geom. 24 (2000), 707-719. pdf-file
• H. Edelsbrunner and R. Waupotitsch. Adaptive simplicial grids from cross-sections of monotone complexes. Computational Geometry: Theory and Applications 10 (2000), 267-284. pdf-file
• H. Edelsbrunner and N. R. Shah. Incremental topological flipping works for regular triangulations. Algorithmica 15 (1996), 223-241. pdf-file
• H. Edelsbrunner. An acyclicity theorem for cell complexes in d dimensions. Combinatorica 10 (1990), 251-260. pdf-file