scientific article; zbMATH DE number 1098734
Let \(K\) be a convex body in \(\mathbb{R}^d\) with \(bd K\) of class \(C^2\) and with positive product curvature. The paper concerns the best approximation of \(K\) by inscribed convex polytopes [For a survey, see \textit{P. M. Gruber}, Handbook of convex geometry. Vol. A., 319-345 (1993; Zbl 0791.52007)]. In Forum Math. 5, No. 3, 281-297 (1993; Zbl 0780.52005) and ibid., No. 6, 521-537 (1993; Zbl 0788.41020), \textit{P. M. Gruber} gave the precise asymptotic estimation from below of \(\text{Vol} (K\setminus P)\), where \(P\) is an inscribed polytope with \(n\) vertices. The author proves that random approximation (that is, approximation by a random inscribed polytope with \(n\) vertices) is of the same order of magnitude as best approximation. For the entire collection see [Zbl 0878.00066].
- The octahedron is badly approximated by random subspaces
- Random polytopes and the Efron-Stein jackknife inequality.
- The error of polytopal approximation with respect to the symmetric difference metric and the \(L_p\) metric
- Approximation of smooth convex bodies by random polytopes
- Best and random approximation of a convex body by a polytope
- scientific article; zbMATH DE number 5149093 (Why is no real title available?)
- Approximation by random polytopes has low complexity
- ALMOST EUCLIDEAN SECTIONS OF THE N-DIMENSIONAL CROSS-POLYTOPE USING O(N) RANDOM BITS
- scientific article; zbMATH DE number 1098748 (Why is no real title available?)
- Volume approximation of strongly \(\mathbb{C} \)-convex domains by random polyhedra
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4368905)