A sphere packing is an arrangement of non-overlapping spheres, usually of identical size, within a containing space, most commonly three-dimensional Euclidean space; the problem generalizes to circle packing in two dimensions, hypersphere packing in higher dimensions, and non-Euclidean spaces. A typical sphere packing problem asks for the arrangement that fills as much of the space as possible, measured by its packing density. For equal spheres in three dimensions the densest possible packing fills approximately 74 percent of the volume, while a random packing of equal spheres typically reaches only about 63.5 percent. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Connections
Associated With
The Kepler conjecture states the densest possible arrangement of non-overlapping spheres is the familiar cubic and hexagonal close packings, so its subject is the sphere packing concept itself.
Additional Source Sphere Packing (Wikipedia)Lead section
In Branch
Sources
1. Sphere Packing (Wikipedia)
Wikimedia FoundationLead section
a sphere packing is an arrangement of non-overlapping spheres within a containing space
History section, Kepler conjecture
In 1611, Johannes Kepler conjectured that this is the maximum possible density amongst both regular and irregular arrangements, this became known as the Kepler conjecture.
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.