Data from: Random-close packing limits for monodisperse and polydisperse hard spheres

Vasili Baranau & Ulrich Tallarek
We investigate how the densities of inherent structures, which we refer to as the closest jammed configurations, are distributed for packings of 10000 frictionless hard spheres. A computational algorithm is introduced to generate closest jammed configurations and determine corresponding densities. Closest jamming densities for monodisperse packings generated with high compression rates using Lubachevsky–Stillinger and force-biased algorithms are distributed in a narrow density range from φ = 0.634-0.636 to φ ≈ 0.64; closest jamming densities for...
1 citation reported since publication in 2014.
43 views reported since publication in 2014.

These counts follow the COUNTER Code of Practice, meaning that Internet robots and repeats within a certain time frame are excluded.
What does this mean?
11 downloads reported since publication in 2014.

These counts follow the COUNTER Code of Practice, meaning that Internet robots and repeats within a certain time frame are excluded.
What does this mean?