相关论文: Almost-tiling the plane by ellipses

We develop a simple analytical theory that relates dense sphere packings in a cylinder to corresponding disk packings on its surface. It applies for ratios R=D/d (where d and D are the diameters of the hard spheres and the bounding…

This work investigates dense packings of congruent hard infinitesimally--thin circular arcs in the two-dimensional Euclidean space. It focuses on those denotable as major whose subtended angle $\theta \in \left ( \pi, 2\pi \right ]$.…

Let $\cal T$ be a tiling of the plane with equilateral triangles no two of which share a side. We prove that if the side lengths of the triangles are bounded from below by a positive constant, then $\cal T$ is periodic and it consists of…

This paper generalizes the result of Elmachtoub et al to any weighted barycenter, where a transformation is considered which takes an arbitrary point of division $\xi \in (0,1)$ of the segments of a polygon with $n$ vertices. We then…

We explore an instance of the question of partitioning a polygon into pieces, each of which is as ``circular'' as possible, in the sense of having an aspect ratio close to 1. The aspect ratio of a polygon is the ratio of the diameters of…

Given a natural number $n\geq3$ and two points $a$ and $b$ in the unit disk $\mathbb D$ in the complex plane, it is known that there exists a unique elliptical disk having $a$ and $b$ as foci that can also be realized as the intersection of…

In this note we prove that any monohedral tiling of the closed circular unit disc with $k \leq 3$ topological discs as tiles has a $k$-fold rotational symmetry. This result yields the first nontrivial estimate about the minimum number of…

Motivated by a question of R.\ Nandakumar, we show that the Euclidean plane can be dissected into mutually incongruent convex quadrangles of the same area and the same perimeter. As a byproduct we obtain vertex-to-vertex dissections of the…

A disc packing in the plane is compact if its contact graph is a triangulation. There are $9$ values of $r$ such that a compact packing by discs of radii $1$ and $r$ exists. We prove, for each of these $9$ values, that the maximal density…

In this paper we analyze the extension of the classical smallest enclosing disk problem to the case of the location of a polyellipsoid to fully cover a set of demand points in $\mathbb{R}^d$. We prove that the problem is polynomially…

We consider incomplete tilings of the equilateral triangle of edge length n that is subdivided into n^2 regular equilateral smaller unit triangles. Pairs of the unit triangles that share a side may be converted into lozenges, leaving some…

We determine all non-edge-to-edge tilings of the sphere by regular spherical polygons of three or more sides.

A \emph{cylinder packing} is a family of congruent infinite circular cylinders with mutually disjoint interiors in $3$-dimensional Euclidean space. The \emph{local density} of a cylinder packing is the ratio between the volume occupied by…

We prove that the number of cyclically symmetric, self-complementary plane partitions contained in a cube of side $2n$ equals the square of the number of totally symmetric, self-complementary plane partitions contained in the same cube,…

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…

In this note we prove that for any compact subset $S$ of a Busemann surface $({\mathcal S},d)$ (in particular, for any simple polygon with geodesic metric) and any positive number $\delta$, the minimum number of closed balls of radius…

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…

Consider a set P of points in the unit square U, one of them being the origin. For each point p in P you may draw a rectangle in U with its lower-left corner in p. What is the maximum area such rectangles can cover without overlapping each…

A polyomino is a polygonal region with axis parallel edges and corners of integral coordinates, which may have holes. In this paper, we consider planar tiling and packing problems with polyomino pieces and a polyomino container $P$. We give…

A well-known theorem of Rodin \& Sullivan, previously conjectured by Thurston, states that the circle packing of the intersection of a lattice with a simply connected planar domain $\Omega$ into the unit disc $\mathbb{D}$ converges to a…