Related papers: Packing anchored rectangles

We consider the optimal containment of polygonal regions within convex containers with the special property of 'orientedness' - an oriented region enables us to choose a preferred direction on the plane (this direction is not necessarily an…

We prove that the space of circle packings consistent with a given triangulation on a surface of genus at least two is projectively rigid, so that a packing on a complex projective surface is not deformable within that complex projective…

The densest packings of N unit squares in a torus are studied using analytical methods as well as simulated annealing. A rich array of dense packing solutions are found: density-one packings when N is the sum of two square integers; a…

We provide the solution for a fundamental problem of geometric optimization by giving a complete characterization of worst-case optimal disk coverings of rectangles: For any $\lambda\geq 1$, the critical covering area $A^*(\lambda)$ is the…

A rectangular partition is the partition of an (axis-aligned) rectangle into interior-disjoint rectangles. We ask whether a rectangular partition permits a "nice" drawing of its dual, that is, a straight-line embedding of it such that each…

Let $s(n)$ be the side length of the smallest square into which $n$ non-overlapping unit squares can be packed. In 2010, the author showed that $s(13)=4$ and $s(46)=7$. Together with the result $s(6)=3$ by Keaney and Shiu, these results…

Let R be a family of n axis-parallel rectangles with packing number p-1, meaning that among any p of the rectangles, there are two with a non-empty intersection. We show that the union complexity of R is at most O(n+p^2), and that the…

In this paper we present a new algorithm for a layout optimization problem: this concerns the placement of weighted polygons inside a circular container, the two objectives being to minimize imbalance of mass and to minimize the radius of…

The problem of packing of equal disks (or circles) into a rectangle is a fundamental geometric problem. (By a packing here we mean an arrangement of disks in a rectangle without overlapping.) We consider the following algorithmic…

If a collection of identical particles is poured into a container, different shapes will fill to different densities. But what is the shape that fills a container as close as possible to a pre-specified, desired density? We demonstrate a…

We consider online packing problems where we get a stream of axis-parallel rectangles. The rectangles have to be placed in the plane without overlapping, and each rectangle must be placed without knowing the subsequent rectangles. The goal…

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…

Random packings and their properties are a popular and active field of research. Numerical algorithms that can efficiently generate them are useful tools in their study. This paper focuses on random packings produced according to the random…

We study the problem of minimum enclosing rectangle with outliers, which asks to find, for a given set of $n$ planar points, a rectangle with minimum area that encloses at least $(n-t)$ points. The uncovered points are regarded as outliers.…

We develop an algorithm to construct new self-similar space-filling packings of spheres. Each topologically different configuration is characterized by its own fractal dimension. We also find the first bi-cromatic packing known up to now.

We study several variations of line segment covering problem with axis-parallel unit squares in $I\!\!R^2$. A set $S$ of $n$ line segments is given. The objective is to find the minimum number of axis-parallel unit squares which cover at…

In this paper, we address the minimum-area rectangular and square annulus problem, which asks a rectangular or square annulus of minimum area, either in a fixed orientation or over all orientations, that encloses a set $P$ of $n$ input…

In the packing-constrained point covering problem, PC^2, one seeks configurations of points in the plane that cannot all be covered by a packing arrangement of unit disks. We consider in particular the problem of finding the minimum number…

Let P be a polygon with rational vertices in the plane. We show that for any finite odd-sized collection of translates of P, the area of the set of points lying in an odd number of these translates is bounded away from 0 by a constant…

A homothetic packing of squares is any set of various-size squares with the same orientation where no two squares have overlapping interiors. If all $n$ squares have the same size then we can have up to roughly $4n$ contacts by arranging…