Statistical geometry of particle packings. I. Algorithm for exact determination of connectivity, volume, and surface areas of void space in monodisperse and polydisperse sphere packings
Open Access
- 1 November 1997
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 56 (5) , 5524-5532
- https://doi.org/10.1103/physreve.56.5524
Abstract
Packings of spheres serve as useful models of the geometry of many physical systems; in particular, the description of the void region in such packings (the region not occupied by the spheres) is crucial in many studies. The void region is, in general, composed of disconnected cavities. We present an algorithm for decomposing void space into cavities and determining the exact volumes and surface areas of such cavities in three-dimensional packings of monodisperse and polydisperse spheres.Keywords
This publication has 20 references indexed in Scilit:
- Statistical geometry of particle packings. II. “Weak spots” in liquidsPhysical Review E, 1997
- Network Approach to Void Percolation in a Pack of Unequal SpheresPhysical Review Letters, 1996
- Algorithm to compute void statistics for random arrays of disksPhysical Review E, 1995
- Statistical geometry in the study of fluids and porous mediaThe Journal of Physical Chemistry, 1992
- Nearest-neighbor distribution functions in many-body systemsPhysical Review A, 1990
- Equivalence of the void percolation problem for overlapping spheres and a network problemJournal of Physics A: General Physics, 1983
- Hidden structure in liquidsPhysical Review A, 1982
- Statistical mechanical considerations on the random packing of granular materialsPowder Technology, 1980
- Statistical geometry of hard-sphere systemsJournal of the Chemical Society, Faraday Transactions 2: Molecular and Chemical Physics, 1980
- Hydrophobic bonding and accessible surface area in proteinsNature, 1974