A fast contact detection algorithm for 3-D discrete element method
A fast contact detection algorithm for 3-D discrete element method
复制标题
DOI：
10.1016/j.compgeo.2004.08.002
复制
发表时间：
2004-01-01
影响因子：
5.3
通讯作者：
Ghaboussi, J
中科院分区：
文献类型：
--
作者：
Nezami, EG;Hashash, YMA;Ghaboussi, J
在离散元方法中，确定每个时间步长处相互作用的粒子和相关接触法线之间的接触点是一项极其重要且耗时的计算。共平面（CP）算法是处理二维多边形或三维多面体粒子时更有效的接触检测方法之一。提出了一种称为快速公共平面（FCP）方法的新方法来寻找多边形粒子之间的公共平面。 FCP方法认识到公共平面具有识别特征，这大大减少了公共平面的搜索空间。在二维中，通过仅检查 5 个可能的候选平面来找到 CP。在三维空间中，候选平面属于与粒子的几何形状及其相对位置相关的 4 种类型。数值实验表明，在三维空间中，FCP 算法比现有的公共平面搜索方法快 40 倍。 (C) 2004 Elsevier Ltd. 保留所有权利。
In the discrete element method, determining the contact points between interacting particles and the associated contact normals at each time step is a critically important and time consuming calculation. Common-plane (CP) algorithm is one of the more effective methods for contact detection when dealing with two-dimensional polygonal or three-dimensional polyhedral particles. A new approach, called fast common plane (FCP) method, is proposed to find the common plane between polygonal particles. FCP approach recognizes that a common plane has identifying characteristics, which dramatically reduce the search space for the common plane. In two-dimensions, the CP is found by checking only 5 possible candidate planes. In three-dimensions, the candidate planes fall within 4 types related to the geometry of the particles and their relative positions. Numerical experiments reveal that in three dimensions FCP algorithm can be up to 40 times faster than available search methods for finding the common-plane. (C) 2004 Elsevier Ltd. All rights reserved.