Random sequential adsorption of unoriented cuboids with a square base and a comparison of cuboid-cuboid intersection tests
classification
❄️ cond-mat.mtrl-sci
keywords
cuboidspackingadsorptionbasecuboid-cuboidintersectionrandomsequential
read the original abstract
In the paper, packings built of identical cuboids with a square base created by random sequential adsorption are studied. The result of the study show that the packing of the highest density are obtained for oblate and prolate cuboids of the edge-edge length ratios of $0.7$ and $1.4$. For both cases, the packing fraction is $0.400 \pm 0.002$, which is approximately 8% higher than the value reported for cubes. Additionally, because the crucial part of the packing generation algorithm is the cuboid-cuboid intersection detection, several methods were tested. It appears that the fastest one is based on the separating axis theorem.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.