Related papers: Families of convex tilings
We show that every tiling of a convex set in the Euclidean plane $\mathbb{R}^2$ by equilateral triangles of mutually different sizes contains arbitrarily small tiles. The proof is purely elementary up to the discussion of one family of…
If all tiles in a tiling are congruent, the tiling is called monohedral. Tiling by convex polygons is called edge-to-edge if any two convex polygons are either disjoint or share one vertex or one entire edge in common. In this paper, we…
Tilings of the plane resemble the simplicial and other complexes from algebraic topology, but have not been studied from this perspective. We construct finite categories corresponding to polygons with labeled directed edges, and introduce…
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…
Which polygons admit two (or more) distinct lattice tilings of the plane? We call such polygons double tiles. It is well-known that a lattice tiling is always combinatorially isomorphic either to a grid of squares or to a grid of regular…
In this study, the properties of convex hexagons that can form rotationally symmetric edge-to-edge tilings are discussed. Because the convex hexagons are equilateral convex parallelohexagons, convex pentagons generated by bisecting the…
Convex hexagons that can tile the plane have been classified into three types. For the generic cases (not necessarily convex) of the three types and two other special cases, we classify tilings of the plane under the assumption that all…
We study $C^1$-regular surfaces in $R^3$ that admit tilings by a finite number of rigid motion congruence classes of tiles. We construct examples with various topologies and present a framework for a systematic study, mainly concentrating…
A self-affine tiling of a compact set G of positive Lebesgue measure is its partition to parallel shifts of a compact set which is affinely similar to G. We find all polyhedral sets (unions of finitely many convex polyhedra) that admit…
Rotationally symmetric tilings by a convex pentagonal tile belonging to both the Type 1 and Type 7 families are introduced. Among them are spiral tilings with two- and four-fold rotational symmetry. Those rotationally symmetric tilings are…
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…
The edge-to-edge tilings of the sphere by congruent polygons, where all edges are straight, have been completely classified. We classify the curvilinear version of the similar triangular tilings, where the edges may not be straight, and…
We consider polygons with the following ``pairing property'': for each edge of the polygon there is precisely one other edge parallel to it. We study the problem of when such a polygon $K$ tiles the plane multiply when translated at the…
Does a given a set of polyominoes tile some rectangle? We show that this problem is undecidable. In a different direction, we also consider tiling a cofinite subset of the plane. The tileability is undecidable for many variants of this…
We study decision problems on geometric tilings. First, we study a variant of the Domino problem where square tiles are replaced by geometric tiles of arbitrary shape. We show that this variant is undecidable regardless of the shapes,…
We give a complete classification of edge-to-edge tilings of the sphere by regular polygons under a unified framework. Without assuming convexity of the tiles or polyhedrality of the underlying graph, our proof is independent of the…
Suppose $P$ is a symmetric convex polygon in the plane. We give a polynomial time algorithm that decides if $P$ can tile the plane by transations at some level (not necessarily at level one; this is multiple tiling). The main technical…
We show how to determine if a given simple rectilinear polygon can be tiled with rectangles, each having an integer side.
The periodic tiling conjecture asserts that if a region $\Sigma\subset \mathbb R^d$ tiles $\mathbb R^d$ by translations then it admits at least one fully periodic tiling. This conjecture is known to hold in $\mathbb R$, and recently it was…
Generalizing results by Valette, Zamfirescu and Laczkovich, we will prove that a convex body $K$ is a polytope if there are sufficiently many tilings which contain a tile similar to $K$. Furthermore, we give an example that this can not be…