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

DOI10.1007/S10955-023-03097-4MaRDI QIDQ6043465zbMATHOpenAlexFDO

Authors Aref Abbasi Moud

Publication date 23 May 2023

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

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

zbMATH Keywords

regular polygonsrandom sequential adsorption (RSA)RSA saturationseparating axis theoremvoxel elimination

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Stochastic particle methods (65C35) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

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.

Recommendations

• Random sequential adsorption of rounded rectangles, isosceles and right triangles
• scientific article; zbMATH DE number 2127464
• Numerical optimization method for packing regular convex polygons
• Evaluation and simulation of random sequential packing density for a small square
• Approximation algorithms for solving packing problems of convex polygons in plane

Cites work

• scientific article; zbMATH DE number 1595160 (Why is no real title available?)
• scientific article; zbMATH DE number 3171475 (Why is no real title available?)
• On random sequential packing in the plane and a conjecture of palasti
• On random sequential packing in two and three dimensions
• Random sequential packing inRⁿ
• Structural transitions in granular packs: statistical mechanics and statistical geometry investigations
• Theory of simple liquids. With applications to soft matter

Cited in

(1)

• Random sequential adsorption of rounded rectangles, isosceles and right triangles

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)