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

Source: [Saturated random packing built of arbitrary polygons under random sequential adsorption protocol](<https://www.sota2.com/research/paper/68fa3b2b1e209131ce8d0ad2>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-27T04:00:29.326Z

Authors: Micha{\\l} Cie\\'sla, Piotr Kubala, Ge Zhang

Published: 2019-11-28T10:23:45.000Z

## Abstract

Random packings and their properties are a popular and active field of research. Numerical algorithms that can efficiently generate them are useful tools in their study. This paper focuses on random packings produced according to the random sequential adsorption (RSA) protocol. Developing the idea presented in \[G. Zhang, Phys. Rev. E {\\bf 97}, 043311 (2018)\], where saturated random packings built of regular polygons were studied, we create an algorithm that generates strictly saturated packings built of any polygons. Then, the algorithm was used to determine the packing fractions for arbitrary triangles. The highest mean packing density, $0.552814 \\pm 0.000063$, was observed for triangles of side lengths $0.63:1:1$. Additionally, microstructural properties of such packings, kinetics of their growth as well as distributions of saturated packing fractions and the number of RSA iterations needed to reach saturation were analyzed.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1911.12626>)

[PDF](<https://arxiv.org/pdf/1911.12626.pdf>)