Shortest Link Method For Contact Detection In Discrete Element Method
With the increasing demand for discrete element simulations with larger number of particles and more realistic particle geometries, the need for efficient contact detection algorithms is more evident. To date, the class of common plane (CP) methods is among the most effective and widely used contact detection algorithms in discrete element simulations of polygonal and polyhedral particles. This paper introduces a new approach to obtain the CP by employing a newly introduced concept of ‘shortest link’. Among all the possible line segments that connect any point on the surface of particle A to any point on the surface of particle B, the one with the shortest length defines the shortest link between the two particles. The perpendicular bisector plane of the shortest link fulfils all the conditions of a CP, suggesting that CP can be obtained by seeking the shortest link. A new algorithm, called shortest link method (SLM), is proposed to obtain the shortest link and subsequently the CP between any two polyhedral particles. Comparison of the analysis time between SLM and previously introduced algorithms demonstrate that SLM results in a substantial speed up for polyhedral particles contact detection.
Keywords: Discrete Element Method, Contact Detection, Common Plane, Polyhedral Particles