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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
