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 packings and their properties are a popular and active field ofresearch. Numerical algorithms that can efficiently generate them are usefultools in their study. This paper focuses on random packings produced accordingto the random sequential adsorption (RSA) protocol. Developing the ideapresented in [G. Zhang, Phys. Rev. E {\bf 97}, 043311 (2018)], where saturatedrandom packings built of regular polygons were studied, we create an algorithmthat generates strictly saturated packings built of any polygons. Then, thealgorithm was used to determine the packing fractions for arbitrary triangles.The highest mean packing density, $0.552814 \pm 0.000063$, was observed fortriangles of side lengths $0.63:1:1$. Additionally, microstructural propertiesof such packings, kinetics of their growth as well as distributions ofsaturated packing fractions and the number of RSA iterations needed to reachsaturation were analyzed.

Saturated random packing built of arbitrary polygons under random sequential adsorption protocol