Generating random points (or vectors) controlling the percentage of them that are extreme in their convex (or positive) hull

DOI10.1007/s10852-005-1597-zzbMath1084.65008OpenAlexW1989292700MaRDI QIDQ814963

Francisco J. López

Publication date: 8 February 2006

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-005-1597-z

zbMATH Keywords

polyhedrarandom number generationconvex hullspositive hulls

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Random number generation in numerical analysis (65C10)

Related Items (1)

Competing output-sensitive frame algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• A new procedure for identifying the frame of the convex hull of a finite collection of points in multidimensional space
• Using an interior point method for the master problem in a decomposition approach
• On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes
• The generation of convex hulls
• An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
• Algorithms for the Frame of a Finitely Generated Unbounded Polyhedron
• Solving Large-Scale Zero-One Linear Programming Problems
• A sweep-plane algorithm for generating random tuples in simple polytopes
• Lectures on Polytopes
• An Algorithm for Identifying the Frame of a Pointed Finite Conical Hull
• Convex Analysis
• Theory of Positive Linear Dependence

This page was built for publication: Generating random points (or vectors) controlling the percentage of them that are extreme in their convex (or positive) hull