Computer simulation of close random packing of equal spheres

摘要: We have developed an algorithm which generates a random close packing of equal spheres from distribution points. Each point is the center inner and outer sphere. The diameter defines true density nominal density. eliminates overlaps among while slowly shrinking diameter. two diameters approach each other, eventual coincidence densities terminates procedure. in packing, inherently homogeneous isotropic, are together but not touching. Thus, near neighbors defined as those within specified distance, \ensuremath{\delta}, When contracted relatively quickly, number depends strongly on \ensuremath{\delta}. As contraction rate approaches zero, this dependence decreases sharply. speculate that limiting value exactly 6 for all \ensuremath{\delta}\ensuremath{\le}${10}^{\mathrm{\ensuremath{-}}3}$. Packing fractions between 0.642 0.649, easily achieved by method, higher than any experimental or previously simulated values, consistent with Berryman's extrapolation [Phys. Rev. A 27, 1053 (1983)] radial function hard spheres. can also be used hyperspheres dimensions.