(Deterministic) algorithms that compute the volume of polytopes

DOI10.1080/0020739970280105zbMath0908.68182OpenAlexW2081037862MaRDI QIDQ4360038

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

volumepolytope

Mathematics Subject Classification ID

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

Cites Work

• A geometric inequality and the complexity of computing volume
• Computing the volume is difficult
• An analytical expression and an algorithm for the volume of a convex polyhedron in \(R^ n\).
• On the complexity of some basic problems in computational convexity. I. Containment problems
• On the upper-bound conjecture for convex polytopes
• Finding the convex hull facet by facet
• On the Complexity of Computing the Volume of a Polyhedron
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• Two Algorithms for Determining Volumes of Convex Polyhedra
• A random polynomial-time algorithm for approximating the volume of convex bodies
• On The Complexity of Computing Mixed Volumes
• An approximate method of calculating the volume of a convex polyhedron
• Convex Analysis
• An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
• Geometry. I, II. Transl. from the French by M. Cole and S. Levy
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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