Add to ORKGWe have developed an algorithm which allows to generate a large-scale random-close packing of spheres within a confined container of any arbitrary shape. In addition, the diameter of packing spheres can obey any specified distribution. The developed algorithm can be used for modelling of the geometrical microstructure of many physical and engineering systems, in particular, packed-bed equipment in chemical process industries, with further application to simulation of various physico-chemical phenomena in these systems
This dissertation describes an investigation of jammed packings of frictionless hard particles, incl...
We study the random close packing of a binary mixture of spheres and rod-like particles (spherocylin...
This paper describes a methodology for prediction of powder packing densities which employs a new ap...
We have developed an algorithm which allows to generate a large-scale random-close packing of sphere...
A modified collective rearrangement algorithm, based on the sphere-assembly representation of the pa...
An important step in the setup process of Discrete Element Model (DEM) simulations is the generation...
A relaxation algorithm is developed to simulate sphere packing with arbitrary diameter distribution....
We present simple computer algorithms able to build random packings of spheres using the ballistic d...
International audiencePowder-based microstructures are traditionally modelled using densely packed s...
127 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2008.Random packs of spheres have ...
This thesis deals with the random packing of colloids and granular matter. A random packing is a sta...
The aim of this work is to propose an algorithm to simulate the packed bed structure of mono-sized s...
The study of random packing of spheres has had a long history. It particularly interests many resear...
The mechanical contraction method for obtaining granular packings is introduced. This has resulted i...
Thesis (M.S.)--University of Kansas, Electrical Engineering & Computer Science, 2007.The random hete...
This dissertation describes an investigation of jammed packings of frictionless hard particles, incl...
We study the random close packing of a binary mixture of spheres and rod-like particles (spherocylin...
This paper describes a methodology for prediction of powder packing densities which employs a new ap...
We have developed an algorithm which allows to generate a large-scale random-close packing of sphere...
A modified collective rearrangement algorithm, based on the sphere-assembly representation of the pa...
An important step in the setup process of Discrete Element Model (DEM) simulations is the generation...
A relaxation algorithm is developed to simulate sphere packing with arbitrary diameter distribution....
We present simple computer algorithms able to build random packings of spheres using the ballistic d...
International audiencePowder-based microstructures are traditionally modelled using densely packed s...
127 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2008.Random packs of spheres have ...
This thesis deals with the random packing of colloids and granular matter. A random packing is a sta...
The aim of this work is to propose an algorithm to simulate the packed bed structure of mono-sized s...
The study of random packing of spheres has had a long history. It particularly interests many resear...
The mechanical contraction method for obtaining granular packings is introduced. This has resulted i...
Thesis (M.S.)--University of Kansas, Electrical Engineering & Computer Science, 2007.The random hete...
This dissertation describes an investigation of jammed packings of frictionless hard particles, incl...
We study the random close packing of a binary mixture of spheres and rod-like particles (spherocylin...
This paper describes a methodology for prediction of powder packing densities which employs a new ap...