2020
DOI: 10.1016/j.compgeo.2019.103283
|View full text |Cite
|
Sign up to set email alerts
|

The last entrance plane method for contact indeterminacy between convex polyhedral blocks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 18 publications
(4 citation statements)
references
References 40 publications
0
4
0
Order By: Relevance
“…Figure 1(d) collected all meta-contacts. According to the last entrance principle proposed by Wang et al [18], when the relative moving velocity is not considered, the meta contact with the maximum distance denotes the contact plane. Additionally, considering the relative rotation between contacting blocks 𝜃 overlap is set as the relaxation angle for contact condition/no-overlapping condition.…”
Section: Meta-contact For Contact Detectionmentioning
confidence: 99%
“…Figure 1(d) collected all meta-contacts. According to the last entrance principle proposed by Wang et al [18], when the relative moving velocity is not considered, the meta contact with the maximum distance denotes the contact plane. Additionally, considering the relative rotation between contacting blocks 𝜃 overlap is set as the relaxation angle for contact condition/no-overlapping condition.…”
Section: Meta-contact For Contact Detectionmentioning
confidence: 99%
“…In the analysis of rock block systems, an assembly of polygonal block is often formed by the intersection of joints/boundaries [9,11,20,34,45,54,58]. Compared to circular/spherical shape, the polygonal/polyhedral shape brings some difficulties for mechanical analysis of block/particle assembles, such as treatment of non-smooth contact normal change at vertices [1,5,40,55,61,62], treatment of quasi-parallel edges [63], and the contact type detection of irregular polygons with small edges or small angles.…”
Section: Introductionmentioning
confidence: 99%
“…The nonsmooth changes of contact normal for polygon and polyhedron contact problems have been investigated, and several algorithms have been proposed to solve this issue within the explicit solution framework, such as the corner rounding scheme, 52,53 the potential particle method, 54,55 the energy conservation method, 56 and the potential function method 4,57–61 . The iterative methods in conventional DDA program can solve the polygon contact problems while remaining the nonsmooth feature in contact normal change 62–65 . The indeterminacy in solving vertex‐vertex contact problems 66 and the algorithmic robustness problem 25 for contact analysis of quasi‐parallel edges/faces pairs was also discussed.…”
Section: Introductionmentioning
confidence: 99%
“…4,[57][58][59][60][61] The iterative methods in conventional DDA program can solve the polygon contact problems while remaining the nonsmooth feature in contact normal change. [62][63][64][65] The indeterminacy in solving vertexvertex contact problems 66 and the algorithmic robustness problem 25 for contact analysis of quasi-parallel edges/faces pairs was also discussed.…”
Section: Introductionmentioning
confidence: 99%