Approximating the volume of convex bodies

DOI10.1007/BF02573960MaRDI QIDQ2368127zbMATH OpenFDO

Authors 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) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Approximation by convex sets (52A27)

Recommendations

• Computing the volume is difficult
• Random walks and anO*(n5) volume algorithm for convex bodies
• How to compute the volume in high dimension?
• Random walks in a convex body and an improved volume algorithm
• A geometric inequality and the complexity of computing volume

Cites work

• scientific article; zbMATH DE number 18983 (Why is no real title available?)
• scientific article; zbMATH DE number 3516928 (Why is no real title available?)
• A geometric inequality and the complexity of computing volume
• A random polynomial-time algorithm for approximating the volume of convex bodies
• Adjoints of oriented matroids
• Computing the volume is difficult
• Estimating sizes of a convex body by successive diameters and widths
• Eulersche Charakteristik, Projektionen und Quermassintegrale. (Euler characteristics, projections and mean cross-sectional measures.)

Cited in

(30)

• On the isodiametric and isominwidth inequalities for planar bisections
• Variations of Minkowski's theorem on successive minima
• Deterministic and randomized polynomial‐time approximation of radii
• A polynomial number of random points does not determine the volume of a convex body
• Deterministic and stochastic methods for computing volumetric moduli of convex cones
• Computational results of an \(O^{\ast }(n^{4})\) volume algorithm
• A parallel implementation of an O^(n^4) volume algorithm
• A geometric inequality and the complexity of computing volume
• Minimum-volume enclosing ellipsoids and core sets
• scientific article; zbMATH DE number 5630348 (Why is no real title available?)
• Thin partitions, isoperimetric inequalities and a sampling algorithm for star shaped bodies
• On a method of volume calculation for bodies
• On the reverse isodiametric problem and Dvoretzky-Rogers-type volume bounds
• A quick estimate for the volume of a polyhedron
• Approximating the volume of unions and intersections of high-dimensional geometric objects
• How to compute the volume in high dimension?
• Near-optimal deterministic algorithms for volume computation via M-ellipsoids
• Estimating the volumes of the cones in a Gröbner fan
• Volume estimates for sections of certain convex bodies
• Faster deterministic volume estimation in the oracle model via thin lattice coverings
• How to Approximate the Volume of a Lake
• A Consistent Analytical Formulation for Volume Estimation of Geometries Enclosed by Implicitly Defined Surfaces
• Approximation and convergence of the intrinsic volume
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids
• A Fast and Practical Method to Estimate Volumes of Convex Polytopes
• Characterizing volume via cone duality
• Heat flow and a faster algorithm to compute the surface area of a convex body
• On greedy heuristics for computing D-efficient saturated subsets
• scientific article; zbMATH DE number 1538128 (Why is no real title available?)

This page was built for publication: Approximating the volume of convex bodies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368127)