A Laplace transform algorithm for the volume of a convex polytope

DOI10.1145/504794.504796zbMath1323.68538OpenAlexW2153677792MaRDI QIDQ3196628

Eduardo S. Zeron, Jean-Bernard Lasserre

Publication date: 30 October 2015

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/504794.504796

zbMATH Keywords

Laplace transformcomputational geometryconvex polytopesvolume of a convex polytope

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding, Time-Bounded Verification of CTMCs against Real-Time Specifications, Airport games: the core and its center, Exploring stochasticity and imprecise knowledge based on linear inequality constraints, A QUASI-NATURAL MEASURE OF CHOICE FREEDOM FOR BUDGET- AND TIME-CONSTRAINED OPPORTUNITY SETS, A discrete Farkas lemma, Computing Optimized Path Integrals for Knapsack Feasibility, Mean value and volume-based sensitivity analysis for Olympic rankings, Multivariate splines and polytopes, Statistical properties of the single linkage hierarchical clustering estimator, Simple formula for integration of polynomials on a simplex, Solving the knapsack problem via \(\mathbb Z\)-transform