Exact Volume Computation for Polytopes: A Practical Study
We study several known volume computation algorithms for convex d-polytopes by classifying them into two classes, triangulation methods and signed-decomposition methods. By incorporating the detection of simplicial faces and a storing/reusing scheme for face volumes we propose practical and theoretical improvements for two of the algorithms. Finally we present a hybrid method combining advantages from the two algorithmic classes. The behaviour of the algorithms is theoretically analysed for hypercubes and practically tested on a wide range of polytopes, where the new hybrid method proves to be superior.
KeywordsDelaunay Triangulation Volume Computation Signed Decomposition Triangulation Method Recursive Scheme
Unable to display preview. Download preview PDF.
- H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, 1987.Google Scholar
- ] K. Fukuda and A. Prodon. Double description method revisited. In M. Deza, R. Euler, and I. Manoussakis, editorsCombinatorics and Computer Sciencevolume 1120 of Lecture Notes in Computer Sciencepages 91–111. Springer-Verlag, 1996.Google Scholar
- P. Gritzmann and V. Klee. On the complexity of some basic problems in computational convexity: II. Volume and mixed volumes. In T. Bisztriczky, P. McMullen, R. Schneider, and A.I. Weiss, editorsPolytopes: Abstract convex and computational (Scarborough ON 1993)NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., 440, pages 373–466. Kluwer Acad. Publ., Dordrecht, 1994.Google Scholar
- J. B. Lasserre. Integration on a convex polytope. Technical Report 96173, Centre National de la Recherche Scientifique, Laboratoire d’Analyse et d’Architectures des Systems, Toulouse, 1996.Google Scholar