The convex hull of random points in a tetrahedron: solution of Blaschke's problem and more general results (Q2729299)

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 1621967
Language Label Description Also known as
default for all languages
No label defined
    English
    The convex hull of random points in a tetrahedron: solution of Blaschke's problem and more general results
    scientific article; zbMATH DE number 1621967

      Statements

      0 references
      0 references
      18 July 2001
      0 references
      convex hull of random points
      0 references
      Blaschke's problem
      0 references
      three-dimensional convex polytope
      0 references
      tetrahedron
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      The convex hull of random points in a tetrahedron: solution of Blaschke's problem and more general results (English)
      0 references
      Denote by \(V(n)\) the expected volume of the convex hull of \(n\) random points chosen independently and uniformly from a tetrahedron of volume one. The problem of determining, in particular \(V(4)\), goes back to \textit{W. Blaschke} [Leipz. Ber. 69, 436-453 (1917; JFM 46.0764.02)] and was pointed out in his book on affine differential geometry [\textit{W. Blaschke}, `Vorlesungen über Differentialgeometrie', Band II: Affine Differentialgeometrie. Berlin: Springer (1923; JFM 49.0499.01)]. Decades later, the problem was made better known by \textit{V. Klee} [Am. Math. Mon. 76, 286-288 (1969)]. Since then it has repeatedly been mentioned in research articles, survey articles, and books. An explicit formula for \(V(n)\) was already published earlier by the present authors [Anz. Österr. Akad. Wiss., Math.-Naturwiss. Kl. 1992, No. 8, 63-68 (1992; Zbl 0774.60016)], announcing that the (rather long) proof will appear later. Further work has led to substantial simplifications.NEWLINENEWLINENEWLINEThe present paper provides a simplified explicit formula for \(V(n)\), its detailed proof, and comments how one could proceed, in principle, in the case of an arbitrary three-dimensional convex polytope instead of a tetrahedron.
      0 references

      Identifiers