Improving Roger's upper bound for the density of unit ball packings via estimating the surface area of Voronoi cells from below in Euclidean \(d\)-space for all \(d\geq 8\)
DOI10.1007/s00454-001-0095-yzbMath1013.52015arXivmath/0110205OpenAlexW1985846107MaRDI QIDQ1611073
Publication date: 21 June 2003
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0110205
Voronoi cellssphere packing problemHilbert's 18th problemdensity of unit ball packingsKabatjanski-Levenštein boundRogers' bound
(n)-dimensional polytopes (52B11) Inequalities and extremum problems involving convexity in convex geometry (52A40) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Related Items (3)
This page was built for publication: Improving Roger's upper bound for the density of unit ball packings via estimating the surface area of Voronoi cells from below in Euclidean \(d\)-space for all \(d\geq 8\)