(Deterministic) algorithms that compute the volume of polytopes

DOI10.1080/0020739970280105MaRDI QIDQ4360038zbMATH OpenOpenAlexFDO

Authors Mark J. Kaiser

Publication date 25 February 1998

Published in International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0020739970280105

zbMATH Keywords

polytopevolume

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Review text

At first methods for computing the volume of a polytope \(P\) in the Euclidean plane and space are described. By and by the discussion turns from an intuitive point of view to a more algebraic approach. This is the point, where a generalizations to higher dimensions are being offered. The nature of stochastic and deterministic algorithms is introduced. Deterministic methods are explained and illustrated by several examples. General contemplations on intuition and higher dimensions are added.

Cites work

• A geometric inequality and the complexity of computing volume
• A random polynomial-time algorithm for approximating the volume of convex bodies
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
• An analytical expression and an algorithm for the volume of a convex polyhedron in \(R^ n\).
• An approximate method of calculating the volume of a convex polyhedron
• Computing the volume is difficult
• Convex Analysis
• Finding the convex hull facet by facet
• Geometry. I, II. Transl. from the French by M. Cole and S. Levy
• scientific article; zbMATH DE number 446694 (Why is no real title available?)
• scientific article; zbMATH DE number 3141674 (Why is no real title available?)
• scientific article; zbMATH DE number 3168178 (Why is no real title available?)
• scientific article; zbMATH DE number 4022030 (Why is no real title available?)
• scientific article; zbMATH DE number 4061138 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 48230 (Why is no real title available?)
• scientific article; zbMATH DE number 192855 (Why is no real title available?)
• scientific article; zbMATH DE number 1888461 (Why is no real title available?)
• scientific article; zbMATH DE number 781454 (Why is no real title available?)
• scientific article; zbMATH DE number 3302035 (Why is no real title available?)
• On The Complexity of Computing Mixed Volumes
• On the Complexity of Computing the Volume of a Polyhedron
• On the complexity of some basic problems in computational convexity. I. Containment problems
• On the upper-bound conjecture for convex polytopes
• Two Algorithms for Determining Volumes of Convex Polyhedra

Cited in

(8)

• Polytope Volume Computation
• scientific article; zbMATH DE number 4108152 (Why is no real title available?)
• Different Volume Computation Methods of Graph Polytopes
• A complete description of cones and polytopes including hypervolumes of all facets of a polytope
• scientific article; zbMATH DE number 7734127 (Why is no real title available?)
• Linear programming with infinite, finite, and infinitesimal values in the right-hand side
• Algorithmic aspects of alternating sum of volumes. I: Data structure and difference operation
• Polytope volume by descent in the face lattice and applications in social choice

This page was built for publication: (Deterministic) algorithms that compute the volume of polytopes

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