| 多分散系统不同粒径颗粒碰撞的多重八叉树搜索算法 |
| |
| 引用本文： | 鲁录义,周逢森,冯诗愚,顾兆林.多分散系统不同粒径颗粒碰撞的多重八叉树搜索算法[J].西安交通大学学报,2008,42(3):304-308. |
| |
| 作者姓名： | 鲁录义 周逢森 冯诗愚 顾兆林 |
| |
| 作者单位： | [1]西安交通大学能源与动力工程学院,西安710049 [2]西安交通大学人居环境与建筑工程学院,西安710049 |
| |
| 基金项目： | 国家自然科学基金资助项目（40675011）;陕西省科技攻关计划资助项目（2004K08-G15）. |
| |
| 摘 要： | 利用线性八叉树的拓扑结构对八叉树大小邻居搜索算法进行改进，在Ⅴ氏八叉树颗粒搜索算法的基础上提出了一种快速预判大小颗粒碰撞的多重八叉树搜索算法．新算法对各种粒径分布的颗粒系统均有较好的适应性，且受颗粒形状和堆积密度的影响较小．对一个包含大中小3种粒径的颗粒系统进行计算，并与Ⅴ氏八叉树颗粒搜索算法结果进行比较，发现多重八叉树搜索算法在运行时间上有非常强的优势．
|
| 关 键 词： | 颗粒碰撞 多分散系统 八叉树 |
| 文章编号： | 0253-987X（2008）03-0304-05 |
| 收稿时间： | 2007-05-29 |
| 修稿时间： | 2007年5月29日 |
Mutil-Octree Searching Algorithm for Different Size Particle Collision in Polydisperse Systems |
| |
| LU Luyi , ZHOU Fengsen, FENG Shiyu , GU Zhaolin.Mutil-Octree Searching Algorithm for Different Size Particle Collision in Polydisperse Systems[J].Journal of Xi'an Jiaotong University,2008,42(3):304-308. |
| |
| Authors: | LU Luyi ZHOU Fengsen FENG Shiyu GU Zhaolin |
| |
| Abstract: | 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. |
| |
| Keywords: | particle collision polydisperse octree |
| 本文献已被 维普 等数据库收录！ |
