General advancing front packing algorithm for the discrete element method

Morfa, Carlos Alexander Recarey; Morales, Irvin Pablo Pérez; Farias, Márcio Muniz de; Navarra, Eugenio Oñate Ibáñez de; Valera, Roberto Roselló; Casañas, Harold Díaz-Guzmán

doi:10.1007/s40571-016-0144-1

Cited by 12 publications

(8 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finding neighboring particles around a point is a recurring and important task in packing generation algorithms according to the many previous studies. 13,18,[26][27][28][29] Neighbor and contact detection are procedures that form the core of our algorithm and they are repeated many times. We use a hash grid, 30,31 which is a uniform grid variation that divides the space into a set of equal-sized buckets.…”

Section: Particle Search and Spatial Indexmentioning

confidence: 99%

See 1 more Smart Citation

A new constructive algorithm for random polydisperse dense disk pack generation

Lozano

Gattass

2021

Numerical Meth Engineering

View full text Add to dashboard Cite

This article presents a novel strategy for the non-overlapping disk-packing problem for generating dense random assemblies. The proposed geometric algorithm adopts an advancing-front approach that uses novel heuristics to determine the next positions for incoming particles with support from a polygonal mesh. Additionally, we propose strategies to improve generation at the pack's interior and near container borders. Experiments demonstrate that our algorithm outperforms previous methods in terms of the desired particle radius distribution function, packing density, and mean number of particle contacts.

show abstract

Section: Particle Search and Spatial Indexmentioning

confidence: 99%

“…Finding neighboring particles around a point is a recurring and important task in packing generation algorithms according to the many previous studies 13,18,26‐29 …”

Section: Advancing Front Approach Reviewmentioning

confidence: 99%

A new constructive algorithm for random polydisperse dense disk pack generation

Lozano

Gattass

2021

Numerical Meth Engineering

View full text Add to dashboard Cite

show abstract

“…They do not depend on the type of particle, and may be a valid alternative when the exact methods demand a high computational cost. The authors have applied the binary approach to polyhedra, superquadrics and spherocylinders, and the direct approach to clusters of disks or spheres [32]. To apply the direct approach, it is necessary to know how to calculate a directional distance between particles, and to apply the binary approach it is enough to have a function for detecting intersections between particles.…”

Section: -Construction Of a Particle In Outer Contact With Othersmentioning

confidence: 99%

Advances in particle packing algorithms for generating the medium in the Discrete Element Method

Recarey

Pérez

Roselló

et al. 2019

Computer Methods in Applied Mechanics and Engineering

Self Cite

View full text Add to dashboard Cite

Several theoretical contributions in order to establish a particle packing methodology are presented. In this respect, a generic formulation of a new method for packing particles based on a constructive advancing front method, which uses Monte Carlo techniques for the generation of particle dimensions, is also shown. The method can be used to obtain virtual dense packings of particles with several geometrical shapes. It employs continuous, discrete and empirical statistical distributions in order to generate the dimensions of particles. The packing algorithm is very flexible and allows alternatives for: 1-The direction of the advancing front (inwards or outwards), 2-The selection of the local advancing front, 3-The method for placing a mobile particle in contact with others and 4-The overlap checks. The algorithm also allows obtaining highly porous media when it is slightly modified. Practical applications of the formulations are presented in the end of this paper.

show abstract

“…However, the particle density can reach more than 0.60 based on the physical principle. The other is the construction method [2,[18][19][20][21][22] which is based on the pure geometric algorithm. The radius and position of particles are determined through geometric calculation without involving mechanical calculation.…”

Section: Introductionmentioning

confidence: 99%

A Fast Algorithm for Particle Stacking

Meng¹,

Zhang²

2019

ISI

View full text Add to dashboard Cite

The purpose of this study was to investigate the generation of non-overlapping particle sets quickly and accurately that meet specified conditions in the preparatory stage of discrete element simulation. A fast-geometric particle stackinfg algorithm based on geometric and grid search method was proposed for the generation of particle stacking, which is used to generate large particles, then generated small particles and fill them. The results indicated when the velocity of particle generation was too slow, the new position of two or three contacts should be adjusted to accommodate more particles in the current particle diameter range. Moreover, the calculation example showed that under the condition of a specified particle gradation, particle sets with different void ratios could be generated according to the need for discrete element simulation. The time to generate the particle sets is linear with the number of particles, and the algorithm takes less time. The findings of this study may serve as the generation of non-overlapping particle sets for meeting specified conditions in discrete element simulation.

show abstract

General advancing front packing algorithm for the discrete element method

Cited by 12 publications

References 39 publications

A new constructive algorithm for random polydisperse dense disk pack generation

A new constructive algorithm for random polydisperse dense disk pack generation

Advances in particle packing algorithms for generating the medium in the Discrete Element Method

A Fast Algorithm for Particle Stacking

Contact Info

Product

Resources

About