Two Algorithms for Determining Volumes of Convex Polyhedra
From MaRDI portal
Publication:4188766
DOI10.1145/322139.322141zbMath0403.68067MaRDI QIDQ4188766
Jacques Cohen, Timothy J. Hickey
Publication date: 1979
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322139.322141
52-04: Software, source code, etc. for problems pertaining to convex and discrete geometry
68Q60: Specification and verification (program logics, model checking, etc.)
65F99: Numerical linear algebra
68R99: Discrete mathematics in relation to computer science
52Bxx: Polytopes and polyhedra
Related Items
(Deterministic) algorithms that compute the volume of polytopes, MULTIPLE PARAMETER CONTINUATION: COMPUTING IMPLICITLY DEFINED k-MANIFOLDS, Linear programming system identification, On integer points in polyhedra, A statistical approach to the analytic hierarchy process with interval judgements. I: Distributions on feasible regions, Geometric comparison of combinatorial polytopes, A recursive algorithm for volume-based sensitivity analysis of linear decision models, Inner and outer approximations of polytopes using boxes.