Analysis of an algorithm for approximating convex bodies
From MaRDI portal
Publication:1842370
zbMath0820.65100MaRDI QIDQ1842370
Publication date: 15 May 1995
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
convergencepolytopesefficiencyadaptive algorithmconvex compact bodiespolyhedral approximationprojections of polyhedral sets
Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items (7)
Convergence of Hausdorff approximation methods for the Edgeworth-Pareto hull of a compact set ⋮ Efficiency of the estimate refinement method for polyhedral approximation of multidimensional balls ⋮ Constrained optimization using multiple objective programming ⋮ On the approximation of unbounded convex sets by polyhedra ⋮ Asymptotic properties of the estimate refinement method in polyhedral approximation of multidimensional balls ⋮ Complexity of methods for approximating convex compact bodies by double description polytopes and complexity bounds for a hyperball ⋮ Optimality of the Methods for Approximating the Feasible Criterion Set in the Convex Case
This page was built for publication: Analysis of an algorithm for approximating convex bodies
