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...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2012
|