Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T08:59:57.233Z Has data issue: false hasContentIssue false

Randomly Packed and Solidly Packed Spheres

Published online by Cambridge University Press:  20 November 2018

E. N. Gilbert*
Affiliation:
Bell Telephone Laboratories, Murray Hill, New Jersey
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In the classical packing problem unit spheres are placed without overlapping in D-dimensional space. When D = 2, the densest packing is a familiar regular arrangement of circles, each circle touching six others. In this packing, circles cover a fraction π/√12 = 0.9069 . . . of the area of the plane. The densest packing is not known for D ≥ 3.

Most of the packings to be considered here use spheres of many different sizes. In this way greater densities are obtainable; small spheres can fill up some of the space left over after large spheres have been packed.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1964