Summary
A computational algorithm for random complete packing by discs is proposed. Monte Carlo simulations using this algorithm give the value 0.5473 for random packing density of discs. It greatly improves the Solomon's result, 04756.
Similar content being viewed by others
References
Rényi, A. (1958). On a one-dimensional problem concerning random space filling,Publ. Math. Inst. Hung. Acad. Sci.,3, 109–127.
Page, E. S. (1959). The distribution of vacancies on a line,J. R. Statist. Soc., A,21, 364–374.
Mackenzie, J. K. (1962). Sequential filling of a line by intervals placed at random and its application to linear adsorption,J. Chem. Phys.,37, 723–728.
Bánkövi, G. (1962). On gaps generated by a random space filling procedure,Publ. Math. Inst. Hung. Acad. Sci.,7, 395–407.
Dvoretzky, A. and Robbins, H. (1964). On the “parking” problem,Publ. Math. Inst. Hung. Acad. Sci.,9, 209–225.
Mannion, D. (1964). Random space filling in one dimension,Publ. Math. Inst. Hung. Acad. Sci.,9, 143–154.
Palásti, I. (1960). On some random space filling problems,Publ. Math. Inst. Hung. Acad. Sci.,5, 353–360.
Solomon, H. (1967). Random packing density,Proc. Fifth Berkeley Symp. Math. Statist. Prob.,3, 119–134.
Blaisdell, B. E. and Solomon, H. (1970). On random sequential packing in the plane and a conjecture of Palásti,J. Appl. Prob.,7, 667–689.
Akeda, Y. and Hori, M. (1975). Numerical test of Palásti's cojecture on two-dimensional random packing density,Nature,254, 318–319.
Akeda, Y. and Hori, M (1976). On random sequential packing in two and three dimensions,Biometrika,63, 361–366.
Mannion, D (1976). Random packing of an interval,Adv. Appl. Prob.,8, 477–501.
Noguchi, K. and Hori, M. (1979). to be published.
Additional information
The Institute of Statistical Mathematics
About this article
Cite this article
Tanemura, M. On random complete packing by discs. Ann Inst Stat Math 31, 351–365 (1979). https://doi.org/10.1007/BF02480293
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02480293