Optimal Non-adaptive Approximation of Convex Bodies by Polytopes

DOI10.1007/978-3-030-23436-2_11zbMath1442.52005arXiv1810.12098OpenAlexW2898098839MaRDI QIDQ5114895

Georgy K. Kamenev

Publication date: 29 June 2020

Published in: Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.12098

zbMATH Keywords

approximation of convex bodies by polytopesoptimal non-adaptive algorithms

Mathematics Subject Classification ID

Approximation by convex sets (52A27) Numerical approximation and computational geometry (primarily algorithms) (65D99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Construction of suboptimal coverings of the multidimensional unit sphere
• Numerical analysis of the efficiency of an algorithm for approximating convex bodies by polyhedra
• Interactive decision maps. Approximation and visualization of Pareto frontier
• Metric entropy of some classes of sets with differentiable boundaries
• Approximation of convex sets by polytopes
• Iterative method for constructing coverings of the multidimensional unit sphere
• Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality
• Efficient algorithms for approximation of nonsmooth convex bodies

This page was built for publication: Optimal Non-adaptive Approximation of Convex Bodies by Polytopes