Circumscribed polygons of small area (Q1016530): Difference between revisions

Let \(C_n(K)\) denote an \(n\)-gon of minimum area circumscribing a plane convex region \(K\). The paper deals with the problem of finding \(c_n:= \sup \mathrm{Area}(C_n(K))\) for a given \(n\geq 3\) when \(K\) ranges over all convex domains of unit area. The author gives a nice proof of the following main theorem: For every plane strictly convex region \(K\) there exists an inscribed \(2n\)-gon \(Q\) and a circumscribed \(n\)-gon \(P\) such that \(\mathrm{Area}(P)/\mathrm{Area}(Q) \leq \sec \frac{\pi}{n}\). That provides a new upper bound for \(c_n\): \(c_n\leq \sec \frac{\pi}{n}\), which improves an upper bound of \textit{G. D. Chakerian} [Elem. Math. 28, 108--111 (1973; Zbl 0262.52007)] for every \(n\geq 5\).