Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
415656 | Computational Geometry | 2013 | 21 Pages |
Abstract
We are interested in the fast computation of the exact value of integrals of polynomial functions over convex polyhedra. We present speed-ups and extensions of the algorithms presented in previous work by some of the authors. We provide a new software implementation and benchmark computations. The computation of integrals of polynomials over polyhedral regions has many applications; here we demonstrate our algorithmic tools solving a challenge from combinatorial voting theory.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
J.A. De Loera, B. Dutra, M. Köppe, S. Moreinis, G. Pinto, J. Wu,