International audienceA new constructive ellipse packing algorithm is presented. It allows to respect the imposed area, shape and spatial orientation distribution (i.e. the inertia tensor) and achieve high packing densities. The packing density decreases with increasing particles aspect ratio what is in agreement with results reported in the literature. The generated packings with complex imposed area, shape and spatial orientation distributions with densities in the range of 0.74 and 0.8 are presented. The efficiency of the algorithm is demonstrated by comparison with the Optimized Dropping and Rolling method for disk packing. Moreover, the proposed packing strategy enables to generate very easily non-equiaxed polygonal structures by using...
With the advance of the finite element method, general fluid dynamic and traffic flow problems with ...
The packings of cubes and cuboids (i.e., "elongated'' or "compressed''...
Disordered packings of ellipsoidal particles are an important model for disordered granular matter a...
International audienceA new constructive ellipse packing algorithm is presented. It allows to respec...
International audienceA new constructive algorithm, called Advancing layer algorithm, for the genera...
We describe a new numerical procedure for generating dense packings of disks and spheres inside vari...
Packing problems, such as how densely objects can fill a volume, are among the most ancient and pers...
The problem of packing ellipsoids in the three-dimensional space is considered in the present work. ...
Designers always get good inspirations from fascinating geometric structures gifted by the nature. I...
The packing of rod-like particles has arisen in a variety of scientific and industrial applications....
Packings of hard polyhedra have been studied for centuries due to their mathematical aesthetic and m...
A granular structure is an aggregation of grains whose sizes are characterized by a given distributi...
This document presents a simulation-based method for the polyhedra packing problem (PPP). This probl...
Recent simulations indicate that ellipsoids can randomly pack more densely than spheres and, remarka...
We have studied two-dimensional random packings of ellipses. When the aspect ratio is varied, a maxi...
With the advance of the finite element method, general fluid dynamic and traffic flow problems with ...
The packings of cubes and cuboids (i.e., "elongated'' or "compressed''...
Disordered packings of ellipsoidal particles are an important model for disordered granular matter a...
International audienceA new constructive ellipse packing algorithm is presented. It allows to respec...
International audienceA new constructive algorithm, called Advancing layer algorithm, for the genera...
We describe a new numerical procedure for generating dense packings of disks and spheres inside vari...
Packing problems, such as how densely objects can fill a volume, are among the most ancient and pers...
The problem of packing ellipsoids in the three-dimensional space is considered in the present work. ...
Designers always get good inspirations from fascinating geometric structures gifted by the nature. I...
The packing of rod-like particles has arisen in a variety of scientific and industrial applications....
Packings of hard polyhedra have been studied for centuries due to their mathematical aesthetic and m...
A granular structure is an aggregation of grains whose sizes are characterized by a given distributi...
This document presents a simulation-based method for the polyhedra packing problem (PPP). This probl...
Recent simulations indicate that ellipsoids can randomly pack more densely than spheres and, remarka...
We have studied two-dimensional random packings of ellipses. When the aspect ratio is varied, a maxi...
With the advance of the finite element method, general fluid dynamic and traffic flow problems with ...
The packings of cubes and cuboids (i.e., "elongated'' or "compressed''...
Disordered packings of ellipsoidal particles are an important model for disordered granular matter a...