No label defined (Q4549223)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1789912
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1789912 |
Statements
18 December 2002
0 references
convex bodies
0 references
lattices
0 references
random samples
0 references
convex polytopes
0 references
limit shape
0 references
0.981442928314209
0 references
0.8675729036331177
0 references
0.8429310917854309
0 references
0.8389797806739807
0 references
0.8238955736160278
0 references
Assume \(K\) is a convex body in \(R^d\), and \(X\) is a (large) finite subset of \(K\). How many convex polytopes are there whose vertices come from \(X\)? What is the typical shape of such a polytope? How well the largest such polytope (which is actually \(\operatorname {conv}X\)) approximates \(K\)? This paper is interested in these questions mainly in two cases. The first is when \(X\) is a random sample of \(n\) uniform, independent points from \(K\) and is motivated by Sylvester's four-point problem, and by the theory of random polytopes. The second case is when \(X=K\cap Z^d\) where \(Z^d\) is the lattice of integer points in \(R^d\). Motivation comes from integer programming and geometry of numbers. The two cases behave quite similarly. For the entire collection see [Zbl 0993.00023].
0 references