Dense periodic packings of tetrahedra with small repeating units

DOI10.1007/s00454-010-9254-3zbMath1202.52018arXiv0910.5226OpenAlexW3100999267MaRDI QIDQ5962349

Veit Elser, Yoav Kallus, Simon Gravel

Publication date: 22 September 2010

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

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

zbMATH Keywords

polyhedraHilbert problempackingcrystallographyregular solid

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) 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 ⋮ Message-passing algorithms for inference and optimization ⋮ Pessimal packing shapes ⋮ Dense crystalline dimer packings of regular tetrahedra

Cites Work

• Double-lattice packings of convex bodies in the plane
• A dense packing of regular tetrahedra
• Closest point search in lattices
• Packing, tiling, and covering with tetrahedra
• The densest lattice packing of tetrahedra

This page was built for publication: Dense periodic packings of tetrahedra with small repeating units