Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality

DOI10.1134/S0965542514080053zbMath1313.51011MaRDI QIDQ2940517

Georgy K. Kamenev

Publication date: 26 January 2015

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

\(f\)-vectorpolyhedral approximationconvex bodiesspherical codesmultidimensional balldeep holes methodhyperfacescovering and packing on the spherefacet structure cardinalitypacking of balls into ballvertices of the polytope

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Polyhedra and polytopes; regular figures, division of spaces (51M20) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (7)

Efficiency of the estimate refinement method for polyhedral approximation of multidimensional balls ⋮ Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics ⋮ Finding sets of solutions to systems of nonlinear inequalities ⋮ Asymptotic properties of the estimate refinement method in polyhedral approximation of multidimensional balls ⋮ Optimal Non-adaptive Approximation of Convex Bodies by Polytopes ⋮ Approximating a solution set of nonlinear inequalities ⋮ Complexity of methods for approximating convex compact bodies by double description polytopes and complexity bounds for a hyperball

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Properties of a method for polyhedral approximation of the feasible criterion set in convex multiobjective problems
• Zur optimalen Approximation konvexer Hyperflächen durch Polyeder
• A class of adaptive algorithms for approximating convex bodies by polyhedra
• Dense packings of congruent circles in a circle
• Approximation of completely bounded sets by the deep holes method.
• Construction of suboptimal coverings of the multidimensional unit sphere
• Interactive decision maps. Approximation and visualization of Pareto frontier
• The upper bound theorem for polytopes: An easy proof of its asymptotic version
• Polytopal approximation bounding the number of \(k\)-faces
• Approximating \(3\)-dimensional convex bodies by polytopes with a restricted number of edges
• Iterative method for constructing coverings of the multidimensional unit sphere
• Optimal growth order of the number of vertices and facets in the class of Hausdorff methods for polyhedral approximation of convex bodies
• Lectures on Polytopes
• Convex Polytopes
• The maximum numbers of faces of a convex polytope

This page was built for publication: Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality