2019
DOI: 10.1007/s10035-019-0874-x
|View full text |Cite
|
Sign up to set email alerts
|

Combined 3D thinning and greedy algorithm to approximate realistic particles with corrected mechanical properties

Abstract: The shape of irregular particles has significant influence on micro-and macro-scopic behaviour of granular systems. This paper presents a combined 3D thinning and greedy set-covering algorithm to approximate realistic particles with a clump of overlapping spheres for discrete element method (DEM) simulations. First, the particle medial surface (or surface skeleton), from which all candidate (maximal inscribed) spheres can be generated, is computed by the topological 3D thinning. Then, the clump generation proc… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 50 publications
0
1
0
Order By: Relevance
“…A second category of algorithms relates to the possibility of extracting information on the central axis of a discrete figure, using the distance function directly. In fact, the latter contains information on the point distance of each element from the edge, which makes it possible to identify the axis through the identification of an area of symmetry in the distribution of distances [ [29] , [30] , [31] ]. This type of formulation appears extremely efficient from a computational point of view, being robust with respect to rotation.…”
Section: Introductionmentioning
confidence: 99%
“…A second category of algorithms relates to the possibility of extracting information on the central axis of a discrete figure, using the distance function directly. In fact, the latter contains information on the point distance of each element from the edge, which makes it possible to identify the axis through the identification of an area of symmetry in the distribution of distances [ [29] , [30] , [31] ]. This type of formulation appears extremely efficient from a computational point of view, being robust with respect to rotation.…”
Section: Introductionmentioning
confidence: 99%