Approximation of the Euclidean ball by polytopes with a restricted number of facets
From MaRDI portal
Publication:5220132
DOI10.4064/SM180114-22-5zbMATH Open1447.52010OpenAlexW2979832966WikidataQ127099439 ScholiaQ127099439MaRDI QIDQ5220132FDOQ5220132
Authors: Gil Kur
Publication date: 10 March 2020
Published in: Studia Mathematica (Search for Journal in Brave)
Abstract: We prove that there is an absolute constant such that for every and there exists a polytope with at most facets that satisfies Delta_{v}(D_n,P_{n,N}):= ext{vol}_nleft(D_n Delta P_{n,N}
ight)leq Cn^{-2/(n-1} ext{vol}_nleft(D_n
ight) and Delta_{s}(D_n,P_{n,N}):= ext{vol}_{n-1}left(partialleft(D_ncup P_{n,N}
ight)
ight) - ext{vol}_{n-1}left(partialleft(D_ncap P_{n,N}
ight)
ight) leq 4CN^{-frac{2}{n-1}} ext{vol}_{n-1}left(partial D_n
ight), where is the -dimensional Euclidean unit ball. This result closes gaps from several papers of Hoehner, Ludwig, Sch"utt and Werner. The upper bounds are optimal up to absolute constants. This result shows that a polytope with an exponential number of facets (in the dimension) can approximate the -dimensional Euclidean ball with respect to the aforementioned distances.
Full work available at URL: https://arxiv.org/abs/1705.00210
Recommendations
Geometric probability and stochastic geometry (60D05) Random convex sets and integral geometry (aspects of convex geometry) (52A22) Approximation by convex sets (52A27)
Cited In (14)
- Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality
- \((\delta ,\varepsilon)\)-ball approximation of a shape: definition and complexity
- Umbrellas and polytopal approximation of the Euclidean ball
- A simple proof of an estimate for the approximation of the Euclidean ball and the Delone triangulation numbers
- A note on approximation of a ball by polytopes
- Approximation of the Euclidean ball by polytopes
- A concentration inequality for random polytopes, Dirichlet-Voronoi tiling numbers and the geometric balls and bins problem
- Asymptotic expected T$T$‐functionals of random polytopes with applications to Lp$L_p$ surface areas
- On the distance of polytopes with few vertices to the Euclidean ball
- On approximation by projections of polytopes with few facets
- Explicit polyhedral approximation of the Euclidean ball
- Approximating the ball by a Minkowski sum of segments with equal length
- An intrinsic volume metric for the class of convex bodies in ℝn
- Approximation of the Sphere by Polytopes having Few Vertices
This page was built for publication: Approximation of the Euclidean ball by polytopes with a restricted number of facets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5220132)