Saturated random packing built of arbitrary polygons under random sequential adsorption protocol

Abstract

Random packings and their properties are a popular and active field of research. Numerical algorithms that can efficiently generate them are useful tools in their study. This paper focuses on random packings produced according to the random sequential adsorption (RSA) protocol. Developing the idea presented in [G. Zhang, Phys. Rev. E {\bf 97}, 043311 (2018)], where saturated random packings built of regular polygons were studied, we create an algorithm that generates strictly saturated packings built of any polygons. Then, the algorithm was used to determine the packing fractions for arbitrary triangles. The highest mean packing density, $0.552814\pm 0.000063$, was observed for triangles of side lengths $0.63:1:1$. Additionally, microstructural properties of such packings, kinetics of their growth as well as distributions of saturated packing fractions and the number of RSA iterations needed to reach saturation were analyzed.

7 pages, 13 figures

References in corpus (12)

• Is Random Close Packing of Spheres Well Defined?
• Mean-field theory of random close packings of axisymmetric particles
• 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
• Scaling properties of the number of random sequential adsorption iterations needed to generate saturated random packing
• Random sequential adsorption of particles with tetrahedral symmetry
• Effective modelling of adsorption monolayers built of complex molecules

Cited by in corpus (5)

• Algorithms to generate saturated random sequential adsorption packings built of rounded polygons
• Kinetics of random sequential adsorption of two-dimensional shapes on a one-dimensional line
• Examination of saturation coverage of polygons using random sequential adsorption algorithm
• Treating random sequential addition via the replica method
• Random sequential adsorption of aligned regular polygons and rounded squares: Transition in the kinetics of packing growth