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: | Boon, C, Houlsby, G, Utili, S |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2012
|
Similar Items
-
A new contact detection algorithm for non-spherical particles in the Discrete Element Method
by: Boon, C, et al.
Published: (2011) -
A new contact detection algorithm for three-dimensional non-spherical particles
by: Boon, C, et al.
Published: (2013) -
A new contact detection algorithm for three-dimensional non-spherical particles
by: Boon, C, et al.
Published: (2013) -
An Improved Contact Force Model of Polyhedral Elements for the Discrete Element Method
by: Yue Wang, et al.
Published: (2023-12-01) -
An algorithmic approach to convex fair partitions of convex polygons
by: Mathilda Campillo, et al.
Published: (2024-06-01)