Complexity of methods for approximating convex compact bodies by double description polytopes and complexity bounds for a hyperball
DOI10.1134/S0965542519070066zbMath1433.52006OpenAlexW2967470288MaRDI QIDQ2278205
Publication date: 4 December 2019
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0965542519070066
estimate refinement methodmultidimensional ballcomplexity bound for methodcovering of multidimensional unit spheredouble description polytopepolyhedral approximation of convex bodies
Analysis of algorithms and problem complexity (68Q25) Complexity and performance of numerical algorithms (65Y20) Approximation by convex sets (52A27)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic properties of the estimate refinement method in polyhedral approximation of multidimensional balls
- Polyhedral approximation of smooth convex bodies
- Zur optimalen Approximation konvexer Hyperflächen durch Polyeder
- A class of adaptive algorithms for approximating convex bodies by polyhedra
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Primal-dual methods for vertex and facet enumeration
- An optimal convex hull algorithm in any fixed dimension
- How good are convex hull algorithms?
- Construction of suboptimal coverings of the multidimensional unit sphere
- Construction of the convex hull of a point set as a system of linear inequalities
- Analysis of an algorithm for approximating convex bodies
- 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
- Nonadaptive methods for polyhedral approximation of the Edgeworth—Pareto hull using suboptimal coverings on the direction sphere
- Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality
- Über homogene lineare Ungleichungssysteme
- Methods and algorithms for analyzing linear systems, by constructing generalized sets of attainability
- An algorithm for analyzing the independence of inequalities in a linear system
- The quickhull algorithm for convex hulls
- An Algorithm for Convex Polytopes
- Generating all vertices of a polyhedron is hard
This page was built for publication: Complexity of methods for approximating convex compact bodies by double description polytopes and complexity bounds for a hyperball
