Answers are grounded in this paper and cite their sources.
The paper presents an algorithm to generate two-dimensional, saturated random sequential adsorption packings of identical, unoriented, anisotropic convex shapes. The method consists in tracking regions where the next shape can be added. The algorithm was tested on packings built of spherocylinders and ellipses of different width-to-height ratio. Obtained packing fractions at saturation agree with earlier predictions using an estimation of the saturated packing fraction based on the kinetics of packing growth, but they are much more accurate. Additionally, we discuss how to increase packing generation speed using parallel computations.
No takes yet. Share an insight, caveat, or question.
Haiduk et al. (2018) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: