Enhancement of GJK-EPA Algorithm for Improved Contact Detection in Discrete Element Method Simulations
International Journal of Computational Methods · 2026-11 · 23 (09)
DOI: 10.1142/s0219876226500362 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Computational Methods, online erschienen am 21.05.2026. Verfasst von Haowen Zheng und 5 weiteren Autor:innen. Die Arbeit nennt 32 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Scientific Research Fund Project of Nanjing Vocational Institute of Transport Technology.
Abstract (Originalsprache)
This study proposes several key improvements based on a detailed analysis of the Minkowski difference. In the Gilbert–Johnson–Keerthi (GJK) algorithm, a stable orthogonal search direction is constructed at the midpoint of a line-segment simplex to eliminate zero-vector degeneracy, while the origin position relative to a triangular simplex is rapidly determined using the triangle normal. In the Expanding Polytope Algorithms (EPA), the simplex is expanded directly along the triangular normal to form a tetrahedron. A novel outward normal vector determination method is also introduced using the vector between two noncoplanar tetrahedral vertices, resolving failures when the origin lies on a face. The improved GJK-EPA algorithm was implemented in a discrete element framework for gravitational stacking simulations of ellipsoidal–polyhedral particles. Validation against physical experiments showed excellent agreement, with an average repose angle difference of only [Formula: see text] and a relative error in pile height of 4%. Large-scale polyhedral stacking simulations demonstrated denser packing structures with smoother surface profiles. Compared with the conventional GJK-EPA, the proposed algorithm reduces computational time by 13%, decreases the maximum number of iterations by up to three, and improves maximum contact depth accuracy by 8%. Although its contact depth accuracy is slightly lower than that of the GJK-EPA-IPM [Intersection Polygon Method (IPM)] method, its computational time is only 52% of the latter. These results confirm that the improvements provide a superior balance between accuracy and efficiency for polyhedral particle simulations.
Förderung
- National Natural Science Foundation of China
- Scientific Research Fund Project of Nanjing Vocational Institute of Transport Technology
Zitieren
APA
Zheng, H., Liu, J., Guo, Z., Sun, X., Zhou, Q., & Wang, Z. (2026). Enhancement of GJK-EPA Algorithm for Improved Contact Detection in Discrete Element Method Simulations. International Journal of Computational Methods, 23(09). https://doi.org/10.1142/s0219876226500362
Vancouver
Zheng H, Liu J, Guo Z, Sun X, Zhou Q, Wang Z. Enhancement of GJK-EPA Algorithm for Improved Contact Detection in Discrete Element Method Simulations. International Journal of Computational Methods. 2026;23(09). doi:10.1142/s0219876226500362
BibTeX
@article{Zheng2026,
author = {Zheng, Haowen and Liu, Jun and Guo, Zhenhua and Sun, Xiaoyun and Zhou, Qiuyue and Wang, Zhanbin},
title = {Enhancement of GJK-EPA Algorithm for Improved Contact Detection in Discrete Element Method Simulations},
journal = {International Journal of Computational Methods},
year = {2026},
volume = {23},
number = {09},
doi = {10.1142/s0219876226500362}
}
EUVIMED