High‐density sphere packing for discrete element method simulations
By C. Labra, Eugenio Oñate. 2009
115 citations recorded by the source corpus.
The first step in a discrete element simulation is the discretization of the domain into a set of particles. The cost of generating a good cylindrical or spherical packing has resulted in a great number of approaches during the last years. A new algorithm is proposed for high-density packing using a scheme that minimizes the distance between each particle. Using the support of a finite element mesh, less time is needed in order to achieve a low porosity configuration. In addition, a boundary constraint is introduced. The application of the same optimization scheme is used as a condition to force a good surface definition. The results obtained show a high efficiency for the generation of low porosity packing, achieving values smaller than 10% in 2D cases and 30% in 3D cases. Copyright © 2008 John Wiley & Sons, Ltd.
Subfields: Computational Mechanics, Mechanical Engineering, Mechanics of Materials
View Paper: https://www.semanticscholar.org/paper/1c67908f9debf6ac2fd42299ea5d55d2712aeca1
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Mechanics
In Mechanical Engineering
In Mechanics of Materials
Citations in the corpus
- Comparative study of different discrete element models and evaluation of equivalent micromechanical parameters (2012, methodology): “The first particle assembly has been generated using a special algorithm developed by Labra and Oñate (2009) and the second one has been obtained using a collective rearrangement algorithm with an imposed uniform particle size distribution, similar to the algorithm of Lubachevsky and Stillinger…”