Steepest descent ballistic deposition of complex shaped particles
Steepest descent ballistic deposition of complex shaped particles
复制标题
复杂形状颗粒的最速下降弹道沉积
DOI：
10.1016/j.jcp.2015.12.052
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
Thorsten Pöschel
中科院分区：
文献类型：
--
作者：
Nikola Topić;Thorsten Pöschel
我们提出了一种有效的事件驱动算法，用于复杂形状刚性粒子的顺序弹道沉积。每个粒子都由可变半径的硬球体（通常为5…1000）构成。球体的大小和相对位置可以相互重叠，并且可以选择使所得到的颗粒表面看起来相对光滑。在连续沉积过程中，通过滚动和直线运动的步骤，颗粒沿着由边界和先前沉积的颗粒形成的景观中最陡峭的下降方向移动。模拟沉积过程的计算机时间取决于球体的总数，但对颗粒的大小和形状的影响很小。该算法将常用于球形堆积的Visscher-Bolsterli算法推广到非球形颗粒。提出的事件驱动算法允许使用台式计算机模拟数百万粒子系统。
We present an efficient event-driven algorithm for sequential ballistic deposition of complex-shaped rigid particles. Each of the particles is constructed from hard spheres (typically 5… 1000) of variable radii. The sizes and relative positions of the spheres may mutually overlap and can be chosen such that the surface of the resulting particle appears relatively smooth. In the sequential deposition process, by performing steps of rolling and linear motion, the particles move along the steepest descent in a landscape formed by the boundaries and previously deposited particles. The computer time for the simulation of a deposition process depends on the total number of spheres but only weakly on the sizes and shapes of the particles. The proposed algorithm generalizes the Visscher–Bolsterli algorithm [1] which is frequently used for packing of spheres, to non-spherical particles. The proposed event-driven algorithm allows simulations of multi-million particle systems using desktop computers.