Sphere Packing — Definition, Formula & Examples
Sphere packing is the study of how to arrange identical spheres in space so they occupy the largest possible fraction of the total volume. The classic problem asks for the densest arrangement, which in three dimensions turns out to be the face-centered cubic (FCC) lattice, filling about 74% of space.
A sphere packing in is a collection of non-overlapping spheres of equal radius. The packing density is the fraction of space covered by the spheres. In , the Kepler conjecture (proved by Hales in 1998) establishes that the maximum density is , achieved by the FCC and hexagonal close-packed (HCP) arrangements.
Key Formula
Where:
- = Packing density — the fraction of total space occupied by spheres in the densest 3D arrangement
How It Works
Imagine stacking oranges in a crate. The first layer arranges circles in a hexagonal pattern, each touching six neighbors. The second layer nests into the gaps of the first. For the third layer, you can place spheres directly above the first-layer gaps (FCC) or directly above the first-layer spheres (HCP). Both achieve the same maximum density. The packing density is computed by dividing the volume of spheres inside a repeating unit cell by the total volume of that cell.
Worked Example
Problem: Compute the packing density of spheres of radius arranged in a face-centered cubic lattice with cube edge length .
Count spheres per unit cell: An FCC unit cell has 8 corner spheres (each shared among 8 cells) and 6 face-center spheres (each shared between 2 cells).
Total sphere volume in the cell: Four complete spheres contribute:
Unit cell volume: The cube has edge , so:
Compute density: Divide sphere volume by cell volume:
Answer: The FCC packing density is .
Why It Matters
Sphere packing appears in crystallography, where atoms in metals like copper and aluminum adopt FCC structures. It also underlies error-correcting codes in information theory, where "spheres" in high-dimensional spaces represent codeword neighborhoods, and denser packings yield more efficient codes.
Common Mistakes
Mistake: Assuming simple cubic packing is the densest arrangement
Correction: Simple cubic packing has density , far below the FCC/HCP maximum of about 74%. Always distinguish between different lattice types when comparing densities.
