Exact Volume Computation for Polytopes: A Practical Study
- 1 January 2000
- book chapter
- other
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Incremental Convex Hull Algorithms Are Not Output SensitiveDiscrete & Computational Geometry, 1999
- Primal—Dual Methods for Vertex and Facet EnumerationDiscrete & Computational Geometry, 1998
- Random walks and anO*(n5) volume algorithm for convex bodiesRandom Structures & Algorithms, 1997
- Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedronComputational Geometry, 1997
- How good are convex hull algorithms?Computational Geometry, 1997
- Double description method revisitedLecture Notes in Computer Science, 1996
- The volume of duals and sections of polytopesMathematika, 1992
- On the Complexity of Computing the Volume of a PolyhedronSIAM Journal on Computing, 1988
- Algorithms in Combinatorial GeometryPublished by Springer Science and Business Media LLC ,1987
- Two Algorithms for Determining Volumes of Convex PolyhedraJournal of the ACM, 1979