The efficiency of Hausdorff algorithms for approximating convex bodies by polytopes (Q1323968): Difference between revisions

The author studies the efficiency of approximation algorithms for convex compact bodies by polytopes. Results about the lower asymptotic efficiency of the algorithms in Hausdorff and symmetric difference volume metrics are obtained. Let \({\mathcal C}^ 2(p_ 1,p_ 2)\) be the class of bodies of \({\mathcal C}^ 2\), the minimum and maximum radii of curvature of which are not less than \(p_ 1\) or more than \(p_ 2\), respectively \((0 < p_ 1,p_ 2 < \infty)\). The Hausdorff algorithms are found to be optimal by the order of the number of vertices (hyperfaces) of inscribed (circumscribed) polytopes for the class \({\mathcal C}^ 2(p_ 1,p_ 2)\).