Related papers: Densest plane group packings of regular polygons
Packings of hard polyhedra have been studied for centuries due to their mathematical aesthetic and more recently for their applications in fields such as nanoscience, granular and colloidal matter, and biology. In all these fields, particle…
We have recently devised organizing principles to obtain maximally dense packings of the Platonic and Archimedean solids, and certain smoothly-shaped convex nonspherical particles [Torquato and Jiao, Phys. Rev. E 81, 041310 (2010)]. Here we…
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 study dense packings of a large number of congruent non-overlapping circles inside a square by looking for configurations which maximize the packing density, defined as the ratio between the area occupied by the disks and the area of the…
We consider circle packings in the plane with circles of sizes $1$, $r\simeq 0.834$ and $s\simeq 0.651$. These sizes are algebraic numbers which allow a compact packing, that is, a packing in which each hole is formed by three mutually…
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…
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…
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 present a model development framework and numerical solution approach to the general problem-class of packing convex objects into optimized convex containers. Specifically, here we discuss the problem of packing ovals (egg-shaped…
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…
Based on Minkowski's work on critical lattices of 3-dimensional convex bodies we present an efficient algorithm for computing the density of a densest lattice packing of an arbitrary 3-polytope. As an application we calculate densest…
We consider the problem of constructing dense lattices of R^n with a given automorphism group. We exhibit a family of such lattices of density at least cn/2^n, which matches, up to a multiplicative constant, the best known density of 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 investigate approximation algorithms for several fundamental optimization problems on geometric packing. The geometric objects considered are very generic, namely $d$-dimensional convex fat objects. Our main contribution is a versatile…
How should you choose a good set of (say) 48 planes in four dimensions? More generally, how do you find packings in Grassmannian spaces? In this article I give a brief introduction to the work that I have been doing on this problem in…
Motivated by biological questions, we study configurations of equal-sized disks in the Euclidean plane that neither pack nor cover. Measuring the quality by the probability that a random point lies in exactly one disk, we show that the…
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,…
We introduce and study certain notions which might serve as substitutes for maximum density packings and minimum density coverings. A body is a compact connected set which is the closure of its interior. A packing $\cal P$ with congruent…
Dense packings of nonoverlapping bodies in three-dimensional Euclidean space are useful models of the structure of a variety of many-particle systems that arise in the physical and biological sciences. Here we investigate the packing…
This paper determines the optimal upper bound for the simultaneous packing and covering constants of the two-dimensional centrally symmetric convex domains. It solved a problem opening for more than thirty years.