Related papers: Packing Squares into a Disk with Optimal Worst-Cas…
We present a new generalization of the bin covering problem that is known to be a strongly NP-hard problem. In our generalization there is a positive constant $\Delta$, and we are given a set of items each of which has a positive size. We…
We are interested in the following problem of covering the plane by a sequence of congruent circular disks with a constraint on the distance between consecutive disks. Let $(\mathcal{D}_n)_{n \in \mathbb N}$ be a sequence of closed unit…
We study the geometric knapsack problem in which we are given a set of $d$-dimensional objects (each with associated profits) and the goal is to find the maximum profit subset that can be packed non-overlappingly into a given…
Predicting theoretically the highest density, which a disordered packing of discs can achieve, has been a long-standing unresolved problem. Such predictions are hindered by two difficulties - the dependence of the density on the packing…
The article presents the mathematical sequences describing circle packing densities in four different geometric configurations involving a hexagonal lattice based equal circle packing in the Euclidian plane. The calculated sequences take…
We study random sequential adsorption (RSA) of a class of solids that can be obtained from a cube by specific cutting of its vertices, in order to find out how the transition from tetrahedral to octahedral symmetry affects the densities of…
Suppose that $I$ is a unit square. Let $T$ (resp. $\Delta$) be an isosceles right triangle (resp. an equilateral triangle). We prove that any collection of triangles homothetic to $T$ (resp. $\Delta$), whose total area does not exceed…
Dense hard-particle packings are intimately related to the structure of low-temperature phases of matter and are useful models of heterogeneous materials and granular media. Most studies of the densest packings in three dimensions have…
We study, via the replica method of disordered systems, the packing problem of hard-spheres with a square-well attractive potential when the space dimensionality, d, becomes infinitely large. The phase diagram of the system exhibits…
Let $P_{n}$ be a set of $n$ points, including the origin, in the unit square $U = [0,1]^2$. We consider the problem of constructing $n$ axis-parallel and mutually disjoint rectangles inside $U$ such that the bottom-left corner of each…
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…
We studied the geometrical and topological rules underlying the dispositions and the size distribution of non-overlapping, polydisperse circle-packings. We found that the size distribution of circles that densely cover a plane follows the…
Direct numerical simulations are performed for the steady flow normal to a circular disk at the Reynolds number of 1000. Numerical simulations are conducted with different levels of simplification procedure by reducing the azimuthal…
We study the two-dimensional hierarchical rectangle packing problem, motivated by applications in analog integrated circuit layout, facility layout, and logistics. Unlike classical strip or bin packing, the dimensions of the container are…
X-ray diffraction with high spatial resolution is a prerequisite for the characterization of (poly)-crystalline materials on micro- or nanoscopic scales. This can be achieved by utilizing a focused X-ray beam and scanning of the sample.…
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…
Let $L \subset {\Bbb R}^3$ be the union of unit balls, whose centres lie on the $z$-axis, and are equidistant with distance $2d \in [2, 2\sqrt{2}]$. Then a packing of unit balls in ${\Bbb R}^3$ consisting of translates of $L$ has a density…
Based on numerical simulations that we have carried out, we provide evidence that for regular polygons with $\sigma= 6j$ sides (with $j=2,3,\dots$), $N(k)=3 k (k+1)+1$ (with $k=1,2,\dots$) congruent disks of appropriate size can be nicely…
The hard disk model is a 2D Gibbsian process of particles interacting via pure hard core repulsion. At high particle density the model is believed to show orientational order, however, it is known not to exhibit positional order. Here we…
Accurate quantification of local packing density and mixing in simulations of particulate systems is essential for many industrial applications. Traditional methods which simply count the number of particle centres within a given volume of…