An effective optics-electrochemistry approach to random packing density of non-equiaxed ellipsoids

Materialia ◽  
2020 ◽  
Vol 12 ◽  
pp. 100750
Author(s):  
Hanqing Dai ◽  
Wenqian Xu ◽  
Zhe Hu ◽  
Yuanyuan Chen ◽  
Bobo Yang ◽  
...  
Keyword(s):  
Packing Density ◽  
Random Packing

The random packing of fibres in three dimensions

1995 ◽  
Vol 451 (1943) ◽  
pp. 737-746 ◽  
Keyword(s):  
Packing Density ◽  
Volume Fraction ◽  
Random Packing ◽  
Experimental Results ◽  
Three Dimensions ◽  
Approximate Relationship

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.

Random sequential coding by Hamming distance

1986 ◽  
Vol 23 (03) ◽  
pp. 688-695 ◽  
Author(s):  
Yoshiaki Itoh ◽  
Herbert Solomon
Keyword(s):  
Computer Simulations ◽  
Packing Density ◽  
Hamming Distance ◽  
Random Packing ◽  
Empirical Constant ◽  
Simple Cubic ◽  
Simulation Results ◽  
Simple Models

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.

Statistical geometrical approach to random packing density of equal spheres

Nature ◽  
1974 ◽  
Vol 252 (5480) ◽  
pp. 202-205 ◽  
Author(s):  
Keishi Gotoh ◽  
John L. Finney
Keyword(s):  
Packing Density ◽  
Random Packing ◽  
Geometrical Approach

Random sequential coding by Hamming distance

1986 ◽  
Vol 23 (3) ◽  
pp. 688-695 ◽  
Author(s):  
Yoshiaki Itoh ◽  
Herbert Solomon
Keyword(s):  
Computer Simulations ◽  
Packing Density ◽  
Hamming Distance ◽  
Random Packing ◽  
Empirical Constant ◽  
Simple Cubic ◽  
Simulation Results ◽  
Simple Models

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.

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
Keyword(s):  
Packing Density ◽  
Particle Shape ◽  
Amorphous Solids ◽  
Random Packing

Shape effects on the random-packing density of tetrahedral particles

2012 ◽  
Vol 86 (3) ◽  
Author(s):  
Jian Zhao ◽  
Shuixiang Li ◽  
Weiwei Jin ◽  
Xuan Zhou
Keyword(s):  
Packing Density ◽  
Random Packing ◽  
Shape Effects

Numerical test of Palásti's conjecture on two-dimensional random packing density

Nature ◽  
1975 ◽  
Vol 254 (5498) ◽  
pp. 318-319 ◽  
Author(s):  
YOSHIAKI AKEDA ◽  
MOTOO HORI
Keyword(s):  
Packing Density ◽  
Numerical Test ◽  
Random Packing ◽  
Two Dimensional

A constraint on the random packing of disks

1993 ◽  
Vol 30 (01) ◽  
pp. 263-268
Author(s):  
Richard Cowan
Keyword(s):  
Packing Density ◽  
Random Packing ◽  
Classical Geometry

This paper addresses random packing of equal-sized disks in a manner such that no disk has a gap on its circumference large enough to accommodate an extra touching neighbour. This structure generalises the deterministic packing models discussed in classical geometry (Coxeter (1961), Hilbert and Cohn-Vossen (1952)). Relationships with the dual mosaic formed by joining the centres of touching disks are established. Constraints on the neighbourhood of disks and on the packing density are established.

Sign in / Sign up

Export Citation Format

Share Document