Circumscribed polygons of small area

Convex sets in (2) dimensions (including convex curves) (52A10) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Review text

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\).

Recommendations

Cites work

Cited in

(14)

This page was built for publication: Circumscribed polygons of small area

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1016530)