2021
DOI: 10.1002/nme.6800
|View full text |Cite
|
Sign up to set email alerts
|

The Minkowski overlap and the energy‐conserving contact model for discrete element modeling of convex nonspherical particles

Abstract: A unified contact overlap, termed the Minkowski overlap, between any two shapes is proposed in this article. This overlap is based on the concept of the Minkowski difference of two shapes, and particularly on the equivalence between the contact state of the two shapes and the location of the origin relative to their Minkowski difference. The Minkowski contact features of a contact, including the overlap, normal direction, and contact points, are also defined for convex shapes. In particular, an important prope… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 11 publications
(5 citation statements)
references
References 21 publications
0
5
0
Order By: Relevance
“…Advanced shape representations, e.g., using the finite element basis functions, and energy-conserving contact laws, as reported in Refs. [21][22][23] might further improve the accuracy of interaction force computations between particles and convex/concave surfaces.…”
Section: Discussionmentioning
confidence: 99%
“…Advanced shape representations, e.g., using the finite element basis functions, and energy-conserving contact laws, as reported in Refs. [21][22][23] might further improve the accuracy of interaction force computations between particles and convex/concave surfaces.…”
Section: Discussionmentioning
confidence: 99%
“…A geometric shape (2D or 3D) is considered to be the set of all individual points contained in the shape. 4,32 Consider two blocks A and B. Their Minkowski sum, denoted as A ⊕ B, is obtained by adding every point in A to every point in B:…”
Section: Minkowski Difference and Contact Statementioning
confidence: 99%
“…The Gilbert-Johnson-Keerthi (GJK) proposed by Gilbert et al 36 does not need to construct Minkowski difference of two convex polygons explicitly, but check if the origin is enclosed in the Minkowski difference through iterations using support points of the polygons. The detail of the GJK algorithm can be found in Feng and Tan 32,33 and is also outlined in Algorithm 5 for the completeness.…”
Section: Overlap Checking Of Two Polygonsmentioning
confidence: 99%
See 1 more Smart Citation
“…This introduces certain roughness to the deformable bodies' surface and can be avoided by using mathematically well-defined geometric objects (e.g., curved walls [42]), mapped from the finite element. Other shape representations, including signed distance functions [60], level set methods [42,61,62], and Minkowski sums [63] could also be used. Secondly, currently, only the traction due to particle-wall interaction forces are mapped onto the finite elements; the kinetic traction due to velocity fluctuations is not explicitly considered.…”
Section: Outlooksmentioning
confidence: 99%