Sphere Packing Based on Geometric Algorithm Generation Method

In this paper, we propose a geometric algorithm method to generate a specimen of arbitrary shapes with restricted overlap values. In the previous studies, samples consist of thousands spheres often uses dynamic method which takes several hours or more, additionally, overlap between spheres is inevitable. The developed geometric algorithm starts with one given sphere, its coordinate and radius are predefined. Around with this given sphere, the authorized spheres (radius ranges from minimum and maximum radii values) are continuously to be put and expand outward until filling up the structure that meshed by triangular or number of spheres is reached. Furthermore, the periodic boundary is adopted to generate a large scale symmetrical specimen. The averaged coordination number and the solid fraction of specimen which generated by this packing method are reasonable. Finally, this method is used in a real engineering problem to reveal the generation process.