Related papers: Comment on "Explicit Analytical Solution for Rando…
In this paper the excluded volume of binary similar hyperparticles with small size difference in D-dimensional Euclidean spaces R2, R3, and R4 is studied using two different statistical geometry approaches. These geometric approaches,…
The different variants of two-stage random sequential adsorption (RSA) models for packing of disks and discorectangles on a two-dimensional (2D) surface were investigated. In the SD model, the discorectangles were first deposited and then…
The transition from two-dimensional (2D) to three-dimensional (3D) granular packings is studied using large-scale discrete element computer simulations. We focus on vertical stress profiles and examine how they change with dimensionality…
The study of hard-particle packings is of fundamental importance in physics, chemistry, cell biology, and discrete geometry. Much of the previous work on hard-particle packings concerns their densest possible arrangements. By contrast, we…
In this paper we formulate the problem of packing unequal rectangles/squares into a fixed size circular container as a mixed-integer nonlinear program. Here we pack rectangles so as to maximise some objective (e.g. maximise the number of…
Randomly packing spheres of equal size into a container consistently results in a static configuration with a density of ~64%. The ubiquity of random close packing (RCP) rather than the optimal crystalline array at 74% begs the question of…
Using a recently developed method to simulate percolation on large clusters of distributed machines [N. R. Moloney and G. Pruessner, Phys. Rev. E 67, 037701 (2003)], we have numerically calculated crossing, spanning and wrapping…
We report a recent developement on the theory of upper conical densities. More precicely, we look at what can be said in this respect for other measures than just the Hausdorff measure. We illustrate the methods involved by proving a result…
We derive lower bounds on the maximal rates for multiple packings in high-dimensional Euclidean spaces. Multiple packing is a natural generalization of the sphere packing problem. For any $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $, a multiple…
It has been shown recently that predictions from Mode-Coupling Theory for the glass transition of hard-spheres become increasingly bad when dimensionality increases, whereas replica theory predicts a correct scaling. Nevertheless if one…
Disordered assemblies with maximum packing fraction are studied by discrete element numerical simulation for monodisperse or bidisperse spherical particles, the diameter ratio being set at three. A maximum packing fraction value corresponds…
Jammed soft matter systems are often modelled as dense packings of overlapping soft spheres, thus ignoring particle deformation. For 2D (and 3D) soft disks packings, close to the critical packing fraction $\varphi_c$, this results in an…
The Two-dimensional Bin Packing Problem calls for packing a set of rectangular items into a minimal set of larger rectangular bins. Items must be packed with their edges parallel to the borders of the bins, cannot be rotated and cannot…
The consolidation of suspended particulate matter under external forces such as pressure or gravity is of widespread interest. In this work, we derive a constitutive relation to describe the deformation of a {\it two-dimensional} strongly…
We create collectively jammed (CJ) packings of 50-50 bidisperse mixtures of smooth disks in 2d using an algorithm in which we successively compress or expand soft particles and minimize the total energy at each step until the particles are…
We propose an improved effective-medium theory to obtain the concentration dependence of the viscosity of particle suspensions at arbitrary volume fractions. Our methodology can be applied, in principle, to any particle shape as long as the…
We explore approximation algorithms for the $d$-dimensional geometric bin packing problem ($d$BP). Caprara (MOR 2008) gave a harmonic-based algorithm for $d$BP having an asymptotic approximation ratio (AAR) of $T_{\infty}^{d-1}$ (where…
Optimal packing of spheres in $\mathbb R^d$ is studied by optimization of the energy $E$ (effective conductivity) of composites with ideally conducting spherical inclusions. It is demonstrated that the minimum of $E$ over locations of…
Circle packings are arrangement of circles satisfying specified tangency requirements. Many problems about packing of circles and spheres occur in nature particularly in material design and protein structure. Surprisingly, little is known…
We study the two-dimensional (geometric) knapsack problem with rotations (2DKR), in which we are given a square knapsack and a set of rectangles with associated profits. The objective is to find a maximum profit subset of rectangles that…