Random Polytopes in the d- Dimensional Cube.

Z. Füredi

Displaying similar documents to “Random Polytopes in the d- Dimensional Cube.”

On the Convex Hull of Uniform Random Points in a Simple d-Polytope.

J.A. Wieacker, F. Affentranger (1991)

Discrete & computational geometry

Similarity:

Largest j-Simplices in n-Polytopes.

V. Klee, P. Gritzmann, D. Larman (1995)

Discrete & computational geometry

Similarity:

A Note on Small Linear-Ordering Polytopes.

G. Reinelt (1993)

Discrete & computational geometry

Similarity:

Flexible cross-polytopes in the Euclidean 4-space.

Stachel, Hellmuth (2000)

Journal for Geometry and Graphics

Similarity:

The Cubical d-Polytopes with Fewer than 2d+1 Vertices.

R. Blind, G. Blind (1995)

Discrete & computational geometry

Similarity:

Recent Results on Random Polytopes

Rolf Schneider (2008)

Bollettino dell'Unione Matematica Italiana

Similarity:

This is a survey over recent asymptotic results on random polytopes in d-dimensional Euclidean space. Three ways of generating a random polytope are considered: convex hulls of finitely many random points, projections of a fixed high-dimensional polytope into a random d-dimensional subspace, intersections of random closed halfspaces. The type of problems for which asymptotic results are described is different in each case.