scientific article; zbMATH DE number 1320218
The algorithm of approaching polyhedra (AAP), as the algorithm of the approximation of convex compact bodies by polyhedra, is intended for the solution of the following problem. Consider the Euclidean space \(\mathbb R^m\) with scalar product \(\langle\cdot,\cdot\rangle\), norm \(\|\cdot\|\) and distance \((\cdot,\cdot).\) Each convex compact body \(C\subset \mathbb R^m\) is given by the support function \(\rho(u|C)= \max \{\langle u,y\rangle:y\in C\},\) defined on the unit sphere of directions \(S^{m-1}=\{u\in \mathbb R^m: \|u\|=1\}.\) For each convex compact body, it is necessary to construct the sequence of convex solid polyhedra \(P^k\subset\mathbb R^m\) such that \(\lim_{k\to\infty}\delta(P^k,C)=0\), where \(\delta(\cdot,\cdot)\) is the Hausdorff metric. The objective of this booklet is 1) to obtain the degree of convergence and constants describing degree of convergence of AAP with respect to the number of vertices of the approximating polyhedron and to study the dependence of the convergence degree of AAP on the characteristic of the approximated body called approximability; 2) to study the efficiency of AAP on iterations; 3) to compare AAP and the algorithm of estimate correction from the point of view of numbers of vertices of the approximating polyhedron necessary for achievement of some approximation accuracy. It is proved that the approximating polyhedra, received on the scheme of AAP, do not yield on approximation accuracy to the polyhedra, with the same number of vertices, constructed on the scheme of the above-mentioned algorithm. As approximated bodies, the ellipsoids from the spaces \(\mathbb R^3\) and \(\mathbb R^4\) are chosen. In general, 250 ellipsoids, 200 in the space \(\mathbb R^3\) and 50 in the space \(\mathbb R^4,\) are considered.
- Analysis of a new method for approximation of convex compact bodies by polyhedra
- Numerical analysis of the efficiency of an algorithm for approximating convex bodies by polyhedra
- The efficiency of Hausdorff algorithms for approximating convex bodies by polytopes
- Analysis of an algorithm for approximating convex bodies
- Approximate convex decomposition of polyhedra and its applications
- A class of adaptive algorithms for approximating convex bodies by polyhedra
- Polyhedral approximation of convex compact bodies by filling methods
- Thrifty approximations of convex bodies by polytopes
- scientific article; zbMATH DE number 4216876
- scientific article; zbMATH DE number 4120902
- Simultaneous inner and outer approximation of shapes
- Complexity of methods for approximating convex compact bodies by double description polytopes and complexity bounds for a hyperball
- Approximation of convex sets by polytopes
- scientific article; zbMATH DE number 480235 (Why is no real title available?)
- Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids
- Polyhedral approximations of strictly convex compacta
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4256863)