Upper bound on the packing density of regular tetrahedra and octahedra

From MaRDI portal
Publication:650113

DOI10.1007/S00454-010-9304-XzbMATH Open1268.52015arXiv1008.2830OpenAlexW2017443311MaRDI QIDQ650113FDOQ650113


Authors: Simon Gravel, Veit Elser, Yoav Kallus Edit this on Wikidata


Publication date: 25 November 2011

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

Abstract: We obtain an upper bound to the packing density of regular tetrahedra. The bound is obtained by showing the existence, in any packing of regular tetrahedra, of a set of disjoint spheres centered on tetrahedron edges, so that each sphere is not fully covered by the packing. The bound on the amount of space that is not covered in each sphere is obtained in a recursive way by building on the observation that non-overlapping regular tetrahedra cannot subtend a solid angle of 4pi around a point if this point lies on a tetrahedron edge. The proof can be readily modified to apply to other polyhedra with the same property. The resulting lower bound on the fraction of empty space in a packing of regular tetrahedra is 2.6ldotsimes1025 and reaches 1.4ldotsimes1012 for regular octahedra.


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




Recommendations




Cites Work


Cited In (14)

Uses Software





This page was built for publication: Upper bound on the packing density of regular tetrahedra and octahedra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650113)