A Minkowski difference‐based advancing front packing technique for generating convex noncircular particles in complex domains

In this work, a Minkowski difference‐based advancing front approach is proposed to generate convex and non‐circular particles in a predefined computational domain. Two specific algorithms are developed to handle the contact conformity of generated particles with the boundaries of the computational d...

Full description

Saved in:
Bibliographic Details
Published in:International journal for numerical methods in engineering Vol. 124; no. 20; pp. 4520 - 4546
Main Authors: Xia, Ming, Xu, Xin, Gong, Fengqiang, Wang, Min, Feng, Y. T.
Format: Journal Article
Language:English
Published: Hoboken, USA John Wiley & Sons, Inc 30.10.2023
Wiley Subscription Services, Inc
Wiley
Subjects:
advancing front approach
Algorithms
Boundaries
Complexity
convex noncircular particles
discrete element method
ENGINEERING
Gilbert-Johnson-Keerthi (GJK) method
interior and external domain boundaries
internal and external domain boundaries
Minkowski difference
Packing density
ISSN:0029-5981, 1097-0207
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this work, a Minkowski difference‐based advancing front approach is proposed to generate convex and non‐circular particles in a predefined computational domain. Two specific algorithms are developed to handle the contact conformity of generated particles with the boundaries of the computational domain. The first, called the open form, is used to handle the smooth contact of generated particles with (external) boundaries, while the other, called the closed form, is proposed to handle the internal boundaries of a computational domain with a complex cavity. The Gilbert‐Johnson‐Keerthi (GJK) method is used to efficiently solve the contact detection between the newly generated particle at the front and existing particles. Furthermore, the problem of one‐sided particle lifting, which can cause some defects in the packing structure in existing advancing front methods during packing generation, is highlighted and an effective solution is developed. Several examples of increasing complexity are used to demonstrate the efficiency and applicability of the proposed packing generation approach. The numerical results show that the generated packing is not only more uniform, but also achieves a higher packing density than existing advancing front methods.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
89233218CNA000001
Work For Others (WFO)
LA-UR-23-26840
USDOE National Nuclear Security Administration (NNSA)
ISSN:0029-5981
1097-0207
DOI:10.1002/nme.7318