A dense packing of regular tetrahedra

DOI10.1007/s00454-008-9101-yzbMath1156.52302DBLPjournals/dcg/Chen08arXiv0908.1884OpenAlexW3098845077WikidataQ56740095 ScholiaQ56740095MaRDI QIDQ958219

Elizabeth R. Chen

Publication date: 2 December 2008

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0908.1884

zbMATH Keywords

Hilbert problempackingcrystallographyregular solid

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (5)

Upper bound on the packing density of regular tetrahedra and octahedra ⋮ On the translative packing densities of tetrahedra and cuboctahedra ⋮ Maximum packing densities of basic 3D objects ⋮ Dense periodic packings of tetrahedra with small repeating units ⋮ Dense crystalline dimer packings of regular tetrahedra

Uses Software

• kepler98

Cites Work

• Historical overview of the Kepler conjecture
• Über die dichteste gitterförmige Lagerung kongruenter Tetraeder
• Densest lattice packings of 3-polytopes.
• A proof of the Kepler conjecture
• Which Tetrahedra Fill Space?
• Packing, tiling, and covering with tetrahedra
• The densest lattice packing of tetrahedra

This page was built for publication: A dense packing of regular tetrahedra