M. Smoluchowski Institute of Physics, Department of Statistical Physics, Jagiellonian University, Łojasiewicza 11, 30-348 Kraków, Poland.
Department of Physics, University of Pennsylvania, Philadelphia, Pennsylvania 19104, USA.
Phys Rev E. 2019 Dec;100(6-1):062901. doi: 10.1103/PhysRevE.100.062901.
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 by G. Zhang [Phys. Rev. E 97, 043311 (2018)2470-004510.1103/PhysRevE.97.043311], 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±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.
随机堆积及其性质是一个热门且活跃的研究领域。能够高效生成它们的数值算法是研究它们的有用工具。本文专注于根据随机顺序吸附（RSA）协议生成的随机堆积。我们开发了 G. Zhang 提出的思想[Phys. Rev. E 97, 043311 (2018)2470-004510.1103/PhysRevE.97.043311]，研究了由正多边形构建的饱和随机堆积，创建了一个可以生成由任何多边形构建的严格饱和堆积的算法。然后，该算法用于确定任意三角形的堆积分数。边长为 0.63:1:1 的三角形观察到的最高平均堆积密度为 0.552814±0.000063。此外，还分析了此类堆积的微观结构特性、生长动力学以及饱和堆积分数分布和达到饱和所需的 RSA 迭代次数分布。
