Tetrahedron Packing
22,99 €
inkl. MwSt.

Versandfertig in 6-10 Tagen
  • Broschiertes Buch

High Quality Content by WIKIPEDIA articles! High Quality Content by WIKIPEDIA articles! 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. A regular tetrahedron. Currently, the best lower bound achieved on the optimal packing fraction of regular tetrahedra is 85.63%. It is known that the tetrahedron does not tile space, and thus its optimal packing fraction is under 100%, but no lower upper bound has been rigorously shown.

Andere Kunden interessierten sich auch für
Produktbeschreibung
High Quality Content by WIKIPEDIA articles! High Quality Content by WIKIPEDIA articles! 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. A regular tetrahedron. Currently, the best lower bound achieved on the optimal packing fraction of regular tetrahedra is 85.63%. It is known that the tetrahedron does not tile space, and thus its optimal packing fraction is under 100%, but no lower upper bound has been rigorously shown.