@inproceedings{b59c1e19d4f945878af4f33cf7d3fb76,

title = "Triangulating polygons without large angles",

abstract = "We show how to triangulate an n-vertex polygonal region - adding extra vertices as necessary - with triangles of guaranteed quality. Using only O(n) triangles, we can guarantee that the smallest height (shortest dimension) of a triangle is approximately as large as possible. Using O(n log n) triangles, we can also guarantee that the largest angle is no greater than 150°. Finally we give a nonobtuse triangulation algorithm for convex polygons that uses O(n1.85) triangles.",

author = "Marshall Bern and David Dobkin and David Eppstein",

year = "1992",

month = jan,

day = "1",

doi = "10.1145/142675.142722",

language = "English (US)",

isbn = "0897915178",

series = "Eighth Annual Symposium On Computational Geometry",

publisher = "Publ by ACM",

pages = "222--231",

booktitle = "Eighth Annual Symposium On Computational Geometry",

note = "Eighth Annual Symposium On Computational Geometry ; Conference date: 10-06-1992 Through 12-06-1992",

}