Algorithms to generate saturated random sequential adsorption packings built of rounded polygons
arXiv:2105.11867 · doi:10.1103/PhysRevE.103.063308
Abstract
We present the algorithm for generating strictly saturated random sequential adsorption packings built of rounded polygons. It can be used to study various properties of such packings built of a wide variety of different shapes and in modelling monolayers obtained during the irreversible adsorption processes of complex molecules. Here, we apply the algorithm to study the densities of packings built of rounded regular polygons. Contrary to packings built of regular polygons, where packing fraction grows with an increasing number of polygon sides, the packing fraction reaches its maximum for packings built of rounded regular triangles. With a growing number of polygon sides and increasing rounding radius, the packing fractions tend to the limit given by a packing built of disks. However, they are still slightly denser, even for the rounded 25-gon, which is the highest-sided regular polygon studied here.
arXiv comment10 pages, 13 figures, 2 tables
References in corpus (20)
- Is Random Close Packing of Spheres Well Defined?
- Jammed Hard-Particle Packings: From Kepler to Bernal and Beyond
- Dense Packings of the Platonic and Archimedean Solids
- Random Sequential Addition of Hard Spheres in High Euclidean Dimensions
- Mean-field theory of random close packings of axisymmetric particles
- Fundamental challenges in packing problems: from spherical to non-spherical particles
- Basic Understanding of Condensed Phases of Matter via Packing Models
- Precise Algorithm to Generate Random Sequential Addition of Hard Hyperspheres at Saturation
- A fast algorithm for random sequential adsorption of discs
- In a search for a shape maximizing packing fraction for two-dimensional random sequential adsorption
- Boundary conditions in random sequential adsorption
- Random packing of regular polygons and star polygons on a flat two-dimensional surface
- Shape universality classes in the random sequential addition of non-spherical particles
- Precise algorithm to generate random sequential adsorption of hard polygons at saturation
- Properties of random sequential adsorption of generalized dimers
- Scaling properties of the number of random sequential adsorption iterations needed to generate saturated random packing
- Random sequential adsorption of Platonic and Archimedean solids
- Saturated random packing built of arbitrary polygons under random sequential adsorption protocol
- Effective modelling of adsorption monolayers built of complex molecules
- Optimal random deposition of interacting particles