Polyhedral approximations of strictly convex compacta
classification
🧮 math.FA
math.GNmath.MG
keywords
convexapproximationscompactaestimatesobtainpolyhedralstrictlyalgorithm
read the original abstract
We consider polyhedral approximations of strictly convex compacta in finite dimensional Euclidean spaces (such compacta are also uniformly convex). We obtain the best possible estimates for errors of considered approximations in the Hausdorff metric. We also obtain new estimates of an approximate algorithm for finding the convex hulls.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.