Scientists at the theoretical institutes, Chinese Academy of Science and Cybermedia Center at Osaka University performed extensive computer simulations to generate and examine random packing of ...

Sphere packing, a mathematical problem in which non-overlapping spheres are arranged within a given space, has been widely investigated in the past. It has been proven that the densest possible ...

Although the concept of random close packing with an almost universal packing fraction of approximately 0.64 for hard spheres was introduced more than half a century ago, there are still ongoing ...

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 ...