Key points are not available for this paper at this time.
We present a new numerical scheme to study systems of nonconvex, irregular, and punctured particles in an efficient manner. We employ this method to analyze regular packings of odd-shaped bodies, both from a nanoparticle and from a computational geometry perspective. Besides determining close-packed structures for 17 irregular shapes, we confirm several conjectures for the packings of a large set of 142 convex polyhedra and extend upon these. We also prove that we have obtained the densest packing for both rhombicuboctahedra and rhombic enneacontrahedra and we have improved upon the packing of enneagons and truncated tetrahedra.
Graaf et al. (Mon,) studied this question.