View-Obstruction Problems
Algorithms are given for constructing a polytope P with n vertices (facets), contained in (or containing) a given convex body K in , so that the ratio of the volumes |K∖P|/|K| (or |P∖K|/|K|) is smaller than .
The geometry of random projections of centrally symmetric convex bodies in is studied. It is shown that if for such a body K the Euclidean ball is the ellipsoid of minimal volume containing it and a random n-dimensional projection is “far” from then the (random) body B is as “rigid” as its “distance” to permits. The result holds for the full range of dimensions 1 ≤ n ≤ λN, for arbitrary λ ∈ (0,1).