Examination of saturation coverage of polygons using random sequential adsorption algorithm
arXiv:2212.13849 · doi:10.1007/s10955-023-03097-4
Abstract
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.
12 Pages, 4 Figures
References in corpus (6)
- In a search for a shape maximizing packing fraction for two-dimensional random sequential adsorption
- Structural transitions in granular packs: statistical mechanics and statistical geometry investigations
- Properties of random sequential adsorption of generalized dimers
- Saturated random packing built of arbitrary polygons under random sequential adsorption protocol
- Algorithms to generate saturated random sequential adsorption packings built of rounded polygons
- Optimal random deposition of interacting particles