多分散系统不同粒径颗粒碰撞的多重八叉树搜索算法

Mutil-Octree Searching Algorithm for Different Size Particle Collision in Polydisperse Systems

利用线性八叉树的拓扑结构对八叉树大小邻居搜索算法进行改进,在V氏八叉树颗粒搜索算法的基础上提出了一种快速预判大小颗粒碰撞的多重八叉树搜索算法.新算法对各种粒径分布的颗粒系统均有较好的适应性,且受颗粒形状和堆积密度的影响较小.对一个包含大中小3种粒径的颗粒系统进行计算,并与V氏八叉树颗粒搜索算法结果进行比较,发现多重八叉树搜索算法在运行时间上有非常强的优势.

Preliminary contact detection algorithm for particle collision plays a very important role in the discrete element model for polydisperse flow systems. In this study, the neighbor finding algorithms of octree were improved using the topology of linear octree. A mutil-octree contact detection algorithm for different size particle collision was developed based on Vemuri-octree contact detection algorithm. The present algorithm is applicable in the polydisperse systems with different particle size distribution, irrespective of solid particle volumetric fraction and particle shape. The simulation of three-size particle collision indicates that the present algorithm is faster than Vemuri-octree contact detection algorithm.