Dense Packings of Superdisks and the Role of Symmetry
arXiv:0712.0420 · doi:10.1103/PhysRevLett.100.245504
Abstract
We construct the densest known two-dimensional packings of superdisks in the plane whose shapes are defined by |x^(2p) + y^(2p)| <= 1, which contains both convex-shaped particles (p > 0.5, with the circular-disk case p = 1) and concave-shaped particles (0 < p < 0.5). The packings of the convex cases with p 1 generated by a recently developed event-driven molecular dynamics (MD) simulation algorithm [Donev, Torquato and Stillinger, J. Comput. Phys. 202 (2005) 737] suggest exact constructions of the densest known packings. We find that the packing density (covering fraction of the particles) increases dramatically as the particle shape moves away from the "circular-disk" point (p = 1). In particular, we find that the maximal packing densities of superdisks for certain p 6 = 1 are achieved by one of the two families of Bravais lattice packings, which provides additional numerical evidence for Minkowski's conjecture concerning the critical determinant of the region occupied by a superdisk. Moreover, our analysis on the generated packings reveals that the broken rotational symmetry of superdisks influences the packing characteristics in a non-trivial way. We also propose an analytical method to construct dense packings of concave superdisks based on our observations of the structural properties of packings of convex superdisks.
arXiv comment15 pages, 8 figures
References in corpus (5)
Cited by in corpus (30)
- Jammed Hard-Particle Packings: From Kepler to Bernal and Beyond
- Understanding shape entropy through local dense packing
- Dense Packings of Polyhedra: Platonic and Archimedean Solids
- Random Close Packing of Disks and Spheres in Confined Geometries
- Optimal Packings of Superballs
- Basic Understanding of Condensed Phases of Matter via Packing Models
- Phase Behavior of Colloidal Superballs: Shape Interpolation from Spheres to Cubes
- Robust Algorithm to Generate a Diverse Class of Dense Disordered and Ordered Sphere Packings via Linear Programming
- Novel Features Arising in the Maximally Random Jammed Packings of Superballs
- Organizing Principles for Dense Packings of Nonspherical Hard Particles: Not All Shapes Are Created Equal
- Maximally dense packings of two-dimensional convex and concave noncircular particles
- Hyperuniformity, quasi-long-range correlations, and void-space constraints in maximally random jammed particle packings. II. Anisotropy in particle shape
- Ordering and Dynamics of Vibrated Hard Squares
- Random packing of regular polygons and star polygons on a flat two-dimensional surface
- Simulating Hard Rigid Bodies
- Deposition of general ellipsoidal particles
- Characterization of Void Space, Large-Scale Structure, and Transport Properties of Maximally Random Jammed Packings of Superballs
- How dense can one pack spheres of arbitrary size distribution?
- Random Sequential Adsorption of Oriented Superdisks
- An Efficient Linear Programming Algorithm to Generate the Densest Lattice Sphere Packings
- Three-step melting of hard superdisks in two dimensions
- RSA Study of Dimers
- Demixing and tetratic ordering in some binary mixtures of hard superellipses
- Kinetics of random sequential adsorption of nearly spherically symmetric particles
- Dense packings of hard circular arcs
- Random sequential adsorption of particles with tetrahedral symmetry
- Optimizing Event-Driven Simulations
- Universality of the close packing properties and markers of isotropic-to-tetratic crossover in quasi-one-dimensional superdisk fluid
- Kinetics of Deposition of Oriented Superdisks
- Phase Boundaries of Bulk 2D Rhombi