3
$\begingroup$

We know $n>2$ and worst case its a triangle, best case the points all lie on a circle. Can we generalize to higher dimensions? What's the probability that the size of the convex hull of $n$ points randomly selected in a circle is $k$?

$\endgroup$
5
$\begingroup$

The expected number of vertices of the convex hull of $n$ points, chosen uniformly and independently from a disk, is $O(n^{\frac{1}{3}})$.

The result goes back to the 1960's. A nice proof is in Har-Peled, "On the expected complexity of random convex hulls" (1997), from which the above sentence is quoted. (arXiv version abstract.)

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.