A Fast and Practical Method to Estimate Volumes of Convex Polytopes

DOI10.1007/978-3-319-19647-3_6zbMath1407.68509arXiv1401.0120OpenAlexW1592350275MaRDI QIDQ3452552

Cunjing Ge, Feifei Ma

Publication date: 12 November 2015

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Computing and estimating the volume of the solution space of SMT(LA) constraints ⋮ An algorithm for estimating non-convex volumes and other integrals in \(n\) dimensions

Cites Work

• Computational results of an \(O^{\ast }(n^{4})\) volume algorithm
• Geometric algorithms and combinatorial optimization.
• Hit-and-run mixes fast
• Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
• Hit-and-run algorithms for the identification of nonredundant linear inequalities
• Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
• Volume Computation Using a Direct Monte Carlo Method
• On the Complexity of Computing the Volume of a Polyhedron
• Modifications and implementation of the ellipsoid algorithm for linear programming
• Random walks and anO*(n5) volume algorithm for convex bodies
• Hit-and-Run Algorithms for Generating Multivariate Distributions
• Unnamed Item
• Unnamed Item

This page was built for publication: A Fast and Practical Method to Estimate Volumes of Convex Polytopes