partitioning a convex n-gon into triangles (ILL 1982 - P43)
Source:
May 16, 2011
Problem Statement
(a) What is the maximal number of acute angles in a convex polygon?(b) Consider points in the interior of a convex -gon. The -gon is partitioned into triangles whose vertices are among the given points (the vertices of the -gon and the given points). Each of the points in the interior is a vertex of at least one triangle. Find the number of triangles obtained.