Algorithms to generate saturated random sequential adsorption packings built of rounded polygons
| Autor: | Piotr Kubala, Michał Cieśla, Konrad Kozubek |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Statistical Mechanics (cond-mat.stat-mech)
Rounding Irreversible adsorption Regular polygon FOS: Physical sciences Radius Condensed Matter - Soft Condensed Matter Computer Science::Computational Geometry Atomic packing factor 01 natural sciences 010305 fluids & plasmas Condensed Matter::Soft Condensed Matter Random sequential adsorption 0103 physical sciences Polygon Soft Condensed Matter (cond-mat.soft) Limit (mathematics) 010306 general physics Algorithm Condensed Matter - Statistical Mechanics Mathematics |
| DOI: | 10.48550/arxiv.2105.11867 |
| Popis: | 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. Comment: 10 pages, 13 figures, 2 tables |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|