## Linear-size nonobtuse triangulation of polygons (1994)

Venue: | DISCRETE & COMPUTATIONAL GEOMETRY |

Citations: | 45 - 8 self |

### BibTeX

@INPROCEEDINGS{Bern94linear-sizenonobtuse,

author = {Marshall Bern and Scott Mitchell and Jim Ruppert},

title = {Linear-size nonobtuse triangulation of polygons},

booktitle = {DISCRETE & COMPUTATIONAL GEOMETRY},

year = {1994},

pages = {221--230},

publisher = {}

}

### Years of Citing Articles

### OpenURL

### Abstract

We give an algorithm for triangulating n-vertex polygonal regions (with holes) so that no angle in the nal triangulation measures more than pi/2. The number of triangles in the triangulation is only O(n), improving a previous bound of O(n²), and the worst-case running time is O(n log² n). The basic technique used in the algorithm, recursive subdivision by disks, is new and may have wider application in mesh generation. We also report on an implementation of our algorithm.