A contact detection algorithm for polyhedrons based on improved common-plane concept

Abstract

Abstract To address the inaccuracies in contact point calculation and low computational efficiency of traditional common-plane methods in complex contact scenarios, this study proposes an improved contact detection algorithm based on the common-plane concept. By defining a distance function between block elements and the common plane, optimizing the contact point update strategy, and introducing a dual-condition-controlled iterative termination mechanism, the algorithm significantly enhances computational precision for edge-edge, edge-face, and other contact types. Validation using CAD models demonstrates that the coordinate error of contact points is less than 5%, the normal angle deviation is below 0.5°, and the contact depth error is controlled within 1%. Discrete Element Method (DEM) simulations of polyhedron random packing processes reveal that the improved algorithm increases computational efficiency by over 10% compared to the traditional common-plane method, while reducing the maximum contact depth error by 47.4%. Experimental and simulated particle packing morphologies and trajectories show high consistency, confirming the algorithm’s reliability and engineering applicability.