A geometric algorithm based on tetrahedral meshes to generate a dense polydisperse sphere packing

Packing spherical discrete elements for large scale simulations

“…The first procedure, described in detail in [15], is based on geometric inversion. The new geometric procedure has proven to be faster.…”

“…This new algorithm is of great interest for engineering problems since very large packings can be built in a few minutes starting from a tetrahedral mesh. This tool is an extension of a recently developed geometric algorithm [15]. Since the advent of intensive computation, the DEM became an interesting alternative tool to study large deformation processes in materials.…”

An Algorithm to Generate Random Sphere Packs in Arbitrary Domains

“…For all the test cases in this distribution the rejections lists are composed only of the R max value. (28), our density ratio value was the same as the obtained by Jerier et al (19). In the second test our coordination number was only better than the result of Lubachevsky et al and our density was the lowest of all.…”

“…The package optimization considers the minimization of the distances of the particles to the triangles mesh. Jerier et al (19,20) improves the ideas in (8) to create packs with polydisperse spheres inside tetrahedral meshes. They define a geometric procedure to fill spheres inside tetrahedrons placing particles in the edges, vertices and in inside the tetrahedrons.…”

A discrete modeling-based constitutive relation for infilled rock joints

“…The box is filled with discrete spherical elements using the packing algorithm developed by Jerier [31]. Spheres of different radii are chosen.…”