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.
CITATION STYLE
Büeler, B., Enge, A., & Fukuda, K. (2000). Exact Volume Computation for Polytopes: A Practical Study. In Polytopes — Combinatorics and Computation (pp. 131–154). Birkhäuser Basel. https://doi.org/10.1007/978-3-0348-8438-9_6
Mendeley helps you to discover research relevant for your work.