Two Algorithms for Determining Volumes of Convex Polyhedra

DOI10.1145/322139.322141MaRDI QIDQ4188766zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

AlgorithmsLinear System of InequalitiesProgram AnalysisSimplicesVolumes of Convex Polyhedra

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Polytopes and polyhedra (52Bxx) Numerical linear algebra (65F99) Specification and verification (program logics, model checking, etc.) (68Q60) Discrete mathematics in relation to computer science (68R99)

Cited in

(31)

• Decision making under uncertainty: Starr's domain criterion
• Efficient integration over polytopes
• A probabilistic dominance measure for binary choices: Analytic aspects of a multi-attribute random weights model
• Measures of freedom based on possibility
• An analytical expression and an algorithm for the volume of a convex polyhedron in \(R^ n\).
• 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.
• Asymptotic vulnerability of positional voting rules to coalitional manipulation
• Monotonicity paradoxes in three-candidate elections using scoring elimination rules
• Unique representation in convex sets by extraction of marked components
• Polyhedral circuits and their applications
• Local formulas for Ehrhart coefficients from lattice tiles
• Linear programming system identification: the general nonnegative parameters case
• Statistics of energy partitions for many-particle systems in arbitrary dimension
• A note on approval voting and electing the Condorcet loser
• A combinatorial algorithm to construct 3D isothetic covers
• A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding
• (Deterministic) algorithms that compute the volume of polytopes
• Hull-volume with applications to convergence analysis
• Using histograms to better answer queries to probabilistic logic programs
• MULTIPLE PARAMETER CONTINUATION: COMPUTING IMPLICITLY DEFINED k-MANIFOLDS
• IAC Probability Calculations in Voting Theory: Progress Report
• Computing the Hausdorff boundary measure of semialgebraic sets
• The service rate region polytope
• On the semantics of top-\(k\) ranking for objects with uncertain data
• Optimal oversampling ratio in two-step simulation
• Linear programming system identification
• Polytope volume by descent in the face lattice and applications in social choice

This page was built for publication: Two Algorithms for Determining Volumes of Convex Polyhedra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4188766)