On Acute Triangulations of Quadrilaterals

  • Hiroshi Maehara
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2098)


An acute triangulation of a polygon Γ is a triangulation of Γ into acute triangles. Let f(Γ) denote the minimum number of triangles necessary for an acute triangulation of G, and let f(n) denote the the maximum value of f(Γ) for all n-gons G. We prove f(4) = 10.


Problem Complexity Computer Graphic Algorithm Analysis Discrete Mathematic Acute Triangle 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    B. S. Baker, E. Grosse and C. S. Rafferty, Nonobtuse triangulations of polygons, Discrete Comput. Geom. 3 (1988) 147–168.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    M. Bern, S. Mitchell and J. Ruppert, Linear-size nonobtuse triangulation of polygons, Discrete Comput. Geom. 14 (1995) 411–428.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Charles Cassidy and Graham Lord, A square acutely triangulated, J. Rec. Math., 13(1980/81) 263–268.MathSciNetGoogle Scholar
  4. 4.
    Martin Gardner, New Mathematical Diversions, Mathematical Association of America, Washington, D.C., 1995.zbMATHGoogle Scholar
  5. 5.
    H. Maehara, Acute triangulations of polygons, submitted.Google Scholar
  6. 6.
    Wallace Manheimer, Solution to Problem E1406: Dissecting an obtuse triangle into acute triangles, American Mathematical Monthly, 67 (1960) 923.MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Hiroshi Maehara
    • 1
  1. 1.Ryukyu UniversityNishihara, OkinawaJapan

Personalised recommendations