A new algorithm for accurate contact point calculation between convex polyhedral particles in DEM

Contact detection and contact geometry are among the most important steps in Discrete Element Method (DEM) simulations. Accurately representing the contact between two particles is crucial, and when modeling fractured rock using polyhedral particles, the accuracy of the contact point calculation is essential for obtaining realistic and reliable simulation results. The point of contact is where contact forces are applied to particles in a DEM simulation and, thus, an inaccurate representation of that point leads to artificial torque acting on particles, resulting in non-physical rotation and particle interactions. Herein we present a new algorithm for accurately calculating the contact point between two colliding polyhedral particles. The algorithm uses the topology of the particles to assert their interaction with the plane of contact and not directly with each other. The new algorithm provides improved performance in terms of global stability of DEM models by mitigating numerically induced instability associated with errors and sporadic movement in the contact point calculation. The performance of the new algorithm is showcased in several examples that illustrate how accurately representing the contact point is a requirement for generating reliable numerical simulations.

Authors

Institutions

Publication Details

Journal
Computers and Geotechnics
Published
2025-04-14
DOI
https://doi.org/10.1016/j.compgeo.2025.107240
Citations
4
Primary Topic
Fluid Dynamics Simulations and Interactions
Type
article
Field-Weighted Citation Impact
5.34
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A new algorithm for accurate contact point calculation between convex polyhedral particles in DEM

Michael Gardner, Yuval Keissar, Nicholas Sitar
4 citations
Computers and Geotechnics
Fluid Dynamics Simulations and Interactions
5.34
article

A new algorithm for accurate contact point calculation between convex polyhedral particles in DEM

Michael Gardner, Yuval Keissar, Nicholas Sitar
article en
4 citations

Abstract

Contact detection and contact geometry are among the most important steps in Discrete Element Method (DEM) simulations. Accurately representing the contact between two particles is crucial, and when modeling fractured rock using polyhedral particles, the accuracy of the contact point calculation is essential for obtaining realistic and reliable simulation results. The point of contact is where contact forces are applied to particles in a DEM simulation and, thus, an inaccurate representation of that point leads to artificial torque acting on particles, resulting in non-physical rotation and particle interactions. Herein we present a new algorithm for accurately calculating the contact point between two colliding polyhedral particles. The algorithm uses the topology of the particles to assert their interaction with the plane of contact and not directly with each other. The new algorithm provides improved performance in terms of global stability of DEM models by mitigating numerically induced instability associated with errors and sporadic movement in the contact point calculation. The performance of the new algorithm is showcased in several examples that illustrate how accurately representing the contact point is a requirement for generating reliable numerical simulations.

Computers and GeotechnicsVol. 184
University of California, Davis (US), University of California, Berkeley (US)
Openalex Percentile: Top 5%
Fluid Dynamics Simulations and Interactions
5.34
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.