Abstract
In this paper we present upper bounds for the number of triangles in a triangulation of an n-gon, imposing the condition that all triangles used are non-obtuse, or just acute. This is based on work by Bern et al. and Maehara, and strengthens their results.
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Yuan, L. Acute Triangulations of Polygons. Discrete Comput Geom 34, 697–706 (2005). https://doi.org/10.1007/s00454-005-1188-9
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-005-1188-9