The discrete element method (DEM) enables modeling of the behavior of granular materials and rock masses via the interaction of elements, as the whole model deforms under the applied loading. As a starting point of any DEM simulation, the computational domain needs to be filled with discrete elements. Disks are often used for 2D simulations to generate the model. There are techniques developed to fill a domain with disks, but some of them take considerable time, comparable to the DEM simulation itself. This article presents a parallel algorithm that can fill domains with a tight packing of disks. The algorithm is scalable and its implementation was tested on both a shared memory parallel computer and a multiprocessor, multicore workstation. The applicability of the algorithm in filling domains with disks is demonstrated on a practical example of ore flow at a drawpoint in mining. Copyright © 2008 John Wiley & Sons, Ltd.
[1]
Attila M. Zsaki.
An efficient method for packing polygonal domains with disks for 2D discrete element simulation
,
2009
.
[2]
LenoskiDaniel,et al.
The SGI Origin
,
1997
.
[3]
Liang Cui,et al.
Analysis of a triangulation based approach for specimen generation for discrete element simulations
,
2003
.
[4]
David R. Owen,et al.
Filling domains with disks: an advancing front approach
,
2003
.
[5]
P. Cundall,et al.
A discrete numerical model for granular assemblies
,
1979
.
[6]
Colin Thornton,et al.
3D DEM Simulations of Powder Compaction
,
2002
.