It is well known that three-dimensional Euclidean space cannot be tiled by regular tetrahedra. But how well can we do? In this work, we give several constructions that may answer the various senses of this question. In so doing, we provide some solutions to packing, tiling, and covering problems of tetrahedra. Our results suggest that the regular tetrahedron may not be able to pack as densely as the sphere, which would contradict a conjecture of Ulam. The regular tetrahedron might even be the convex body having the smallest possible packing density.
|Original language||English (US)|
|Number of pages||6|
|Journal||Proceedings of the National Academy of Sciences of the United States of America|
|State||Published - Jul 11 2006|
All Science Journal Classification (ASJC) codes