计算物理 ›› 2007, Vol. 24 ›› Issue (5): 625-630.

• 研究论文 • 上一篇    

直径任意分布球填充的数值模拟

赵亮1, 李水乡1, 刘曰武2   

  1. 1. 北京大学工学院, 北京 100871;
    2. 中国科学院力学研究所, 北京 100080
  • 收稿日期:2006-05-15 修回日期:2006-10-18 出版日期:2007-09-25 发布日期:2007-09-25
  • 作者简介:赵亮(1981-),男,重庆,硕士生,从事球填充数值模拟研究.

Numerical Simulation of Sphere Packing with Arbitrary Diameter Distribution

ZHAO Liang1, LI Shuixiang1, LIU Yuewu2   

  1. 1. College of Engineering, Peking University, Beijing 100871, China;
    2. Institute of Mechanics, Chinese Academy of Sciences, Beijing 100080, China
  • Received:2006-05-15 Revised:2006-10-18 Online:2007-09-25 Published:2007-09-25

摘要: 提出球填充数值算法的新分类方法.改进原有的松弛算法,使其能够模拟直径任意分布的球填充问题,采用可变循环周期使不同球数情形下的填充率基本保持不变.算例数据表明,该算法的填充率和配位数均高于原算法.由于采用背景网格搜索和双向链表组数据结构,使得邻接球搜索效率有相当大的提高,算法的时间复杂度为O(N)(N为球数).在一台AMD Athlon 3200+PC上,对于10000个等径球的随机密排列,只需217s,填充率即可达到0.64.

关键词: 球填充, 松弛算法, 随机密排列, 背景网格法, 直径任意分布

Abstract: A relaxation algorithm is developed to simulate sphere packing with arbitrary diameter distribution.An adaptive iteration period is employed to keep the packing density stable with various number of spheres.The packing density and the coordinate number of the algorithm are higher than those of previous approaches.The efficiency of contact detection is considerably increased by background grids and double link group structure.The time complexity of the algorithm is O(N),where N is the number of spheres.It needs only CPU time of 217s to achieve a packing density of 0.64 for random close packing of 10 000 equal spheres with an AMD Athlon 3200+PC.New classification of numerical methods for sphere packing is also presented.

Key words: sphere packing, relaxation algorithm, random close packing, background grid, arbitrary diameter distribution

中图分类号: