An efficient algorithm to generate random sphere packs in arbitrary domains. (April 2016)

• Record Type: Journal Article
• Authors: Lozano, Elias; Roehl, Deane; Celes, Waldemar; Gattass, Marcelo
• Is Part Of: Computers & mathematics with applications. Volume 71:issue 8(2016)
• Page Start: 1586
• Page End: 1601
• Publication Date: 2016-04
• Subjects: Sphere packing -- Advancing-front approach -- Geometric algorithm -- Distance field applications; Electronic data processing -- Periodicals; Mathematics -- Data processing -- Periodicals; 510.28541
• DOI: 10.1016/j.camwa.2016.02.032
• Languages: English
• ISSNs: 0898-1221

Abstract

Abstract: 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.