Polynomial-Size Nonobtuse Triangulation of Polygons

@inproceedings{Bern1991PolynomialSizeNT,
title={Polynomial-Size Nonobtuse Triangulation of Polygons},
author={Marshall W. Bern and David Eppstein},
booktitle={Symposium on Computational Geometry},
year={1991}
}

We describe methods for triangulating polygonal regions of the plane so that no triangle has a large angle. Our main result is that a polygon with n sides can be triangulated with O(n2) nonobtuse triangles. We also show that a convex polygon can be triangulated with O(n2) right trianglea. Finally we show that any trian gulation (without Steiner points) of a simple polygon haa a refinement with 0(n4) nonobtuse triangles.