The efficiency of Hausdorff algorithms for approximating convex bodies by polytopes (Q1323968): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
(2 intermediate revisions by one other user not shown) | |||
Property / author | |||
Property / author: Georgy K. Kamenev / rank | |||
Property / reviewed by | |||
Property / reviewed by: Hans-Dietrich Hecker / rank | |||
Property / author | |||
Property / author: Georgy K. Kamenev / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Hans-Dietrich Hecker / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Latest revision as of 03:56, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The efficiency of Hausdorff algorithms for approximating convex bodies by polytopes |
scientific article |
Statements
The efficiency of Hausdorff algorithms for approximating convex bodies by polytopes (English)
0 references
6 July 1994
0 references
The author studies the efficiency of approximation algorithms for convex compact bodies by polytopes. Results about the lower asymptotic efficiency of the algorithms in Hausdorff and symmetric difference volume metrics are obtained. Let \({\mathcal C}^ 2(p_ 1,p_ 2)\) be the class of bodies of \({\mathcal C}^ 2\), the minimum and maximum radii of curvature of which are not less than \(p_ 1\) or more than \(p_ 2\), respectively \((0 < p_ 1,p_ 2 < \infty)\). The Hausdorff algorithms are found to be optimal by the order of the number of vertices (hyperfaces) of inscribed (circumscribed) polytopes for the class \({\mathcal C}^ 2(p_ 1,p_ 2)\).
0 references
efficiency
0 references
approximation algorithms
0 references
polytopes
0 references
Hausdorff algorithms
0 references