The efficiency of Hausdorff algorithms for approximating convex bodies by polytopes
From MaRDI portal
Publication:1323968
zbMATH Open0804.52003MaRDI QIDQ1323968FDOQ1323968
Authors: G. K. Kamenev
Publication date: 6 July 1994
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Recommendations
- Numerical analysis of the efficiency of an algorithm for approximating convex bodies by polyhedra
- scientific article; zbMATH DE number 2124548
- Efficient algorithms for approximation of nonsmooth convex bodies
- Analysis of an algorithm for approximating convex bodies
- scientific article; zbMATH DE number 2205709
Cited In (13)
- A polyhedral approximation algorithm for recession cones of spectrahedral shadows
- Title not available (Why is that?)
- Optimal growth order of the number of vertices and facets in the class of Hausdorff methods for polyhedral approximation of convex bodies
- Title not available (Why is that?)
- OPTIMIZATION OF THE ALGORITHM FOR DETERMINING THE HAUSDORFF DISTANCE FOR CONVEX POLYGONS
- Hausdorff approximation of convex polygons
- On the approximation of unbounded convex sets by polyhedra
- Title not available (Why is that?)
- Approximation of convex sets by polytopes
- Efficient algorithms for approximation of nonsmooth convex bodies
- Numerical analysis of the efficiency of an algorithm for approximating convex bodies by polyhedra
- The error of polytopal approximation with respect to the symmetric difference metric and the \(L_p\) metric
- Title not available (Why is that?)
This page was built for publication: The efficiency of Hausdorff algorithms for approximating convex bodies by polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1323968)