An algorithm for deciding if a polyomino tiles the plane

DOI10.1051/ita:2007012zbMath1146.68409OpenAlexW2136900405MaRDI QIDQ5441544

Laurent Vuillon, Ian Gambini

Publication date: 15 February 2008

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2007__41_2_147_0

Mathematics Subject Classification ID

Combinatorics on words (68R15) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Related Items (10)

Small polyomino packing ⋮ ENUMERATION OF n-CONNECTED OMINOES INSCRIBED IN AN ABACUS ⋮ Unnamed Item ⋮ Proving a conjecture on prime double square tiles ⋮ Non-lattice-periodic tilings of \(\mathbb R^3\) by single polycubes ⋮ On the tiling by translation problem ⋮ Tiling the Plane with a Fixed Number of Polyominoes ⋮ Rectangular tileability and complementary tileability are undecidable ⋮ On the Number of p4-Tilings by an n-Omino ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of cutting words on regular tilings
• On translating one polyomino to tile the plane
• Enumeration of symmetry classes of convex polyominoes in the square lattice
• Algebraic languages and polyominoes enumeration
• A method for the enumeration of various classes of column-convex polygons
• A method for cutting squares into distinct squares
• Salient and Reentrant Points of Discrete Sets
• Fast Pattern Matching in Strings
• ECO:a methodology for the enumeration of combinatorial objects

This page was built for publication: An algorithm for deciding if a polyomino tiles the plane