Dense Packings of Polyhedra: Platonic and Archimedean Solids
S. Torquato, Y. Jiao

TL;DR
This paper introduces the Adaptive Shrinking Cell scheme to find dense packings of non-tiling polyhedra, revealing new densest packings for several Platonic solids and proposing conjectures on optimal packing structures.
Contribution
It formulates a novel optimization approach for dense packings of polyhedra and provides the densest known packings for various Platonic solids, along with theoretical bounds and conjectures.
Findings
Densest packings of tetrahedra, icosahedra, dodecahedra, and octahedra identified.
Densest tetrahedral packing has no long-range order.
Conjecture: densest packings of centrally symmetric solids are their densest lattice packings.
Abstract
We formulate the problem of generating dense packings of nonoverlapping, non-tiling polyhedra within an adaptive fundamental cell subject to periodic boundary conditions as an optimization problem, which we call the Adaptive Shrinking Cell (ASC) scheme. This novel optimization problem is solved here (using a variety of multi-particle initial configurations) to find the dense packings of each of the Platonic solids in three-dimensional Euclidean space R3 , except for the cube, which is the only Platonic solid that tiles space. We find the densest known packings of tetrahedra, icosahedra, dodecahedra, and octahedra with densities 0.823, 0.836, 0.904, and 0.947, respectively. It is noteworthy that the densest tetrahedral packing possesses no long-range order. Unlike the densest tetrahedral packing, which must not be a Bravais lattice packing, the densest packings of the other non-tiling…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
