Contact detection between polygonal blocks based on a novel multi-cover system for discontinuous deformation analysis

A robust potential-based contact force solution approach for discontinuous deformation analysis of irregular convex polygonal block/particle systems

“…The efficiency of this detection phase becomes significantly important with increasing body numbers. Many algorithms have been published to enhance the computational efficiency in neighbor search process, such as the grid-based searching algorithm [2], the no-binary search algorithms [27] for discrete bodies of similar sizes, the double-ended spatial sorting algorithm [31], the CGrid algorithm [41] for discrete bodies of various sizes, and the multi-shell cover algorithm for polyhedra [39,44]. The neighbor search algorithm should be chosen according to the distribution feature of the discrete body system.…”

A cover‐based contact detection approach for irregular convex polygons in discontinuous deformation analysis

“…Some commonly applied numerical approach for fracture and contact analysis of rock and soil material includes the finite element method, 10 the phase field approach, 11 peridynamics, 12 the discrete element method, 13 discontinuous deformation analysis (DDA), 14,15 distinct lattice spring method, 16 rigid block spring method, 17 the combined finite‐discrete element method, 18 and the numerical manifold method 19–21 . Solving contact interaction of assembly of discrete bodies is a challenging task considering the computational efficiency and the algorithmic robustness in detecting and solving contact of massive particles/blocks with various shapes 22–30 . A two‐phase process, that is, neighbor search and delicate search, is commonly used to improve the detection efficiency.…”

“…A two‐phase process, that is, neighbor search and delicate search, is commonly used to improve the detection efficiency. For a system involving a lot of blocks/particles, the efficiency of establishing neighbor block pairs and resolving geometrical constraint in contact detection has been greatly improved by several algorithms, such as no‐binary search algorithm, 31 double‐ended spatial sorting algorithm, 32 C‐Grid method, 33 multicover algorithm 22,23 …”

“…[19][20][21] Solving contact interaction of assembly of discrete bodies is a challenging task considering the computational efficiency and the algorithmic robustness in detecting and solving contact of massive particles/blocks with various shapes. [22][23][24][25][26][27][28][29][30] A two-phase process, that is, neighbor search and delicate search, is commonly used to improve the detection efficiency. For a system involving a lot of blocks/particles, the efficiency of establishing neighbor block pairs and resolving geometrical constraint in contact detection has been greatly improved by several algorithms, such as no-binary search algorithm, 31 double-ended spatial sorting algorithm, 32 C-Grid method, 33 multicover algorithm.…”

“…For a system involving a lot of blocks/particles, the efficiency of establishing neighbor block pairs and resolving geometrical constraint in contact detection has been greatly improved by several algorithms, such as no-binary search algorithm, 31 double-ended spatial sorting algorithm, 32 C-Grid method, 33 multicover algorithm. 22,23 Polygonal and polyhedral block/particle shapes are commonly used to represent the geometries of rock masses or rock grains. Specially, irregular polygonal or polyhedral block/particle with small edges or sharp angles can be encountered considering intersection of joints 34,35 and geological formation of mesoscale rock grains.…”