Approximating the ball by a Minkowski sum of segments with equal length
The following theorem is proved. For every \(n\in\mathbb{N}\), there is a constant \(c(n)\) so that the \(n\)-dimensional Euclidean ball can be approximated up to \(\varepsilon>0\) in the Hausdorff metric by a sum of \[ N\leq c(n)(\varepsilon^{-2}|\log\varepsilon|)^{(n- 1)/(n+2)} \] segments of equal length. For \(n\leq 6\), this was proved by \textit{G. Wagner} [Discrete Comput. Geom. 9, 111-129 (1993)]. The authors use a different method, in part also related to numerical integration with equal weights. The same result, but with sums of segments of not necessarily equal lengths, had been obtained earlier by the same authors [Isr. J. Math. 64, No. 1, 25-31 (1988; Zbl 0667.52001)].
- Distribution of points on spheres and approximation by zonotopes
- Improved upper bounds for approximation by zonotopes
- Stochastic quasi-interpolation with Bernstein polynomials
- Projecting \(l_{\infty}\) onto classical spaces
- Multivariate quadrature rules on crosslet sparse grids
- Geometric applications of Chernoff-type estimates and a ZigZag approximation for balls
- scientific article; zbMATH DE number 1975224 (Why is no real title available?)
- Practical volume estimation of zonotopes by a new annealing schedule for cooling convex bodies
- Isoperimetric problems for zonotopes
- Optimal approximation of zonoids and uniform approximation by shallow neural networks
This page was built for publication: Approximating the ball by a Minkowski sum of segments with equal length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1209836)
