Related papers: Evolving Design Rules for the Inverse Granular Pac…
In this paper we present a new algorithm for a layout optimization problem: this concerns the placement of weighted polygons inside a circular container, the two objectives being to minimize imbalance of mass and to minimize the radius of…
We present a model development framework and numerical solution approach to the general problem-class of packing convex objects into optimized convex containers. Specifically, here we discuss the problem of packing ovals (egg-shaped…
We present the algorithm for generating strictly saturated random sequential adsorption packings built of rounded polygons. It can be used to study various properties of such packings built of a wide variety of different shapes and in…
Static granular packings are model hard-sphere glass formers. The nature of glass transition has remained a hotly debated issue. We review recent experimental progresses in using granular materials to study glass transitions. We focus on…
We present filling as a type of spatial subdivision problem similar to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most interior volume. In…
The packing problem, also known as cutting or nesting, has diverse applications in logistics, manufacturing, layout design, and atlas generation. It involves arranging irregularly shaped pieces to minimize waste while avoiding overlap.…
Sphere packings are essential to the development of physical models for powders, composite materials, and the atomic structure of the liquid state. There is a strong scientific need to be able to assess the fit of packing models to data,…
The problem of packing equal circles in a circle is a classic and famous packing problem, which is well-studied in academia and has a variety of applications in industry. This problem is computationally challenging, and researchers mainly…
The inverse diffusion curve problem focuses on automatic creation of diffusion curve images that resemble user provided color fields. This problem is challenging since the 1D curves have a nonlinear and global impact on resulting color…
Since the 1920s, packing arguments have been used to rationalize crystal structures in systems ranging from atomic mixtures to colloidal crystals. Packing arguments have recently been applied to complex nanoparticle structures, where they…
We investigate ordering properties of two-dimensional granular materials using several shapes created by welding ball bearings together. Ordered domains form much more easily in two than in three dimensions, even when configurations lack…
We study dense packings of a large number of congruent non-overlapping circles inside a square by looking for configurations which maximize the packing density, defined as the ratio between the area occupied by the disks and the area of the…
This paper deals with the problem of circle packing, in which the largest radii circle is to be fit in a confined space filled with arbitrary circles of different radii and centers. A circle packing problem is one of a variety of cutting…
We systematically investigate the self-assembly of anisotropic cone-shaped particles decorated by ring-like attractive patches. We demonstrate that the self-assembled clusters, which arise due to the conical particle's anisotropic shape…
Assembling parts into an object is a combinatorial problem that arises in a variety of contexts in the real world and involves numerous applications in science and engineering. Previous related work tackles limited cases with identical unit…
We study the optimal packing of hard spheres in an infinitely long cylinder, using simulated annealing, and compare our results with the analogous problem of packing disks on the unrolled surface of a cylinder. The densest structures are…
Controlling segregation is both a practical and a theoretical challenge. In this Letter we demonstrate a manner in which rotation-induced segregation may be controlled by altering the geometry of the rotating containers in which granular…
Size segregation of granular mixtures which are almost completely packed in a rotating drum is discussed with an effective simulation and a brief analysis. Instead of a 3D drum, we simulate 2D rotating thin box which is almost completely…
Random sequential adsorption algorithm is a popular tool for modelling structure of monolayers built in irreversible adsorption experiments. However, this algorithm becomes very inefficient when the density of molecules in a layer rises.…
The present work surveys problems in $n$-dimensional space with $n$ large. Early development in the study of packing and covering in high dimensions was motivated by the geometry of numbers. Subsequent results, such as the discovery of the…