In geometry, tetrahedron packing is the problem of arranging identical regular tetrahedra throughout three-dimensional space so as to fill the maximum possible fraction of space. Currently, the best lower bound achieved on the optimal packing fraction of regular tetrahedra is 85.63%.
In geometry, tetrahedron packing is the problem of arranging identical regular tetrahedra throughout three-dimensional space so as to fill the maximum possible fraction of space. Currently, the best lower bound achieved on the optimal packing fraction of regular tetrahedra is 85.63%.
Source: Wikipedia "Tetrahedron packing" · CC BY-SA 4.0
Share this article: X · Bluesky