An upper bound for conforming Delaunay triangulations

Herbert Edelsbrunner and Tiow-Seng Tan
Discrete & Computational Geometry 10:197–213, 1993
Proc. 8th Symp. Computational Geometry, ACM, Jun 1992, pp. 53–62
http://www.iscs.nus.sg/~tants/Paper/cdt.ps.gz

Cites:

• Provably good mesh generation
• Polynomial-size non-obtuse triangulation of polygons
• Triangulating polygons without large angles