Related papers: Almost-tiling the plane by ellipses
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…
Suppose that $I$ is a unit square. Let $T$ (resp. $\Delta$) be an isosceles right triangle (resp. an equilateral triangle). We prove that any collection of triangles homothetic to $T$ (resp. $\Delta$), whose total area does not exceed…
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…
The problem of packing Hamilton cycles in random and pseudorandom graphs has been studied extensively. In this paper, we look at the dual question of covering all edges of a graph by Hamilton cycles and prove that if a graph with maximum…
In this paper we generalize the classical theorem of Thue about the optimal circular disc packing in the plane. We are given a family of circular discs, not necessarily of equal radii, with the property that the inflation of every disc by a…
Answering a question of Wilf, we show that if $n$ is sufficiently large, then one cannot cover an $n \times p(n)$ rectangle using each of the $p(n)$ distinct Ferrers shapes of size $n$ exactly once. Moreover, the maximum number of pairwise…
We investigate the problem of packing identical hard objects on regular lattices in d dimensions. Restricting configuration space to parallel alignment of the objects, we study the densest packing at a given aspect ratio X. For rectangles…
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…
The well-known problem stated by A. Meir and L. Moser consists in tiling the unit square with rectangles (details), whose side lengths equal $1/n\times 1/(n+1)$, where indices~$n$ range from 1 to infinity. Recently, Terence Tao has proved…
These results complete our paper in Hiroshima Mathematical Journal, vol. 42, pp. 37-75. Let C be a covering of the plane by disjoint complete folding curves which satisfies the local isomorphism property. We show that C is locally…
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…
Given a finite collection of two-dimensional tile types, the field of study concerned with covering the plane with tiles of these types exclusively has a long history, having enjoyed great prominence in the last six to seven decades. Much…
We consider packings of the plane using discs of radius 1 and r=0.545151... . The value of r admits compact packings in which each hole in the packing is formed by three discs which are tangent to each other. We prove that the largest…
For an angle $\alpha\in (0,\pi)$, we consider plane graphs and multigraphs in which the edges are either (i) one-bend polylines with an angle $\alpha$ between the two edge segments, or (ii) circular arcs of central angle $2(\pi-\alpha)$. We…
The number of plane partitions contained in a given box was shown by MacMahon to be given by a simple product formula. By a simple bijection, this formula also enumerates lozenge tilings of hexagons of side-lengths $a,b,c,a,b,c$ (in cyclic…
Given a periodic placement of copies of a tromino (either L or I), we prove co-RE-completeness (and hence undecidability) of deciding whether it can be completed to a plane tiling. By contrast, the problem becomes decidable if the initial…
We study the problem of covering a given point set in the plane by unit disks so that each point is covered exactly once. We prove that 17 points can always be exactly covered. On the other hand, we construct a set of 657 points where an…
Consider a periodical (in two independent directions) tiling of the plane with polygons (faces). In this article we shall only give examples using squares, regular hexagons, equilateral triangles and parallelograms ("unions" of two…
It is possible to have a packing by translates of a cube that is maximal (i.e.\ no other cube can be added without overlapping) but does not form a tiling. In the long running analogy of packing and tiling to orthogonality and completeness…
We adapt a construction of Klee (1981) to find a packing of unit balls in $\ell_p$ ($1\leq p<\infty$) which is efficient in the sense that enlarging the radius of each ball to any $R>2^{1-1/p}$ covers the whole space. We show that the value…