Random sequential packing of cuboids with infinite height. (English) Zbl 1474.60019
Summary: This article investigates a problem of random sequential packing of cuboids each axis of which is parallel to one of the three axes of the Cartesian coordinate system. In the random packing process we find a six-dimensional Markov chain. The Markov chain gives us not only an insight into the random packing process but also an efficient algorithm. By the simulation using the algorithm we find several properties of the completely packed rods. Main findings are that the number of cuboids of each direction axe nearly equal and the packing density tends to 3/4 when the system size becomes large.
MSC:
| 60D05 | Geometric probability and stochastic geometry |
References:
| [1] | CONWAY, J. H. and SLOANE, N. J. A. (1988) Sphere Packings, Lattices and Groups, Springer-Verlag, New York. · Zbl 0634.52002 |
| [2] | OGAWA, T., TESHIMA, Y. and WATANABE, Y. (1996) Geometry and crystallography of self-supporting rod structures, in KATACHI U SYMMETRY, pp. 239-246, Springer-Verlag, Heidelberg. |
| [3] | O��KEEFFE, M. (1977) Rod packings and crystal chemistry, Acta Cryst., A33, 914-923. |
| [4] | RÉNYI (1958) On a one-dimensional problem concerning random space filling, Publ. Math. Inst. Hung. Acad. Sci., 3, 109-127. · Zbl 0105.11903 |
| [5] | TANEMURA, M. (1979) On random complete packing by discs, Ann. Inst. Stat. Math., 31B, 351-365. · Zbl 0447.60007 |
| [6] | TANEMURA, M. (1992) Models and simulations of random structures of particles, Acta Stereol., II/Suppl., 41- 52. |
| [7] | TÓTH, L. F. (1972) Lagerungen in der Ebene, auf der Kugel und im Raum, Springer-Verlag, Heidelberg · Zbl 0052.18401 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
