Efficient Random-Walk Methods for Approximating Polytope Volume

DOI10.1145/2582112.2582133zbMath1395.68300arXiv1312.2873OpenAlexW2036015370WikidataQ57908671 ScholiaQ57908671MaRDI QIDQ4635556

Ioannis Z. Emiris, Vissarion Fisikopoulos

Publication date: 23 April 2018

Published in: Proceedings of the thirtieth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.2873

zbMATH Keywords

softwarerandom walkvolume approximationalgorithm engineeringgeneral dimensionpolytope oracleBirkhoff polytopes

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (6)

A practical volume algorithm ⋮ Computing mixed volume and all mixed cells in quermassintegral time ⋮ Convergence of Gibbs sampling: coordinate hit-and-run mixes fast ⋮ VolEsti ⋮ Pruning Algorithms for Pretropisms of Newton Polytopes ⋮ Honey from the Hives: A Theoretical and Computational Exploration of Combinatorial Hives

Uses Software

• CGAL
• Matlab
• Boost C++ Libraries
• Eigen
• ANN
• FLANN
• Vinci

This page was built for publication: Efficient Random-Walk Methods for Approximating Polytope Volume