Advertisement

Discrete & Computational Geometry

, Volume 34, Issue 4, pp 697–706 | Cite as

Acute Triangulations of Polygons

Article

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.

Keywords

Computational Mathematic Acute Triangulation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer 2005

Authors and Affiliations

  1. 1.College of Mathematics and Information Science, Hebei Normal University, 050016 Shijiazhuang, People's Republic of China and Department of Mathematics, University of Dortmund, 44221 DortmundGermany

Personalised recommendations