Journal article icon

Journal article

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

Abstract:

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...

Expand abstract
Publication status:
Published

Actions


Access Document


Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Engineering Science
Sub department:
Civil Engineering
Role:
Author
Journal:
COMPUTERS AND GEOTECHNICS More from this journal
Volume:
44
Pages:
73-82
Publication date:
2012-06-01
DOI:
ISSN:
0266-352X
Language:
English
Keywords:
Pubs id:
pubs:329436
UUID:
uuid:f5cddb18-829a-43c4-8bce-34593ed69c41
Local pid:
pubs:329436
Source identifiers:
329436
Deposit date:
2013-02-20

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP