Department of Physics, University of Pennsylvania, Philadelphia, Pennsylvania 19104, USA.
Phys Rev E. 2018 Apr;97(4-1):043311. doi: 10.1103/PhysRevE.97.043311.
Random sequential adsorption (RSA) is a time-dependent packing process, in which particles of certain shapes are randomly and sequentially placed into an empty space without overlap. In the infinite-time limit, the density approaches a "saturation" limit. Although this limit has attracted particular research interest, the majority of past studies could only probe this limit by extrapolation. We have previously found an algorithm to reach this limit using finite computational time for spherical particles and could thus determine the saturation density of spheres with high accuracy. In this paper, we generalize this algorithm to generate saturated RSA packings of two-dimensional polygons. We also calculate the saturation density for regular polygons of three to ten sides and obtain results that are consistent with previous, extrapolation-based studies.
随机顺序吸附（RSA）是一种时间相关的填充过程，其中具有特定形状的颗粒随机且顺序地放置在没有重叠的空空间中。在无限时间极限下，密度趋近于“饱和”极限。尽管这个极限引起了特别的研究兴趣，但过去的大多数研究只能通过外推来探测这个极限。我们之前发现了一种使用有限计算时间达到这个极限的算法，用于球形颗粒，因此可以高精度地确定球体的饱和密度。在本文中，我们将该算法推广到二维多边形的饱和 RSA 堆积中。我们还计算了三到十边的正多边形的饱和密度，并得到了与以前基于外推的研究一致的结果。
