Polytope Volume Computation
Open Access
- 1 July 1991
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 57 (195) , 259-271
- https://doi.org/10.2307/2938672
Abstract
A combinatorial form of Gram's relation for convex polytopes can be adapted for use in computing polytope volume. We present an algorithm for volume computation based on this observation. This algorithm is useful in finding the volume of a polytope given as the solution set of a system of linear inequalities, <!-- MATH $P = \{ x \in {\mathbb{R}^n}:Ax \leq b\}$ --> .
Keywords
This publication has 21 references indexed in Scilit:
- Valuations and polarityDiscrete & Computational Geometry, 1988
- On the Complexity of Computing the Volume of a PolyhedronSIAM Journal on Computing, 1988
- A geometric inequality and the complexity of computing volumeDiscrete & Computational Geometry, 1986
- Computing Volumes of PolyhedraMathematics of Computation, 1986
- The Complexity of Vertex Enumeration MethodsMathematics of Operations Research, 1983
- An analytical expression and an algorithm for the volume of a convex polyhedron inR nJournal of Optimization Theory and Applications, 1983
- Two Algorithms for Determining Volumes of Convex PolyhedraJournal of the ACM, 1979
- Spline Notation Applied to a Volume ProblemThe American Mathematical Monthly, 1979
- CONVEXITYJournal of the London Mathematical Society, 1966
- An Algorithm for Finding All Vertices of Convex Polyhedral SetsJournal of the Society for Industrial and Applied Mathematics, 1961