Random particle packing by reduced dimension algorithms
- 15 January 1990
- journal article
- Published by AIP Publishing in Journal of Applied Physics
- Vol. 67 (2) , 1022-1029
- https://doi.org/10.1063/1.345785
Abstract
A new type of Monte Carlo algorithm to calculate packing fraction and general particle dispersion characteristics for arbitrary random packs of spherical particles is presented. Given arbitrary quantities of arbitrary sizes with arbitrary mass densities, the algorithms calculate the close random packing fraction. If desired, they can return the position and type of each particle in the pack. Since every detail of the positions and types of particles in the pack is known, any pack characteristic can be calculated. The algorithms use a dimension-reducing trick to turn a computationally intractable problem into a tractable one. Planned extensions and improvements of the algorithms are discussed.This publication has 15 references indexed in Scilit:
- Porosity estimation for random packings of spherical particlesIndustrial & Engineering Chemistry Fundamentals, 1984
- Porosity of a mass of solid particles having a range of sizesIndustrial & Engineering Chemistry Fundamentals, 1981
- Estimation of the Average Number of Contacts between Randomly Mixed Solid ParticlesIndustrial & Engineering Chemistry Fundamentals, 1980
- Random packings and the structure of simple liquids. I. The geometry of random close packingProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1970
- Vibratory Compaction: I, Compaction of Spherical ShapesJournal of the American Ceramic Society, 1965
- Mechanical Packing of Spherical ParticlesJournal of the American Ceramic Society, 1961
- Packing of Spheres: Co-ordination of Randomly Packed SpheresNature, 1960
- Geometry of the Structure of Monatomic LiquidsNature, 1960
- A Geometrical Approach to the Structure Of LiquidsNature, 1959
- THE PACKING OF PARTICLES1Journal of the American Ceramic Society, 1930