ACM communications in computer algebra · 2012 · 23 citations · 22 references
ComputingComputer ScienceComputational GeometryComputational AlgebraGeometric ApproximationGeometry ProcessingIntegral GeometryNumerical AnalysisNumerical IntegrationHigh-order Numerical IntegrationPolynomial Interpolation
We are interested in quickly computing the exact value of integrals of polynomial functions over domains that are decomposable into convex polyhedra (e.g., a tetrahedral or cubical mesh decomposition of space). We describe a software implementation, part of the software LattE, and provide benchmark computations.
22
On the Complexity of Computing the Volume of a Polyhedron
Martin Dyer, Alan Frieze · SIAM Journal on Computing · 1988 · 312 citations
Graham Brightwell, Peter Winkler · Order · 1991 · 282 citations