Related papers: Packing anchored rectangles
We show that for certain triangulations of surfaces, circle packings realising the triangulation can be found by solving a system of polynomial equations. We also present a similar system of equations for unbranched circle packings. The…
We show that packing axis-aligned unit squares into a simple polygon $P$ is NP-hard, even when $P$ is an orthogonal and orthogonally convex polygon with half-integer coordinates. It has been known since the early 80s that packing unit…
We consider the online problem of packing circles into a square container. A sequence of circles has to be packed one at a time, without knowledge of the following incoming circles and without moving previously packed circles. We present an…
Compact packings are specific packings of spheres which can be seen as tilings and are good candidates to maximize the density. We show that the compact packings of the Euclidean space with two sizes of spheres are exactly those obtained by…
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,…
Packing problems, even of objects with regular geometries, are in general non-trivial. For few special shapes, the features of crystalline as well as random, irregular two-dimensional (2D) packings are known. The packing of 2D crosses does…
The problem that we consider is the following: given an $n \times n$ array $A$ of positive numbers, find a tiling using at most $p$ rectangles (which means that each array element must be covered by some rectangle and no two rectangles must…
We study saturated packings produced according to random sequential adsorption (RSA) protocol built of identical rectangles deposited on a flat, continuous plane. An aspect ratio of rectangles is defined as the length-to-width ratio,…
In this paper we consider the problem of packing a fixed number of identical circles inside the unit circle container, where the packing is complicated by the presence of fixed size circular prohibited areas. Here the objective is to…
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 put forward a simple construction of genuinely entangled subspaces -- subspaces supporting only genuinely multipartite entangled states -- of any permissible dimensionality for any number of parties and local dimensions. The method uses…
This paper describes a numerical method for finding good packings in Grassmannian manifolds equipped with various metrics. This investigation also encompasses packing in projective spaces. In each case, producing a good packing is…
The goal of random sequential adsorption (RSA), a time-dependent packing method, is to create a regular or asymmetric covering of an empty space that can fit in the allocated space without overlapping. The density of coverage tends to reach…
Inversive geometry can be used to generate exactly self-similar space-filling sphere packings. We present a construction method in two dimensions and generalize it to search for packings in higher dimensions. We newly discover 29…
We show a new construction for square packing, and prove that it is more efficient than previous results.
In their 2009 note: \emph{Packing equal squares into a large square}, Chung and Graham proved that the uncovered area of a large square of side length $x$ is $O\left(x^{(3+\sqrt{2})/7}\log x\right)$ after maximum number of non-overlapping…
The ordered configuration space of $n$ open unit squares in the $w$ by $h$ rectangle exhibits homological stability in the space direction. That is, for fixed $n$ and fixed homological degree $k$, once the underlying rectangle is large…
We study the optimal packing of hard spheres in an infinitely long cylinder, using simulated annealing, and compare our results with the analogous problem of packing disks on the unrolled surface of a cylinder. The densest structures are…
We present filling as a type of spatial subdivision problem similar to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most interior volume. In…
Studies of random close packing of spheres have advanced our knowledge about the structure of systems such as liquids, glasses, emulsions, granular media, and amorphous solids. When these systems are confined their structural properties…