Algorithms to generate saturated random sequential adsorption packings built of rounded polygons.

Abstract

We present the algorithm for generating strictly saturated random sequential adsorption packings built of rounded polygons. It can be used in studying various properties of such packings built of a wide variety of different shapes, and in modeling monolayers obtained during 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 the packing fraction grows with an increasing number of polygon sides, here 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 higher, even for the rounded 25-gon, which is the highest-sided regular polygon studied here.