Effect of particle shape on the random packing density of amorphous solids

2011 ◽  
Vol 208 (10) ◽  
pp. 2299-2302 ◽  
Author(s):  
Andriy V. Kyrylyuk ◽  
Albert P. Philipse

An investigation has been carried out of the limiting packing density of an array of long straight rigid fibres distributed randomly in space as a function of the length of the fibre. We derive an approximate relationship between the limiting volume fraction V f and the slenderness λ of the fibres defined as length divided by diameter. The formula agrees well with our experimental results and those found in the literature.


2007 ◽  
Vol 534-536 ◽  
pp. 1621-1624
Author(s):  
Yuto Amano ◽  
Takashi Itoh ◽  
Hoshiaki Terao ◽  
Naoyuki Kanetake

For precise property control of sintered products, it is important to know the powder characteristics, especially the packing density of the powder. In a previous work, we developed a packing simulation program that could make a packed bed of spherical particles having particle size distribution. In order to predict the packing density of the actual powder that consisted of nonspherical particles, we combined the packing simulation with a particle shape analysis. We investigated the influence of the particle size distribution of the powder on the packing density by executing the packing simulation based on particle size distributions of the actual milled chromium powders. In addition, the influence of the particle shape of the actual powder on the packing density was quantitatively analyzed. A prediction of the packing density of the milled powder was attempted with an analytical expression between the particle shape of the powder and the packing simulation. The predicted packing densities were in good agreement with the actual data.


1986 ◽  
Vol 23 (03) ◽  
pp. 688-695 ◽  
Author(s):  
Yoshiaki Itoh ◽  
Herbert Solomon

Here we introduce two simple models: simple cubic random packing and random packing by Hamming distance. Consider the packing density γ d of dimension d by cubic random packing. From computer simulations up to dimension 11, γ d +1/γ d seems to approach 1. Also, we give simulation results for random packing by Hamming distance and discuss the behavior of packing density when dimensionality is increased. For the case of Hamming distances of 2 or 3, d–α fits the simulation results of packing density where α is an empirical constant. The variance of packing density is larger when k is even and smaller when k is odd, where k represents Hamming distance.


Nature ◽  
1974 ◽  
Vol 252 (5480) ◽  
pp. 202-205 ◽  
Author(s):  
Keishi Gotoh ◽  
John L. Finney

1986 ◽  
Vol 23 (3) ◽  
pp. 688-695 ◽  
Author(s):  
Yoshiaki Itoh ◽  
Herbert Solomon

Here we introduce two simple models: simple cubic random packing and random packing by Hamming distance. Consider the packing density γ d of dimension d by cubic random packing. From computer simulations up to dimension 11, γ d+1/γ d seems to approach 1. Also, we give simulation results for random packing by Hamming distance and discuss the behavior of packing density when dimensionality is increased. For the case of Hamming distances of 2 or 3, d–α fits the simulation results of packing density where α is an empirical constant. The variance of packing density is larger when k is even and smaller when k is odd, where k represents Hamming distance.


2012 ◽  
Vol 86 (3) ◽  
Author(s):  
Jian Zhao ◽  
Shuixiang Li ◽  
Weiwei Jin ◽  
Xuan Zhou

Nature ◽  
1975 ◽  
Vol 254 (5498) ◽  
pp. 318-319 ◽  
Author(s):  
YOSHIAKI AKEDA ◽  
MOTOO HORI

Sign in / Sign up

Export Citation Format

Share Document