How dense can one pack spheres of arbitrary size distribution?

Abstract

We present the first systematic algorithm to estimate the maximum packing density of spheres when the grain sizes are drawn from an arbitrary size distribution. With an Apollonian filling rule, we implement our technique for disks in 2d and spheres in 3d. As expected, the densest packing is achieved with power-law size distributions. We also test the method on homogeneous and on empirical real distributions, and we propose a scheme to obtain experimentally accessible distributions of grain sizes with low porosity. Our method should be helpful in the development of ultra-strong ceramics and high performance concrete.

5 pages, 5 figures

References in corpus (1)

• Dense Packings of Superdisks and the Role of Symmetry

Cited by in corpus (8)

• Influence of Particle Size Distribution on Random Close Packing
• Breath Figures: Nucleation, Growth, Coalescence, and the Size Distribution of Droplets
• Deposition of general ellipsoidal particles
• Current challenges for preseismic electromagnetic emissions: shedding light from micro-scale plastic flow, granular packings, phase transitions and self-affinity notion of fracture process
• Optimal synchronizability of bearings
• Apollonian Packing in Polydisperse Emulsions
• Dense random packing with a power-law size distribution: the structure factor, mass-radius relation, and pair distribution function
• Mixing properties of bi-disperse ellipsoid assemblies: Mean-field behaviour in a granular matter experiment