A sweep-plane algorithm for generating random tuples in simple polytopes

DOI10.1090/S0025-5718-98-01004-7zbMath0903.65003OpenAlexW1992657293MaRDI QIDQ4210961

Wolfgang Hörmann, Josef Leydold

Publication date: 10 September 1998

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-98-01004-7

zbMATH Keywords

polytoperejection methoduniform distributionsuniversal methodmultivariate log-concave distributionssweep-plane algorithm

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Random number generation in numerical analysis (65C10)

Related Items

An automatic code generator for nonuniform random variate generation ⋮ An economical acceptance-rejection algorithm for uniform random variate generation over constrained simplexes ⋮ On random generation of fuzzy measures ⋮ A general approach to generate random variates for multivariate copulae ⋮ Generating random variates from a bicompositional Dirichlet distribution ⋮ A survey on stochastic multicriteria acceptability analysis methods ⋮ Class library ranlip for multivariate nonuniform random variate generation ⋮ Bottom-up: a new algorithm to generate random linear extensions of a poset ⋮ Applying Young diagrams to 2-symmetric fuzzy measures with an application to general fuzzy measures ⋮ Generating random points (or vectors) controlling the percentage of them that are extreme in their convex (or positive) hull

Uses Software

• cdd

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On computer generation of random vectors by transformations of uniformly distributed vectors
• A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form
• Relational heuristics for the design of deterministic programs
• A recursive sweep-plane algorithm, determining all cells of a finite division of \(R^ m\).
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• A universal generator for discrete log-concave distributions
• Eine Schnittrekursion für die Eulersche Charakteristik euklidischer Polyeder mit Anwendungen innerhalb der kombinatorischen Geometrie
• Polytope Volume Computation
• On the Complexity of Computing the Volume of a Polyhedron
• Lectures on Polytopes
• A rejection technique for sampling from T -concave distributions
• Adaptive Rejection Sampling for Gibbs Sampling
• An Elementary Proof of Gram's Theorem for Convex Polytopes
• The maximum numbers of faces of a convex polytope
• Eulers Charakteristik und kombinatorische Geometrie.

This page was built for publication: A sweep-plane algorithm for generating random tuples in simple polytopes