Precise algorithm to generate random sequential adsorption of hard polygons at saturation

Abstract

Random sequential adsorption (RSA) is a time-dependent packing process, in which particles of certain shapes are randomly and sequentially placed into an empty space without overlap. In the infinite-time limit, the density approaches a "saturation" limit. Although this limit has attracted particular research interest, the majority of past studies could only probe this limit by extrapolation. We have previously found an algorithm to reach this limit using finite computational time for spherical particles, and could thus determine the saturation density of spheres with high accuracy. In this paper, we generalize this algorithm to generate saturated RSA packings of two-dimensional polygons. We also calculate the saturation density for regular polygons of three to ten sides, and obtain results that are consistent with previous, extrapolation-based studies.

References in corpus (10)

• Random Sequential Addition of Hard Spheres in High Euclidean Dimensions
• Precise Algorithm to Generate Random Sequential Addition of Hard Hyperspheres at Saturation
• A fast algorithm for random sequential adsorption of discs
• Continuum random sequential adsorption of polymer on a flat and homogeneous surface
• Boundary conditions in random sequential adsorption
• Random packing of regular polygons and star polygons on a flat two-dimensional surface
• Random Sequential Adsorption, Series Expansion and Monte Carlo Simulation
• Shapes for maximal coverage for two-dimensional random sequential adsorption
• Modelling of interacting dimer adsorption
• Random Sequential Adsorption of Oriented Superdisks

Cited by in corpus (12)

• Basic Understanding of Condensed Phases of Matter via Packing Models
• Random sequential adsorption of Platonic and Archimedean solids
• Saturated random packing built of arbitrary polygons under random sequential adsorption protocol
• Morphology and Kinetics of Random Sequential Adsorption of Superballs: From Hexapods to Cubes
• Algorithms to generate saturated random sequential adsorption packings built of rounded polygons
• Random sequential adsorption of partially ordered discorectangles onto a continuous plane
• Kinetics of random sequential adsorption of two-dimensional shapes on a one-dimensional line
• Two-stage random sequential adsorption of discorectangles and disks on a two-dimensional surface
• Effective modelling of adsorption monolayers built of complex molecules
• Examination of saturation coverage of polygons using random sequential adsorption algorithm
• Random sequential adsorption of aligned rectangles with two discrete orientations: Finite-size scaling effects
• Random sequential adsorption of aligned regular polygons and rounded squares: Transition in the kinetics of packing growth