Y by
A (possibly non-convex) planar polygon P is good if no two sides of P are parallel.
For any good polygon P, we may take any three sides of P and extend them into lines. These lines
intersect to form a triangle. Such a triangle is called a peritriangle of P. Let f(P) denote the minimal
number of peritriangles of P whose union completely cover P.
For each positive integer n, find all possible values of f(P) as P ranges over all good n-gons.
For any good polygon P, we may take any three sides of P and extend them into lines. These lines
intersect to form a triangle. Such a triangle is called a peritriangle of P. Let f(P) denote the minimal
number of peritriangles of P whose union completely cover P.
For each positive integer n, find all possible values of f(P) as P ranges over all good n-gons.