##  [Packing Density](/packing-density-0) 

 Definition

The proportion of ambient space occupied by a packing of congruent bodies (often spheres) in a prescribed arrangement or in the optimal arrangement; formally the limit (or lim sup) of occupied volume fraction in large regions.

 

 

 

 

 

 





## Principle

Principle

Measure the fraction of Lebesgue volume covered by disjoint translates (and rotations, if allowed) of the bodies inside increasingly large domains and take the supremum over all admissible arrangements to define optimal packing density; periodic and lattice packings provide constructive lower bounds.

 

 

 

 

 





## Demonstration

Demonstration

In the plane, the densest packing of congruent circles is the hexagonal (triangular) lattice with density π/(2√3) ≈ 0.9069. In R^3 the densest sphere packing (Kepler conjecture) has density π/(3√2) ≈ 0.74048 achieved by face-centred cubic or hexagonal close packing arrangements.

 

 

 

 

## Misapplication

Misapplication

Interpreting local dense clusters in a finite container as global optimal density, or comparing densities of non-congruent or deformable bodies without normalization; assuming lattice optimality without checking non-lattice or aperiodic constructions.

 

 

 

 

 





## Consequence

Consequence

Quantifies material porosity and packing efficiency, provides bounds for covering and transport problems, and yields constraints in discrete geometry and materials science; optimal densities characterize extremal arrangements and symmetry.

 

 

 

 

## Reversal

Reversal

The complementary problem is covering density, which asks how much overlap is required so that translates of the bodies cover space; porosity or void fraction equals one minus packing density and reverses the filled/empty perspective.

 

 

 

 

 





## Boundary

Boundary

Defined for packings in metric measure spaces where volume is well-defined; depends on congruence class of bodies and allowed motions (translations only, or translations and rotations). For finite containers boundary effects matter and the asymptotic density may not apply.

 

 

 

 

 





## Semantic Tension

Semantic Tension

Close relation and frequent confusion with covering density, packing fraction for random loose/close packings, and with local densest configurations; lattice versus non-lattice and deterministic versus probabilistic packings create competing notions of optimality.

 

 

 

 

 





## Synthesis

Synthesis

Packing density is the asymptotic volume fraction filled by disjoint copies of a given body under the best arrangement allowed; it captures global efficiency of space-filling, distinguishes lattice and non-lattice optimizers, and serves as a bridge between discrete geometry and physical packing phenomena.