Papers › Algorithms to generate saturated random sequential adsorption packings built of...
Algorithms to generate saturated random sequential adsorption packings built of rounded polygons
Michał Cieśla, Piotr Kubala, Konrad Kozubek
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We present the algorithm for generating strictly saturated random sequential adsorption packings built of rounded polygons. It can be used to study various properties of such packings built of a wide variety of different shapes and in modelling monolayers obtained during the irreversible adsorption processes of complex molecules. Here, we apply the algorithm to study the densities of packings built of rounded regular polygons. Contrary to packings built of regular polygons, where packing fraction grows with an increasing number of polygon sides, the packing fraction reaches its maximum for packings built of rounded regular triangles. With a growing number of polygon sides and increasing rounding radius, the packing fractions tend to the limit given by a packing built of disks. However, they are still slightly denser, even for the rounded 25-gon, which is the highest-sided regular polygon studied here.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections