Numerical analysis of the efficiency of an algorithm for approximating convex bodies by polyhedra
zbMATH Open0779.65098MaRDI QIDQ1803476FDOQ1803476
Authors: S. M. Dzholdybaeva, G. K. Kamenev 
Publication date: 29 June 1993
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Recommendations
asymptotic efficiencyHausdorff metricadaptive algorithmapproximation of a convex body by a polyhedron
Computational aspects related to convexity (52B55) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Approximation by convex sets (52A27) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cited In (15)
- Title not available (Why is that?)
- A node elimination algorithm for cubature of high-dimensional polytopes
- A Convergence Analysis of Dykstra's Algorithm for Polyhedral Sets
- Title not available (Why is that?)
- Analysis of an algorithm for approximating convex bodies
- Efficiency of the estimate refinement method for polyhedral approximation of multidimensional balls
- Approximation of convex sets by polytopes
- Title not available (Why is that?)
- The efficiency of Hausdorff algorithms for approximating convex bodies by polytopes
- Efficient algorithms for approximation of nonsmooth convex bodies
- Asymptotic properties of the estimate refinement method in polyhedral approximation of multidimensional balls
- Fixpoint Computation in the Polyhedra Abstract Domain Using Convex and Numerical Analysis Tools
- The efficiency of an adaptive algorithm for approximating convex smooth bodies in a two-dimensional case
- Optimal Non-adaptive Approximation of Convex Bodies by Polytopes
- Title not available (Why is that?)
This page was built for publication: Numerical analysis of the efficiency of an algorithm for approximating convex bodies by polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803476)
