Related papers: Polyominoes Simulating Arbitrary-Neighborhood Zipp…
We consider a certain tiling problem of a planar region in which there are no long horizontal or vertical strips consisting of copies of the same tile. Intuitively speaking, we would like to create a dappled pattern with two or more kinds…
It is well-known that the question of whether a given finite region can be tiled with a given set of tiles is NP-complete. We show that the same is true for the right tromino and square tetromino on the square lattice, or for the right…
This paper investigates the use of a sampling-based approach, the RRT*, to reconfigure a 2D set of connected tiles in complex environments, where multiple obstacles might be present. Since the target application is automated building of…
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…
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…
Aperiodic tilings are non-periodic tilings defined by local rules. They are widely used to model quasicrystals, and a central question is to understand which of the non-periodic tilings are actually aperiodic. Among tilings, those by rhombi…
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…
We prove that fairly general spaces of tilings of R^d are fiber bundles over the torus T^d, with totally disconnected fiber. This was conjectured (in a weaker form) in [W3], and proved in certain cases. In fact, we show that each such space…
Tiling planar regions with dominoes is a classical problem in which the decision and counting problems are polynomial. We prove a variety of hardness results (both NP- and #P-completeness) for different generalizations of dominoes in three…
A finite set of integers $A$ tiles the integers by translations if $\mathbb{Z}$ can be covered by pairwise disjoint translated copies of $A$. Restricting attention to one tiling period, we have $A\oplus B=\mathbb{Z}_M$ for some…
Given a graph $G$ and collection of subgraphs $T$ (called tiles), we consider covering $G$ with copies of tiles in $T$ so that each vertex $v\in G$ is covered with a predetermined multiplicity. The multinomial tiling model is a natural…
Aperiodic tilings support two classically studied but hitherto separately presented structures: matching rules, which enforce global order via local constraints, and height functions, which encode global geometry through integer-valued…
We present a construction of a family of non-periodic tilings using elementary tools such as modular arithmetic and vector geometry. These tilings exhibit a distinct type of structural regularity, which we term modulo-staggered rotational…
A challenge of molecular self-assembly is to understand how to design particles that self-assemble into a desired structure and not any of a potentially large number of undesired structures. Here we use simulation to show that a strategy of…
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…
We study the space of all tilings which can be obtained using the Robinson tiles (this is a two-dimensional subshift of finite type). We prove that it has a unique minimal subshift, and describe it by means of a substitution. This…
In this paper we consider uniformly random lozenge tilings of arbitrary domains approximating (after suitable normalization) a closed, simply-connected subset of $\mathbb{R}^2$ with piecewise smooth, simple boundary. We show that the local…
Given a point configuration A, we uncover a connection between polynomial-reproducing spline spaces over subsets of conv(A) and fine zonotopal tilings of the zonotope Z(V) associated to the corresponding vector configuration. This link…
A plane tiling consisting of congruent copies of a shape is isohedral provided that for any pair of copies, there exists a symmetry of the tiling mapping one copy to the other. We give a $O(n\log^2{n})$-time algorithm for deciding if a…
This paper is intended to provide an introduction to the theory of substitution tilings. For our purposes, tiling substitution rules are divided into two broad classes: geometric and combinatorial. Geometric substitution tilings include…