Minimal convex \(k\)-gons containing a given convex polygon (Q5941863)

The author proves the following statement: Among all convex \(k\)-gons containing a fixed convex \(n\)-gon \(P\subset E^2\), \(n>k\geq 3\), there exists a \(k\)-gon \(Q\) of minimal area such that at least \(k-1\) sides of \(Q\) contain sides of \(P\). Furthermore, the midpoint of every side of \(Q\) belongs to \(P\). If \(q\) is a (possibly unique) side of \(Q\) containing no side of \(P\), then the midpoint of \(q\) is a vertex of \(P\). Moreover, for \(k\geq 4\) the polygon \(Q\) has a side \(q\) such that the sum of the interior angles at its endpoints is larger than \(\pi\). And each of these sides \(q\) necessarily contains a side \(\overline q\) of \(P\), where the relative inferior of \(\overline q\) contains the midpoint of \(q\).