Affiliation:
1. North Carolina State University
Abstract
While the derivations of precise asymptotic estimates found in the mathematical literature are not easily accessible to the non-specialist, there are rather simple arguments for deriving rougher "big-theta" bounds on the expected size of random convex hulls. These arguments are presented, then applied to verify a recently published conjecture on the expected number of maximal vectors among a set of random points chosen from a ball. A summary of recent progress follows. Results relevant for analyzing algorithms are emphasized.
Publisher
Association for Computing Machinery (ACM)
Reference21 articles.
1. F. Affentranger and J . A. Wieacker . On the convex hull of uniform random points in a simple d-polytope . Discrete and Computational Geometry to appear .
2. I . Barany. Intrinsic volumes and f-vectors of random polytopes . manuscript 1989 .
3. Convex bodies, economic cap coverings, random polytopes
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献