An Efficient Algorithm for Detecting Particle Contact in Non-Uniform Particulate System
The algorithm for detecting particle collision plays an important role in the discrete node method (DEM) for the simulation of granular flow systems since the time for detecting the contact pairs usually occupy a considerable proportion of the total CPU time for the simulation, up to 60 percent in some cases. In this study, we developed a new algorithm of octree, or mutil-octree algorithm, for detecting candidate contact pairs. The so-called mutil-octree algorithm adopts the topology of mutil-octree for detecting possible contacts, in which the particles are dealt with hierarchy in light of particle size and then mapped into different level nodes of an octree, instead of mapping all of particles into the leaf nodes of an octree. The present algorithm speeds the detecting process with the decrease of the contact particle pairs. A non-uniform particulate system with three kinds of particle size was simulated based on the multi-octree algorithm. The simulation results showed that the multi-octree algorithm consumes much shorter time than Vemuri-octree algorithm in which the non-uniform particulates treated as an identical particle system, especially for large number of particle systems. Besides, the computational complexity of mutil-octree algorithm is relatively independent of solid particle volumetric fraction and particle shape, similar to Vemuri-octree algorithm.
particle collision non-uniform particulate system octree
Zhaolin GU Layi LU
Xian Jiaotong University,School of Human Settlements and Civil Engineering,Xian 710049,China Xian Jiaotong University,School of Energy and Power Engineering,Xian 710049,China
国际会议
北京
英文
325-334
2008-09-24（万方平台首次上网日期，不代表论文的发表时间）