Contact detection between convex polyhedra and superquadrics in discrete element codes

• Published in: Powder technology Vol. 356; pp. 11 - 20
• Main Authors: Peng, Di, Hanley, Kevin J.
• Format: Journal Article
• Language: English
• Published: Lausanne Elsevier B.V 01-11-2019; Elsevier BV
• Subjects: Algorithms; Computer simulation; Discrete element method; Discrete element method (DEM); Elementary particles; Monte Carlo simulation; Nonspherical particle; Numerical simulation; Particle shape; Polyhedra; Polyhedron; Shape recognition; Superquadric; Polyhedron; Superquadric; Discrete element method (DEM); Numerical simulation; Nonspherical particle
• ISSN: 0032-5910; 1873-328X
• DOI: 10.1016/j.powtec.2019.07.082

Particle shape substantially influences the bulk behaviour of granular systems. Hence, much scientific interest has been devoted to the adoption of non-spherical fundamental particles in discrete element method simulations. Two examples of such particles are polyhedra, which are highly angular, and superquadrics, which are best suited to simulate rounded particles. It is desirable to use both types of particle together in a simulation to capture the broadest possible range of particle shapes. In this paper, a novel contact detection algorithm is presented for a convex polyhedron and superquadric. This algorithm was implemented in a C++ code which was used to verify the correctness of the algorithm and evaluate its efficiency using the Monte Carlo method. The proposed contact detection algorithm is particularly efficient for many-faceted polyhedra as the effect of increasing the number of faces on the evaluation time is small.
[Display omitted]
•Developed a contact detection algorithm for convex polyhedra and superquadrics.•Capable of resolving any type of polyhedron face, edge or vertex (non-)contact.•Implemented the algorithm in a C++ code and verified its correctness.•Demonstrated the algorithm's efficiency, particularly for many-faceted polyhedra.