Two Algorithms for Determining Volumes of Convex Polyhedra

From MaRDI portal
Publication:4188766

DOI10.1145/322139.322141zbMath0403.68067OpenAlexW2054592196MaRDI QIDQ4188766

Timothy J. Hickey, Jacques Cohen

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




Related Items

Efficient integration over polytopesA note on approval voting and electing the Condorcet loserPolytope volume by descent in the face lattice and applications in social choiceA probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic boundingGeometric comparison of combinatorial polytopesIAC Probability Calculations in Voting Theory: Progress ReportA recursive algorithm for volume-based sensitivity analysis of linear decision modelsA probabilistic dominance measure for binary choices: Analytic aspects of a multi-attribute random weights modelMeasures of freedom based on possibilityAsymptotic vulnerability of positional voting rules to coalitional manipulationHull-volume with applications to convergence analysisMonotonicity paradoxes in three-candidate elections using scoring elimination rulesAn analytical expression and an algorithm for the volume of a convex polyhedron in \(R^ n\).Computing the Hausdorff Boundary Measure of Semialgebraic SetsInner and outer approximations of polytopes using boxes.On the semantics of top-\(k\) ranking for objects with uncertain data(Deterministic) algorithms that compute the volume of polytopesLinear programming system identification: the general nonnegative parameters caseOn integer points in polyhedraUsing Histograms to Better Answer Queries to Probabilistic Logic ProgramsLinear programming system identificationStatistics of energy partitions for many-particle systems in arbitrary dimensionPolyhedral circuits and their applicationsLocal formulas for Ehrhart coefficients from lattice tilesMULTIPLE PARAMETER CONTINUATION: COMPUTING IMPLICITLY DEFINED k-MANIFOLDSUnique representation in convex sets by extraction of marked componentsA combinatorial algorithm to construct 3D isothetic coversA statistical approach to the analytic hierarchy process with interval judgements. I: Distributions on feasible regionsDecision making under uncertainty: Starr's domain criterion