An accurate and robust contact detection algorithm for particle‐solid interaction in combined finite‐discrete element analysis

Abstract

SUMMARYWhen applying the combined finite-discrete element method for analysis of dynamic problems, contact is often encountered between the finite elements and discrete elements, and thus an effective contact treatment is essential. In this paper, an accurate and robust contact detection algorithm is proposed to resolve contact problems between spherical particles, which represent rigid discrete elements, and convex quadrilateral mesh facets, which represent finite element boundaries of structural components. Different contact scenarios between particles and mesh facets, or edges, or vertices have been taken into account. For each potential contact pair, the contact search is performed in an hierarchical way starting from mesh facets, possibly going to edges and even further to vertices. The invalid contact pairs can be removed by means of two reasonable priorities defined in terms of geometric primitives and facet identifications. This hierarchical contact searching scheme is effective, and its implementation is straightforward. Numerical examples demonstrated the accuracy and robustness of the proposed algorithm.

The Double Hierarchy Method. A parallel 3D contact method for the interaction of spherical particles with rigid FE boundaries using the DEM

“…Therefore, it is recommendable to test the edges e a with a ∈ [index e , N ] starting from the vertex which failed in the previous test and skipping the previous ones (Note that the edge check is the most expensive one). This approach has also been used by Chen et al [6].…”

“…Generally it involves a minimization problem [43]. However, Chen [6] proposes an averaging of the normal and a relaxed contact criterion. …”

“…The upgraded RIGID-II method presented later by Su et al [35] and also the method proposed by Hu et al [18] account for the multiple contact situations, but they have a complex elimination procedure with many different contact scenarios to distinguish, which is difficult to code in practice. Recently Chen et al [6] presented a very simple and accurate algorithm which covers many situations. Their elimination procedure, however, requires a special database which cannot be computed in parallel.…”

“…Table 1 summarizes the strengths and drawbacks of the reviewed contact detection methods. Methods based in storing all the potential contacts to lately remove the invalid ones (RIGID-II [35], Hu et al [18], Chen et al [6] and H 2 ) are the most accurate. They treat the cases with large indentations (relative to the size of the FE) and give a solution for the contact continuity in non-smooth regions of the boundary.…”

On the Impact Fracture Simulations of Automotive Laminated Glass

“…In this algorithm, discrete elements are treated as the slave nodes. Several other DEM/FEM contact algorithms can be found in [15][16].…”