An efficient algorithm to generate random sphere packs in arbitrary domains

详细信息    查看全文

• 作者：Elias Lozano^a ; ^b ; ^{elozano@tecgraf.puc-rio.br" class="auth_mail" title="E-mail the corresponding author} ; Deane Roehl^a ; ^c ; ^{deane@tecgraf.puc-rio.br" class="auth_mail" title="E-mail the corresponding author} ; Waldemar Celes^a ; ^b ; ^{celes@tecgraf.puc-rio.br" class="auth_mail" title="E-mail the corresponding author} ; Marcelo Gattass^a ; ^b ; ^{mgattass@tecgraf.puc-rio.br" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Sphere packing ; Advancing-front approach ; Geometric algorithm ; Distance field applications
• 刊名：Computers & Mathematics with Applications
• 出版年：2016
• 出版时间：April 2016
• 年：2016
• 卷：71
• 期：8
• 页码：1586-1601
• 全文大小：3704 K

文摘

Particle-based methods based on material models using spheres can provide good approximations for many physical phenomena at both the micro and macroscales. The point of departure for the simulations, in general, is a dense arrangement of spherical particles (sphere pack) inside a given container. For generic domains, the generation of a sphere pack may be complex and time-consuming, especially if the pack must comply with a prescribed sphere size distribution and the stability requirements of the simulation. The primary goal of this paper is to present an efficient algorithm that is capable of producing packs with millions of spheres following a statistical sphere size distribution inside complex arbitrary domains. This algorithm uses a new strategy to ensure that the sphere size distribution is preserved even when large particles are rejected in the growing process. The paper also presents numerical results that enable an evaluation of the proposed algorithm.