Key points are not available for this paper at this time.
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, P = \ x { {Rⁿ}: Ax b\}. As an illustration we compute a formula for the volume of a projective image of the n-cube. From this formula we deduce that, when A and b have rational entries (so that the volume of P is also a rational number), the number of binary digits in the denominator of the volume cannot be bounded by a polynomial in the total number of digits in the numerators and denominators of entries of A and b. This settles a question posed by Dyer and Frieze.
Jim Lawrence (Sun,) studied this question.