论文标题
使用随机顺序吸附算法检查多边形的饱和覆盖率
Examination of saturation coverage of polygons using random sequential adsorption algorithm
论文作者
论文摘要
随机顺序吸附（RSA）的目标是一种时间依赖的填料方法，是为空空间的常规或不对称覆盖物创建可以适合分配空间而无需重叠的空白。覆盖范围的密度倾向于在无限时间限制下达到极限。我们试图估计定向2D多边形的饱和堆积，包括正方形（4侧），常规的五边形（5侧），常规的六边形（6侧），常规七个（7侧），常规的八角形（8侧），常规非ag子（9侧），常规脱摩术（10侧）和常规二十甲板（常规odece）（正常的dodececags）（固定的dodecags）（这）（12侧）（12）。我们获得了与以前基于外推的研究一致的结果1。我们利用“分离轴定理”来确定到达多边形和先前放置的多边形之间是否存在重叠。根据我们的说法，当RSA添加过速时，饱和度被认为已达到下限。
The goal of random sequential adsorption (RSA), a time-dependent packing method, is to create a regular or asymmetric covering of an empty space that can fit in the allocated space without overlapping. The density of coverage tends to reach a limit in the infinite-time limit. We attempt to estimate saturated packing of oriented 2-D polygons, including squares(4-sides), regular pentagons (5-sides), regular hexagons (6-sides), regular heptagons (7-sides), regular octagons (8-sides), regular nonagons (9-sides), regular decagons (10-sides), and regular dodecagons (12-sides), in this study. We obtained results that are consistent with previous, extrapolation-based studies1. We utilised the "separating axis theorem" to determine if there is overlap between arriving polygons and those that have previously been placed. Saturation as a lower limit is considered to have been reached when RSA addition becomes excessively slow, according to us.
