Related papers: Improving Dense Packings of Equal Disks in a Squar…
We study the optimal packing of short, hard spherocylinders confined to lie tangential to a spherical surface, using simulated annealing and molecular dynamics simulations. For clusters of up to twelve particles, we map out the changes in…
We present polynomial-time approximation schemes based on local search} technique for both geometric (discrete) independent set (\mdis) and geometric (discrete) dominating set (\mdds) problems, where the objects are arbitrary radii disks…
In this work we propose a heuristic algorithm for the layout optimization for disks installed in a rotating circular container. This is a unequal circle packing problem with additional balance constraints. It proved to be an NP-hard…
In a previous paper we introduced examples of Hamiltonian mappings with phase space structures resembling circle packings. We now concentrate on one particular mapping and present numerical evidence which supports the conjecture that the…
We create mechanically stable (MS) packings of bidisperse disks using an algorithm in which we successively grow or shrink soft repulsive disks followed by energy minimization until the overlaps are vanishingly small. We focus on small…
Building on Viazovska's recent solution of the sphere packing problem in eight dimensions, we prove that the Leech lattice is the densest packing of congruent spheres in twenty-four dimensions and that it is the unique optimal periodic…
The formation of quasi-spherical cages from protein building blocks is a remarkable self-assembly process in many natural systems, where a small number of elementary building blocks are assembled to build a highly symmetric icosahedral…
The aim of this paper is to review and discuss qualitatively some results on the properties of amorphous packings of hard spheres that were recently obtained by means of the replica method. The theory gives predictions for the equation of…
We investigate the deposition of binary mixtures of oriented superdisks on a plane. Superdisks are chosen as objects bounded by $|x|^{2p}+|y|^{2p}=1$, where parameter $p$ controls their size and shape. For single-type superdisks, the…
We continue the study of optimal chordal packings, with emphasis on packing subspaces of dimension greater than one. Following a principle outlined in a previous work, where the authors use maximal affine block designs and maximal sets of…
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 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…
We construct a dense packing of regular tetrahedra, with packing density $D > >.7786157$.
The problem of packing unequal circles into a circular container stands as a classic and challenging optimization problem in computational geometry. This study introduces a suite of innovative and efficient methods to tackle this problem.…
A geometric inequality among three triangles, originating in circle packing problems, is introduced. In order to prove it, we reduce the original formulation to the nonnegativity of a particular polynomial in four real indeterminates.…
The construction of optimal line packings in real or complex Euclidean spaces has shown to be a tantalizingly difficult task, because it includes the problem of finding maximal sets of equiangular lines. In the regime where equiangular…
Feature matching is a challenging computer vision task that involves finding correspondences between two images of a 3D scene. In this paper we consider the dense approach instead of the more common sparse paradigm, thus striving to find…
We show a new construction for square packing, and prove that it is more efficient than previous results.
We show for the first time that collectively jammed disordered packings of three-dimensional monodisperse frictionless hard spheres can be produced and tuned using a novel numerical protocol with packing density $\phi$ as low as 0.6. This…
The densest binary sphere packings in the alpha-x plane of small to large sphere radius ratio alpha and small sphere relative concentration x have historically been very difficult to determine. Previous research had led to the prediction…