Imagine placing oranges or tennis balls into a rigid container. How can the balls be arranged such that they occupy the largest volume fraction of the container, otherwise known as the largest packing ...

A NUMERICAL approach using a digital computer has been used to construct a simple model of the unit cell in a randomly packed bed of identical hard spheres. The cell is built up by introducing spheres ...

This is a preview. Log in through your library . Abstract One-dimensional random packing, known as the car-parking problem, was first analyzed by Rényi (1958). A stochastic version of Kakutani's (1975 ...

Researchers show that, unlike the crystalline close packing of spheres, random close packing or jamming of spheres in a container can take place in a broad range of densities and anisotropies.