On Acute Triangulations of Quadrilaterals

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 ?, and let f(n) denote the maximum value of f(?) for all n-gons ?. We prove f(4) = 10.

[1]  Brenda S. Baker,et al.  Nonobtuse triangulation of polygons , 1988, Discret. Comput. Geom..

[2]  Marshall W. Bern,et al.  Linear-size nonobtuse triangulation of polygons , 1995, Discret. Comput. Geom..

[3]  Martin Gardner,et al.  New Mathematical Diversions , 1966 .