English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Random sequential adsorption (RSA) is a time-dependent packing process, inwhich particles of certain shapes are randomly and sequentially placed into anempty space without overlap. In the infinite-time limit, the density approachesa "saturation" limit. Although this limit has attracted particular researchinterest, the majority of past studies could only probe this limit byextrapolation. We have previously found an algorithm to reach this limit usingfinite computational time for spherical particles, and could thus determine thesaturation density of spheres with high accuracy. In this paper, we generalizethis algorithm to generate saturated RSA packings of two-dimensional polygons.We also calculate the saturation density for regular polygons of three to tensides, and obtain results that are consistent with previous,extrapolation-based studies.

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