Related papers: On Continuity Properties for Infinite Rectangle Pa…
A method for converting the geometrical problem of rectangle packing to an algebraic problem of solving a system of polynomial equations is described.
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…
Circle packings are arrangement of circles satisfying specified tangency requirements. Many problems about packing of circles and spheres occur in nature particularly in material design and protein structure. Surprisingly, little is known…
A projective rectangle is like a projective plane that has different lengths in two directions. We develop the basic theory of projective rectangles including incidence properties, projective subplanes, configuration counts, a partial…
Consider a set $P$ of $n$ points on the boundary of an axis-aligned square $Q$. We study the boundary-anchored packing problem on $P$ in which the goal is to find a set of interior-disjoint axis-aligned rectangles in $Q$ such that each…
We study the problem of perfect tiling in the plane and exploring the possibility of tiling a rectangle using integral distinct squares. Assume a set of distinguishable squares (or equivalently a set of distinct natural numbers) is given,…
This paper explores the finiteness of the solution set of the polynomial complementarity problem (PCP). To achieve this goal, we introduce two new classes of structured tensor tuples, namely the nondegenerate tensor tuple and the strong…
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…
In this paper we discuss various special problems on packing and covering. Among others we survey the problems and results concerning finite arrangements, Minkowskian, saturated, compact, and totally separable packings. We discuss shortest…
It is known that $\sum\limits_{i =1}^\infty {1/ i^2}={\pi^2/6}$. Meir and Moser asked what is the smallest $\epsilon$ such that all the squares of sides of length $1$, $1/2$, $1/3$, $\ldots$ can be packed into a rectangle of area…
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…
In the classic circle packing problem, one asks whether a given set of circles can be packed into a given container. Packing problems like this have been shown to be $\mathsf{NP}$-hard. In this paper, we present new sufficient conditions…
The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping unit balls which cover as much space as possible. We define a generalized version of the problem, where we allow each ball a limited amount of…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Combining the use of our data structure for characterizing feasible packings with our new classes of…
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…
We consider the problem of packing congruent circles with the maximum radius in a unit square as a mathematical optimization problem. Due to the presence of non-overlapping constraints, this problem is a notoriously difficult nonconvex…
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…
Any space-filling packing of spheres can be cut by a plane to obtain a space-filling packing of disks. Here, we deal with space-filling packings generated using inversive geometry leading to exactly self-similar fractal packings. First, we…
A rectangulation is a tiling of a rectangle by a finite number of rectangles. The rectangulation is called generic if no four of its rectangles share a single corner. We initiate the enumeration of generic rectangulations up to…
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…