A new algorithm for contact detection between convex polygonal and polyhedral particles in the discrete element method

We present an algorithm for contact detection between polygonal (2-D) or polyhedral (3-D) convex particles in the Discrete Element Method (DEM). Noting that the space occupied by a polygon or polyhedron can be defined using a set of linear inequalities, we show that the task of contact detection can be cast as a standard problem in the field of convex optimization, for which there exist established solution procedures. The contact detection algorithm consists of two stages; first to establish intersection and then to calculate the contact point. We can establish intersection between a pair of particles by solving a linear program and, if there is an intersection, use the analytic center of the linear inequalities as the contact point. Once the contact point is obtained, the contact normal can be calculated from the gradient vector of an inner “potential particle” whose corners are rounded (c.f. [13]). The necessary mathematics is presented. Six examples are included to assess the performance of the algorithm in terms of speed and accuracy.

[1]  R. Goodman.  Introduction to Rock Mechanics , 1980 .

[2]  Dawei Zhao,et al.  A fast contact detection algorithm for 3-D discrete element method , 2004 .

[3]  Chuin-Shan Chen,et al.  A non‐iterative derivation of the common plane for contact detection of polyhedral blocks , 2008 .

[4]  Václav Šmilauer,et al.  Cohesive Particle Model using the Discrete Element Method on the Yade Platform , 2010 .

[5]  Jordi Castro,et al.  Using the analytic center in the feasibility pump , 2011, Oper. Res. Lett..

[6]  Lorenz T. Biegler,et al.  On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , 2006, Math. Program..

[7]  Guy T. Houlsby,et al.  Potential particles: a method for modelling non-circular particles in DEM , 2009 .

[8]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[9]  A. M. Starfield,et al.  TOWARDS A METHODOLOGY FOR ROCK MECHANICS MODELLING , 1988 .

[10]  Raimund Seidel,et al.  Small-dimensional linear programming and convex hulls made easy , 1991, Discret. Comput. Geom..

[11]  Youssef M A Hashash,et al.  Shortest link method for contact detection in discrete element method , 2006 .

[12]  P. Cundall,et al.  FORMULATION OF A THREE-DIMENSIONAL DISTINCT ELEMENT MODEL - PART II. MECHANICAL CALCULATIONS FOR MOTION AND INTERACTION OF A SYSTEM COMPOSED OF MANY POLYHEDRAL BLOCKS , 1988 .

[13]  Stephen P. Boyd,et al.  Fast Computation of Optimal Contact Forces , 2007, IEEE Transactions on Robotics.

[14]  E. Hoek,et al.  Rock slope engineering , 1974 .

[15]  Theodore B. Trafalis,et al.  An Analytic Center Machine , 2002, Machine Learning.

[16]  Jack B. Kuipers,et al.  Quaternions and Rotation Sequences: A Primer with Applications to Orbits, Aerospace and Virtual Reality , 2002 .

[17]  Philip E. Gill,et al.  Practical optimization , 1981 .

[18]  Jorge Nocedal,et al.  Knitro: An Integrated Package for Nonlinear Optimization , 2006 .

[19]  J. Kozicki,et al.  A new open-source software developed for numerical simulations using discrete modeling methods , 2008 .

[20]  P. A. Cundall,et al.  FORMULATION OF A THREE-DIMENSIONAL DISTINCT ELEMENT MODEL - PART I. A SCHEME TO DETECT AND REPRESENT CONTACTS IN A SYSTEM COMPOSED OF MANY POLYHEDRAL BLOCKS , 1988 .

[21]  John R. Williams,et al.  A linear complexity intersection algorithm for discrete element simulation of arbitrary geometries , 1995 .

[22]  Yinyu Ye,et al.  Interior point algorithms: theory and analysis , 1997 .