Arbitrary versus periodic storage schemes and tessellations of the plane using one type of polyomino
From MaRDI portal
Publication:3720616
DOI10.1016/S0019-9958(84)80007-8zbMath0592.05017OpenAlexW2049151402MaRDI QIDQ3720616
Harry A. G. Wijshoff, Jan van Leeuwen
Publication date: 1984
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(84)80007-8
Cellular automata (computational aspects) (68Q80) Combinatorial aspects of tessellation and tiling problems (05B45) Polyominoes (05B50)
Related Items (20)
Tiling with arbitrary tiles ⋮ On the shape of permutomino tiles ⋮ Combinatorial properties of double square tiles ⋮ Tiling with Squares and Packing Dominos in Polynomial Time ⋮ Proving a conjecture on prime double square tiles ⋮ Undecidable translational tilings with only two tiles, or one nonabelian tile ⋮ The structure of translational tilings in $\mathbb{Z}^d$ ⋮ A parallelogram tile fills the plane by translation in at most two distinct ways ⋮ Non-lattice-periodic tilings of \(\mathbb R^3\) by single polycubes ⋮ Two infinite families of polyominoes that tile the plane by translation in two distinct ways ⋮ A generalization of the Fibonacci word fractal and the Fibonacci snowflake ⋮ On translating one polyomino to tile the plane ⋮ Periodicity of one-dimensional tilings ⋮ Attribute grammars are useful for combinatorics ⋮ On covering by translates of a set ⋮ On the tiling by translation problem ⋮ Tiling the Plane with a Fixed Number of Polyominoes ⋮ DISCLIKE LATTICE REPTILES INDUCED BY EXACT POLYOMINOES ⋮ Algorithms for translational tiling ⋮ Christoffel and Fibonacci Tiles
This page was built for publication: Arbitrary versus periodic storage schemes and tessellations of the plane using one type of polyomino