@article{Bern1994LinearSizeNT,
title={Linear-Size Nonobtuse Triangulation of Polygons},
author={Marshall W. Bern and Scott A. Mitchell and Jim Ruppert},
journal={Discrete & Computational Geometry},
year={1994},
volume={14},
pages={411-428}
}

We give an algorithm for triangulating <italic>n</italic>-vertex polygonal regions (with holes) so that no angle in the final triangulation measures more than π/2. The number of triangles in the triangulation is only <italic>O(n)</italic>, improving a previous bound of <italic>O</italic>(<italic>n</italic><supscrpt>2</supscrpt>), and the worst-case running time is <italic>O</italic>(<italic>n</italic>log<supscrpt>2</supscrpt><italic>n</italic>). The basic technique used in the algorithm… CONTINUE READING