Maximally dense packings of two-dimensional convex and concave noncircular particles

Abstract

Dense packings of hard particles have important applications in many fields, including condensed matter physics, discrete geometry and cell biology. In this paper, we employ a stochastic search implementation of the Torquato-Jiao Adaptive-Shrinking-Cell optimization scheme [Nature 460, 876 (2009)] to find maximally dense particle packings in d-dimensional Euclidean space ${\mathbb{R}}^d$. While the original implementation was designed to study spheres and convex polyhedra in $d\ge 3$, our implementation focuses on $d=2$ and extends the algorithm to include both concave polygons and certain convex or concave non-polygonal particle shapes. We verify the robustness of this packing protocol by successfully reproducing the known putative optimal packings of congruent copies of regular pentagons and octagons, then employ it to suggest dense packing arrangements of congruent copies of certain families of concave crosses, convex and concave curved triangles (incorporating shapes resembling the Mercedes-Benz logo), and "moon-like" shapes. Analytical constructions are determined subsequently to obtain the densest known packings of these particle shapes. For the examples considered, we find that the densest packings of both convex and concave particles with central symmetry are achieved by their corresponding optimal Bravais lattice packings; for particles lacking central symmetry, the densest packings obtained are non-lattice periodic packings, which are consistent with recently-proposed general organizing principles for hard particles. Moreover, we find that the densest known packings of certain curved triangles are periodic with a four-particle basis, and we find that the densest known periodic packings of certain moon-like shapes possess no inherent symmetries. Our work adds to the growing evidence that particle shape can be used as a tuning parameter to achieve a diversity of packing structures.

References in corpus (6)

• Dense Packings of the Platonic and Archimedean Solids
• Dense Packings of Polyhedra: Platonic and Archimedean Solids
• Robust Algorithm to Generate a Diverse Class of Dense Disordered and Ordered Sphere Packings via Linear Programming
• Dense Packings of Superdisks and the Role of Symmetry
• Organizing Principles for Dense Packings of Nonspherical Hard Particles: Not All Shapes Are Created Equal
• Dense packing crystal structures of physical tetrahedra

Cited by in corpus (14)

• Basic Understanding of Condensed Phases of Matter via Packing Models
• Hypostatic jammed packings of frictionless nonspherical particles
• Architecture and Function of Mechanosensitive Membrane Protein Lattices
• An Efficient Linear Programming Algorithm to Generate the Densest Lattice Sphere Packings
• Secondary flow in ensembles of non-convex granular particles under shear
• Dense packings of hard circular arcs
• Random Close Packing of Semi-Flexible Polymers in Two Dimensions: Emergence of Local and Global Order
• Computing upper bounds for the packing density of congruent copies of a convex body
• Packing Concave Molecules in Crystals and Amorphous Solids: On the Connection between Shape and Local Structure
• Kinetic Frustration Effects on Dense Two-Dimensional Packings of Convex Particles and Their Structural Characteristics
• Densest vs. jammed packings of 2D bent-core trimers
• Densest versus jammed packings of bent-core trimers
• Densest plane group packings of regular polygons
• Communication: Modeling layered mosaic perovskite alloy microstructures across length scales via a packing algorithm