Related papers: Deriving Finite Sphere Packings
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 formulate the problem of generating dense packings of nonoverlapping, non-tiling polyhedra within an adaptive fundamental cell subject to periodic boundary conditions as an optimization problem, which we call the Adaptive Shrinking Cell…
The Apollonian circle packing, generated from three mutually-tangent circles in the plane, has inspired over the past half-century the study of other classes of space-filling packings, both in two and in higher dimensions. Recently,…
The topological structure resulting from the network of contacts between grains (\emph{contact network}) is studied for large samples of monosized spheres with densities (fraction of volume occupied by the spheres) ranging from 0.59 to…
The problem of finding the asymptotic behavior of the maximal density of sphere packings in high Euclidean dimensions is one of the most fascinating and challenging problems in discrete geometry. One century ago, Minkowski obtained a…
We prove that in any dimension $n$ there exists an origin-symmetric ellipsoid ${\mathcal{E}} \subset {\mathbb{R}}^n$ of volume $ c n^2 $ that contains no points of ${\mathbb{Z}}^n$ other than the origin, where $c > 0$ is a universal…
The most efficient way to pack equally sized spheres isotropically in 3D is known as the random close packed state, which provides a starting point for many approximations in physics and engineering. However, the particle size distribution…
In this paper, we study the 3D strip packing problem in which we are given a list of 3-dimensional boxes and required to pack all of them into a 3-dimensional strip with length 1 and width 1 and unlimited height to minimize the height used.…
We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…
We consider the sets of dimensions for which there is an optimal sphere packing with special regularity properties (respectively, a lattice, or a periodic set with a given bound on the number of translations, or an arbitrary periodic set).…
We study the packing of a large number of congruent and non--overlapping circles inside a regular polygon. We have devised efficient algorithms that allow one to generate configurations of $N$ densely packed circles inside a regular polygon…
In this paper we study the hard sphere packing problem in the Hamming space by the cavity method. We show that both the replica symmetric and the replica symmetry breaking approximations give maximum rates of packing that are asymptotically…
A compact circle-packing $P$ of the Euclidean plane is a set of circles which bound mutually disjoint open discs with the property that, for every circle $S\in P$, there exists a maximal indexed set $\{A_{0},\ldots,A_{n-1}\}\subseteq P$ so…
One of the basic problems in discrete geometry is to determine the most efficient packing of congruent replicas of a given convex set $K$ in the plane or in space. The most commonly used measure of efficiency is density. Several types of…
Packings of identical objects have fascinated both scientists and laymen alike for centuries, in particular the sphere packings and the packings of identical regular tetrahedra. Mathematicians have tried for centuries to determine the…
Iterative rounding has enjoyed tremendous success in elegantly resolving open questions regarding the approximability of problems dominated by covering constraints. Although iterative rounding methods have been applied to packing problems,…
We consider here the $3$-sphere $\mathbf S^3$ seen as the boundary at infinity of the complex hyperbolic plane $\mathbf{H}^2_{\mathbf C}$. It comes equipped with a contact structure and two classes of special curves. First $\mathbf…
The structure of the densest crystal packings is determined for a variety of concave shapes in 2D constructed by the overlap of two or three disks. The maximum contact number per particle pair is defined and proposed as a useful means of…
Let $\mathcal{P}$ be a packing of circular disks of radius $\rho>0$ in the Euclidean, spherical, or hyperbolic plane. Let $0\leq\lambda\leq\rho$. We say that $\mathcal{P}$ is a $\lambda$-separable packing of circular disks of radius $\rho$…
The aim of this paper is to highlight recent progress in using conic optimization methods to study geometric packing problems. We will look at four geometric packing problems of different kinds: two on the unit sphere -- the kissing number…