TOPICS
Search

Polyhedron Packing


A packing of polyhedron in three-dimensional space. A polyhedron which can pack with no holes or gaps is said to be a space-filling polyhedron. Betke and Henk (2000) present an efficient algorithm for computing the density of a densest lattice packing of an arbitrary polyhedron, and explicitly calculate the densities for the Platonic and Archimedean solids.


See also

Kelvin's Conjecture, Packing, Space-Filling Polyhedron

Explore with Wolfram|Alpha

References

Betke, U. and Henk, M. "Densest Lattice Packings of 3-Polytopes." Comput. Geom. 16, 157-186, 2000.

Referenced on Wolfram|Alpha

Polyhedron Packing

Cite this as:

Weisstein, Eric W. "Polyhedron Packing." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/PolyhedronPacking.html

Subject classifications