硬多边形饱和随机序列吸附的精确算法
Precise algorithm to generate random sequential adsorption of hard polygons at saturation
摘要:
随机顺序吸附(RSA)是一种时间依赖的填充过程,其中某些形状的颗粒随机且顺序地放置到空的空间中而没有重叠。在无限时间的限制下,密度接近“饱和”极限。虽然这一极限引起了特别的研究兴趣,但过去的大多数研究只能通过外推来探索这一极限。我们以前已经找到了一种算法,以达到这一限制使用有限的计算时间的球形颗粒,从而可以确定具有高精度的球体的饱和密度。本文将该算法推广到二维多边形的饱和RSA包装。我们还计算了三到十边的正多边形的饱和密度,并获得了与以前的外推研究一致的结果。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。