摘要
基于隐式网格的空间剖分,采用包围体技术将离散块体通过链表进行表述.所有离散块体的循环可以改造成一个等价的循环模式,在该循环模式内部的操作既不依赖于隐式网格的横向数目,也不依赖于其竖向数目.因此,该新循环模式所需的接触检测CPU总时间不再依赖于隐式网格的数目,即接触检测所需CPU总时间为块体数量的线性函数.算例和数值试验表明:用于接触检测的CPU总时间正比于离散块体的数目;相对于传统方法,该方法可以大大减少接触检测的CPU时间,显著提高计算效率.
Linked lists were used for expressing discrete blocks based on the procedure of bounding volume and the implicit grids of space decomposition. And an equivalent loop mode, in which the inner processing depended neither on the horizontal number nor on the vertical number of implicit grids, was obtained from the loop of all discrete blocks. Then, it depended neither on the size of the finite space of discrete mass distribution nor on the number of the discrete blocks. So, the CPU time for contact detection was in direct proportion to the number of blocks. The main results obtained from some examples and numerical tests indicate that the CPU time for contact detection is only in direct proportion to the number of blocks and that the CPU time for contact detection is less with respect to conventional methods.
出处
《上海交通大学学报》
EI
CAS
CSCD
北大核心
2014年第6期888-892,共5页
Journal of Shanghai Jiaotong University
关键词
接触检测算法
隐式网格
包围体
DDA
contact detection procedure
implicit grids
bounding volume
discontinuous deformation analysis
