Precise determination of the saturation coverage of polygons in silico using exclusion assisted packing technique

From MaRDI portal
Publication:6043465

DOI10.1007/S10955-023-03097-4zbMATH Open1514.60017arXiv2212.13849OpenAlexW4367316321MaRDI QIDQ6043465FDOQ6043465


Authors: Aref Abbasi Moud Edit this on Wikidata


Publication date: 23 May 2023

Published in: Journal of Statistical Physics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/2212.13849




Recommendations




Cites Work


Cited In (1)





This page was built for publication: Precise determination of the saturation coverage of polygons in silico using exclusion assisted packing technique

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6043465)