Related papers: A Quasilinear-Time Algorithm for Tiling the Plane …
We give a $O(n)$-time algorithm for determining whether translations of a polyomino with $n$ edges can tile the plane. The algorithm is also a $O(n)$-time algorithm for enumerating all such tilings that are also regular, and we prove that…
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…
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…
A group-theoretical approach to the construction of quasiperiodic tilings of a Euclidean plane, possessing five-fold symmetry, is applied. Of the infinitely many of variants of quasiperiodic partitions of the plane, possessing the dihedral…
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…
An algorithm is provided to tile the plane with the aperiodic monotile Tile(1,1) recently discovered by Smith et al. (2023). Their geometric construction guidelines are expanded into a numerical MATLAB algorithm. The intention is to remove…
We present a simplified proof of a forty-year-old result concerning the tiling of the plane with equilateral convex polygons. Our approach is based on a theorem by M. Rao, who used an exhaustive computer search to confirm the completeness…
In this paper, we give a proof that it is undecidable whether a set of five polyominoes can tile the plane by translation. The proof involves a new method of labeling the edges of polyominoes, making it possible to assign whether two edges…
We give a proof of Ollinger's conjecture that the problem of tiling the plane with translated copies of a set of $8$ polyominoes is undecidable. The techniques employed in our proof include a different orientation for simulating the Wang…
In [B.Gruenbaum, G.C. Shephard, Spherical tilings with transitivity properties, in: The geometric vein, Springer, New York, 1981, pp. 65-98], they proved "for every spherical normal tiling by congruent tiles, if it is isohedral, then the…
We provide a polynomial time cutting plane algorithm based on split cuts to solve integer programs in the plane. We also prove that the split closure of a polyhedron in the plane has polynomial size.
We study tilings of the plane composed of two repeating tiles of different assigned areas relative to an arbitrary periodic lattice. We classify isoperimetric configurations (i.e., configurations with minimal length of the interfaces) both…
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,…
We describe computer algorithms that produce the complete set of isohedral tilings by n-omino or n-iamond tiles in which the tiles are fundamental domains and the tilings have 3-, 4-, or 6-fold rotational symmetry. The symmetry groups of…
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…
The paper provides an elementary proof of Kenyon's necessary condition for the existence of a periodic tiling of the plane by squares with given periods. A similar new result on covering both sides of a rectangle by nonoverlaping squares is…
I show how to express the question of whether a polyform tiles the plane isohedrally as a Boolean formula that can be tested using a SAT solver. This approach is adaptable to a wide range of polyforms, requires no special-case code for…
We study tilings of the plane that combine strong properties of different nature: combinatorial and algorithmic. We prove existence of a tile set that accepts only quasiperiodic and non-recursive tilings. Our construction is based on the…
A plane graph is rectilinear planar if it admits an embedding-preserving straight-line drawing where each edge is either horizontal or vertical. We prove that rectilinear planarity testing can be solved in optimal $O(n)$ time for any plane…
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…