How to compute the volume in low dimension?
By: Arjan Cornelissen, Simon Apers, Sander Gribling
Potential Business Impact:
Measures tricky shapes faster with new math.
Estimating the volume of a convex body is a canonical problem in theoretical computer science. Its study has led to major advances in randomized algorithms, Markov chain theory, and computational geometry. In particular, determining the query complexity of volume estimation to a membership oracle has been a longstanding open question. Most of the previous work focuses on the high-dimensional limit. In this work, we tightly characterize the deterministic, randomized and quantum query complexity of this problem in the high-precision limit, i.e., when the dimension is constant.
Similar Papers
Approximating mixed volumes to arbitrary accuracy
Computational Geometry
Calculates complex shapes' volumes faster.
Deterministically approximating the volume of a Kostka polytope
Combinatorics
Calculates how much space complex shapes take up.
Computing High-dimensional Confidence Sets for Arbitrary Distributions
Data Structures and Algorithms
Finds best shapes to cover data points.