Approximation of convex discs by polygons

Convex sets in (2) dimensions (including convex curves) (52A10) Inequalities and extremum problems involving convexity in convex geometry (52A40) Polytopes and polyhedra (52Bxx)

Review text

For \(a>0\), \(p>0\), \(p^ 2/a\geq 4\pi\) let \b{C}(a,p) be the class of all convex discs in the Euclidean plane with area at least a and perimeters at most p. Let \b{P}\({}_ k\) be the class of all convex polygons having at most k vertices. For convex discs C,D let \(\delta^ A(C,D)\) denote the area of the symmetric difference of C and D. Let \(p^ 2/4\pi a<t\). Through elaborate arguments and calculations the author arrives at a complete description of the convex discs \(C\in \underline C(a,p)\) and the convex polygons \(P\in \underline P_ k\) for which \(\delta^ A(C,D)\) attains its minimum. In his proof the author makes use of results of Besicovitch, Eggleston, Fejes Tóth and himself.

Recommendations

Cites work

Cited in

(29)

This page was built for publication: Approximation of convex discs by polygons

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