A concentration inequality for random polytopes, Dirichlet-Voronoi tiling numbers and the geometric balls and bins problem
From MaRDI portal
Publication:2664110
DOI10.1007/s00454-020-00174-3zbMath1461.52005arXiv1801.00167OpenAlexW3006387708MaRDI QIDQ2664110
Publication date: 20 April 2021
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.00167
Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Approximation by convex sets (52A27) Tilings in (n) dimensions (aspects of discrete geometry) (52C22) Random convex sets and integral geometry (aspects of convex geometry) (52A22)
Related Items
An intrinsic volume metric for the class of convex bodies in ℝn ⋮ Asymptotic expected T$T$‐functionals of random polytopes with applications to Lp$L_p$ surface areas
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A remark on the Mahler conjecture: local minimality of the unit cube
- Sharp concentration of random polytopes
- Central limit theorems for random polytopes in a smooth convex set
- Random coverings in several dimensions
- Volume approximation of convex bodies by inscribed polytopes
- Convex bodies with minimal volume product in \(\mathbb{R}^ 2\)
- Polygonal approximation of plane convex bodies
- Approximation of smooth convex bodies by random circumscribed polytopes
- Random polytopes and the Efron-Stein jackknife inequality.
- The surface area deviation of the Euclidean ball and a polytope
- New analysis of the sphere covering problems and optimal polytope approximation of convex bodies
- Approximation of a ball by random polytopes
- Polytopal approximation bounding the number of \(k\)-faces
- Symmetric Mahler's conjecture for the volume product in the \(3\)-dimensional case
- Polytopes of maximal volume product
- Convergence of algorithms for reconstructing convex bodies and directional measures
- Central limit theorems for random polytopes
- Geometry and Topology for Mesh Generation
- A note on coverings
- THE VOLUME OF RANDOM POLYTOPES CIRCUMSCRIBED AROUND A CONVEX BODY
- Asymptotic quantization error of continuous signals and the quantization dimension
- Asymptotic estimates for best and stepwise approximation of convex bodies II
- On the approximation of a ball by random polytopes
- Asymptotic approximation of smooth convex bodies by general polytopes
- Asymptotic approximation of smooth convex bodies by polytopes
- Approximation of the Euclidean ball by polytopes with a restricted number of facets
- The amount of overlapping in partial coverings of space by equal spheres
- Alice and Bob Meet Banach
- Convex Bodies The Brunn-MinkowskiTheory
- Approximation of the Euclidean ball by polytopes
- Covering a sphere with spheres
- A theorem on transfer for convex bodies
- The Covering of n -Dimensional Space by Spheres
- A simple proof of an estimate for the approximation of the Euclidean ball and the Delone triangulation numbers
- On the Delone triangulation numbers
This page was built for publication: A concentration inequality for random polytopes, Dirichlet-Voronoi tiling numbers and the geometric balls and bins problem
