Related papers: Dense packings of hard circular arcs
The densest local packings of N identical nonoverlapping spheres within a radius Rmin(N) of a fixed central sphere of the same size are obtained using a nonlinear programming method operating in conjunction with a stochastic search of…
Packing problems have been of great interest in many diverse contexts for many centuries. The optimal packing of identical objects has been often invoked to understand the nature of low temperature phases of matter. In celebrated work,…
Particle packing problems have fascinated people since the dawn of civilization, and continue to intrigue mathematicians and scientists. Resurgent interest has been spurred by the recent proof of Kepler's conjecture: the face-centered cubic…
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…
Packing problems, which ask how to arrange a collection of objects in space to meet certain criteria, are important in a great many physical and biological systems, where geometrical arrangements at small scales control behaviour at larger…
An ellipsoid, the simplest non-spherical shape, has been extensively used as models for elongated building blocks for a wide spectrum of molecular, colloidal and granular systems. Yet the densest packing of congruent hard ellipsoids, which…
This paper encompasses the mathematical derivations of the analytic and generalized formula and recurrence relations to find out the radii of n umber of circles inscribed or packed in the plane region bounded by circular arcs (including…
We study the Hard Core Model on the graphs ${\rm {\bf \scriptstyle G}}$ obtained from Archimedean tilings i.e. configurations in $\scriptstyle \{0,1\}^{{\rm {\bf G}}}$ with the nearest neighbor 1's forbidden. Our particular aim in choosing…
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…
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…
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 provide a tight result for a fundamental problem arising from packing disks into a circular container: The critical density of packing disks in a disk is 0.5. This implies that any set of (not necessarily equal) disks of total area…
The packing of hard spheres (HS) of diameter $\sigma$ in a cylinder has been used to model experimental systems, such as fullerenes in nanotubes and colloidal wire assembly. Finding the densest packings of HS under this type of confinement,…
We present a new numerical scheme to study systems of non-convex, irregular, and punctured particles in an efficient manner. We employ this method to analyze regular packings of odd-shaped bodies, not only from a nanoparticle but also both…
We consider the density of two-dimensional critical percolation clusters, constrained to touch one or both boundaries, in infinite strips, half-infinite strips, and squares, as well as several related quantities for the infinite strip. Our…
Motivated by a recently identified severe discrepancy between a static and a dynamic theory of glasses, we numerically investigate the behavior of dense hard spheres in spatial dimensions 3 to 12. Our results are consistent with the static…
Packing under confinement could generate rich ordered structures through entropic effects, which is a fundamental problem in condensed matter, biophysics and material science. The influence of confinement to the anisotropic hard…
We prove that the highest density of non-overlapping translates of a given centrally symmetric convex domain relative to its outer parallel domain of given outer radius is attained by a lattice packing in the Euclidean plane. This…
We carry out ray tracing through five high resolution simulations of a galaxy cluster to study how its ability to produce giant gravitationally lensed arcs is influenced by the collision cross-section of its dark matter. In three cases…
We present a method for discovering dense packings of general convex hard particles and apply it to study the dense packing behavior of a one-parameter family of particles with tetrahedral symmetry representing a deformation of the ideal…