Bounding the density of binary sphere packing
By: Thomas Fernique, Daria Pchelina
Potential Business Impact:
Pack spheres tighter to save space.
This paper provides the currently best known upper bound on the density of a packing in three-dimensional Euclidean space of two types of spheres whose size ratio is the largest one that allows the insertion of a small sphere in each octahedral hole of a hexagonal compact packing of large spheres. This upper bound is obtained by bounding from above the density of the tetrahedra which can appear in the additively-weighted Delaunay decomposition of the sphere centers of such packings. The proof relies on challenging computer calculations in interval arithmetic and may be of interest by their own.
Similar Papers
Improved Approximation Algorithms for Three-Dimensional Bin Packing
Computational Geometry
Fits boxes better, saving space and money.
Model-Based and Sample-Efficient AI-Assisted Math Discovery in Sphere Packing
Artificial Intelligence
Finds better ways to pack shapes in space.
Complementary bodies in sphere packing
Computational Geometry
Shows how to fill empty spaces between balls.