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

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…

We consider the problem of identifying n points in the plane using disks, i.e., minimizing the number of disks so that each point is contained in a disk and no two points are in exactly the same set of disks. This problem can be seen as an…

This paper characterizes when an $m \times n$ rectangle, where $m$ and $n$ are integers, can be tiled (exactly packed) by squares where each has an integer side length of at least 2. In particular, we prove that tiling is always possible…

By rectangle packing we mean putting a set of rectangles into an enclosing rectangle, without any overlapping. We begin with perfect rectangle packing problems, then prove two continuity properties for parallel rectangle packing problems,…

We prove that if the outer billiard map around a plane oval is algebraically integrable in a certain non-degenerate sense then the oval is an ellipse.

We show that there is no $(1+\eps)$-approximation algorithm for the problem of covering points in the plane by minimum number of fat triangles of similar size (with the minimum angle of the triangles being close to 45 degrees). Here, the…

Let $A$ be any plane set. It is known that a holomorphic motion $h: A \times \mathbb{D} \to \mathbb{C}$ always extends to a holomorphic motion of the entire plane. It was recently shown that any isotopy $h: X \times [0,1] \to \mathbb{C}$,…

A tiling is said to have infinite local complexity (ILC) if it contains infinitely many two-tile patches up to rigid motions. In this work, we provide examples of substitution rules that generate tilings with ILC. The proof relies on…

We consider here square tilings of the plane. By extending the formalism introduced in [3] we build a correspondence between plane maps endowed with an harmonic vector and square tilings satisfying a condition of regularity. In the case of…

Jung's theorem says that planar sets of diameter $1$ can be covered by a closed circular disk of radius $\frac 1{\sqrt3}$. In this paper we consider a fractional Jung-type problem for finite planar point-sets. Let $\mathcal{P}_n$ be the…

Let $(N,\Phi)$ be a circular Ferrero pair. We define the disk with center $b$ and radius $a$, $\mathcal{D}(a;b)$, as \[\mathcal{D}(a;b)=\{x\in \Phi(r)+c\mid r\neq 0,\ b\in \Phi(r)+c,\ |(\Phi(r)+c)\cap (\Phi(a)+b)|=1\}.\] We prove that in…

The present paper reports a novel behavior involving regular polygons with n sides and filled to varying degrees with granular materials. These are comprised of a set of hollow polygons produced on a 3D printer, and a single larger hollow…

Let $P_{n}$ be a set of $n$ points, including the origin, in the unit square $U = [0,1]^2$. We consider the problem of constructing $n$ axis-parallel and mutually disjoint rectangles inside $U$ such that the bottom-left corner of each…

The main purpose of this article is to demonstrate three techniques for proving algebraicity statements about circle packings. We give proofs of three related theorems: (1) that every finite simple planar graph is the contact graph of a…

We show that the problem of tiling the Euclidean plane with a finite set of polygons (up to translation) boils down to prove the existence of zeros of a non-negative convex function defined on a finite-dimensional simplex. This function is…

Apollonian circle packings arise by repeatedly filling the interstices between four mutually tangent circles with further tangent circles. Such packings can be described in terms of the Descartes configurations they contain. It observed…

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…

In the early 1990s, A. Bezdek and W. Kuperberg used a relatively simple argument to show a surprising result: The maximum packing density of circular cylinders of infinite length in $\mathbb{R}^3$ is exactly $\pi/\sqrt{12}$, the planar…

In contrast to many known results concerning periodic tilings of the Euclidean plane with pentagons, here tilings with rotational symmetry are investigated. A certain class of convex pentagons is introduced. It can be shown that for any…

Surface area and mean width of a cylinder (the convex hull of two parallel disks) in R^3 are computed. It is more difficult to obtain analogous results for a cone (the convex hull of a disk D and a point p). Oblique formulas for mean width,…