The efficiency of an adaptive algorithm for approximating convex smooth bodies in a two-dimensional case (Q1348539)

The problem of polyhedronic approximation of convex sets given by a supporting function can be met in many domains of applied mathematics, for example, by constructing achievable sets for differential inclusions and in the problem of support of admission of solutions. A nonimproved asymptotic upper estimate of efficiency on an adaptive algorithm of approximation for two-dimensional convex compact bodies by polygons is obtained.