An algorithm for deciding if a polyomino tiles the plane

DOI10.1051/ITA:2007012MaRDI QIDQ5441544zbMATH OpenOpenAlexFDO

Authors L. Vuillon, I. 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, http://www.numdam.org/item?id=ITA_2007__41_2_147_0/, https://eudml.org/doc/92836

Mathematics Subject Classification ID

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

Recommendations

• An optimal algorithm for tiling the plane with a translated polyomino
• Isohedral polyomino tiling of the plane
• A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino
• An Optimal Algorithm for Detecting Pseudo-squares
• On the tiling by translation problem

Cites work

• A method for cutting squares into distinct squares
• A method for the enumeration of various classes of column-convex polygons
• Algebraic languages and polyominoes enumeration
• Complexity of cutting words on regular tilings
• ECO:a methodology for the enumeration of combinatorial objects
• Enumeration of symmetry classes of convex polyominoes in the square lattice
• Fast Pattern Matching in Strings
• scientific article; zbMATH DE number 687006 (Why is no real title available?)
• scientific article; zbMATH DE number 2046044 (Why is no real title available?)
• scientific article; zbMATH DE number 1795967 (Why is no real title available?)
• Introduction to algorithms
• On translating one polyomino to tile the plane
• Salient and Reentrant Points of Discrete Sets

Cited in

(25)

• On the tiling by translation problem
• Isohedral polyomino tiling of the plane
• On the exact complexity of polyomino packing
• Small polyomino packing
• A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino
• A new mathematical model for tiling finite regions of the plane with polyominoes
• On the exact complexity of polyomino packing
• Minimum boundary touching tilings of polyominoes
• An optimal algorithm for tiling the plane with a translated polyomino
• Tiling the Plane with a Fixed Number of Polyominoes
• scientific article; zbMATH DE number 3906514 (Why is no real title available?)
• Arbitrary versus periodic storage schemes and tessellations of the plane using one type of polyomino
• Non-lattice-periodic tilings of R^3 by single polycubes
• ENUMERATION OF n-CONNECTED OMINOES INSCRIBED IN AN ABACUS
• scientific article; zbMATH DE number 7278010 (Why is no real title available?)
• On the number of p4-tilings by an n-omino
• The estimation of the number of p2-tilings of a plane on a polyomino of given area
• An Optimal Algorithm for Detecting Pseudo-squares
• On the arithmetics of discrete figures
• Polyomino convolutions and tiling problems
• Proving a conjecture on prime double square tiles
• Tiling the plane with a set of ten polyominoes
• On the number of isohedral polyominoes
• Self-avoiding closed curves in the regular and semiregular grids
• Rectangular tileability and complementary tileability are undecidable

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5441544)