A new constructive algorithm for random polydisperse dense disk pack generation

This article presents a novel strategy for the non‐overlapping disk‐packing problem for generating dense random assemblies. The proposed geometric algorithm adopts an advancing‐front approach that uses novel heuristics to determine the next positions for incoming particles with support from a polygo...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal for numerical methods in engineering Ročník 122; číslo 20; s. 5812 - 5843
Hlavní autoři: Lozano, Elias, Gattass, Marcelo
Médium: Journal Article
Jazyk:angličtina
Vydáno: Hoboken, USA John Wiley & Sons, Inc 30.10.2021
Wiley Subscription Services, Inc
Témata:
advancing‐front approach
Algorithms
disk packing
Distribution functions
geometric algorithm
Geometric algorithms
Packing density
polygonal mesh
ISSN:0029-5981, 1097-0207
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This article presents a novel strategy for the non‐overlapping disk‐packing problem for generating dense random assemblies. The proposed geometric algorithm adopts an advancing‐front approach that uses novel heuristics to determine the next positions for incoming particles with support from a polygonal mesh. Additionally, we propose strategies to improve generation at the pack's interior and near container borders. Experiments demonstrate that our algorithm outperforms previous methods in terms of the desired particle radius distribution function, packing density, and mean number of particle contacts.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0029-5981
1097-0207
DOI:10.1002/nme.6774