Approximating the volume of convex bodies

DOI10.1007/BF02573960zbMath0772.68095MaRDI QIDQ2368127

Martin Henk, Ulrich. Betke

Publication date: 7 October 1993

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131257

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation by convex sets (52A27)

Related Items

On the reverse isodiametric problem and Dvoretzky-Rogers-type volume bounds, A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids, On greedy heuristics for computing D-efficient saturated subsets, On the isodiametric and isominwidth inequalities for planar bisections, Variations of Minkowski's theorem on successive minima, Minimum-volume enclosing ellipsoids and core sets

Cites Work

• Unnamed Item
• Unnamed Item
• A geometric inequality and the complexity of computing volume
• Adjoints of oriented matroids
• Computing the volume is difficult
• Eulersche Charakteristik, Projektionen und Quermassintegrale. (Euler characteristics, projections and mean cross-sectional measures.)
• Estimating sizes of a convex body by successive diameters and widths
• A random polynomial-time algorithm for approximating the volume of convex bodies