A parallelogram tile fills the plane by translation in at most two distinct ways
From MaRDI portal
Publication:423904
DOI10.1016/j.dam.2011.12.023zbMath1309.05044OpenAlexW2066759919MaRDI QIDQ423904
Sébastien Labbé, Alexandre Blondin Massé, Srečko Brlek
Publication date: 30 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.12.023
Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Polyominoes (05B50)
Related Items
On the shape of permutomino tiles, Combinatorial properties of double square tiles, Proving a conjecture on prime double square tiles, On the decomposability of homogeneous binary planar configurations with respect to a given exact polyomino, A generalization of the Fibonacci word fractal and the Fibonacci snowflake
Cites Work
- A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\)
- On the tiling by translation problem
- On translating one polyomino to tile the plane
- Research Problems in Discrete Geometry
- Salient and Reentrant Points of Discrete Sets
- Christoffel and Fibonacci Tiles
- Arbitrary versus periodic storage schemes and tessellations of the plane using one type of polyomino
- Will It Tile? Try the Conway Criterion!
- Developments in Language Theory
- PROPERTIES OF THE CONTOUR PATH OF DISCRETE SETS
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
