摘要

An acute triangulation of a polygon Gamma is a triangulation of Gamma into acute triangles. Let f(Gamma) denote the minimum number of triangles necessary for an acute triangulation of Gamma. We prove that the maximum value of f(Q) for all convex quadrilaterals Q is equal to 8. This solves a problem raised by Maehara (2001) in [4].

  • 出版日期2012-5