On the tiling by translation problem

DOI10.1016/J.DAM.2008.05.026MaRDI QIDQ1003706zbMATH OpenOpenAlexFDO

Authors Srečko Brlek, Xavier Provençal, Jean-Marc Fédou

Publication date 4 March 2009

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2008.05.026

zbMATH Keywords

plane tesselationlongest common extensionstiling polyominoes

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Polyominoes (05B50)

Recommendations

• An optimal algorithm for tiling the plane with a translated polyomino
• An Optimal Algorithm for Detecting Pseudo-squares
• An algorithm for deciding if a polyomino tiles the plane
• Tilings by translation: enumeration by a rational language approach
• On translating one polyomino to tile the plane

Cites work

• scientific article; zbMATH DE number 687006 (Why is no real title available?)
• scientific article; zbMATH DE number 1024080 (Why is no real title available?)
• scientific article; zbMATH DE number 2183071 (Why is no real title available?)
• scientific article; zbMATH DE number 3380607 (Why is no real title available?)
• Algorithms on Strings, Trees and Sequences
• An algorithm for deciding if a polyomino tiles the plane
• Arbitrary versus periodic storage schemes and tessellations of the plane using one type of polyomino
• Checker Boards and Polyominoes
• Developments in Language Theory
• Euclidean Paths: A New Representation of Boundary of Discrete Regions
• Linear time algorithms for finding and representing all the tandem repeats in a string
• On translating one polyomino to tile the plane
• PROPERTIES OF THE CONTOUR PATH OF DISCRETE SETS
• Salient and Reentrant Points of Discrete Sets
• The undecidability of the domino problem

Cited in

(32)

• Proving a conjecture on prime double square tiles
• Tilings by translation: enumeration by a rational language approach
• The estimation of the number of \(p2\)-tilings of a plane on a polyomino of given area
• Combinatorial properties of double square tiles
• On the number of isohedral polyominoes
• A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\)
• Lyndon + Christoffel = digitally convex
• Tiling Periodicity
• Holey matrimony: marrying two approaches to a tiling problem
• Non-lattice-periodic tilings of R^3 by single polycubes
• Tiling the plane with permutations
• An algorithm for deciding if a polyomino tiles the plane
• Arithmetic Discrete Planes Are Quasicrystals
• Convex and concave vertices on a simple closed curve in the triangular grid
• scientific article; zbMATH DE number 7278010 (Why is no real title available?)
• A generalization of the Fibonacci word fractal and the Fibonacci snowflake
• scientific article; zbMATH DE number 5938992 (Why is no real title available?)
• Christoffel and Fibonacci tiles
• scientific article; zbMATH DE number 1504645 (Why is no real title available?)
• An Optimal Algorithm for Detecting Pseudo-squares
• Combinatorial View of Digital Convexity
• About thin arithmetic discrete planes
• Two infinite families of polyominoes that tile the plane by translation in two distinct ways
• On the number of p4-tilings by an \(n\)-omino
• Tiling periodicity
• Algorithms for translational tiling
• Translational Prototiles on a Lattice
• scientific article; zbMATH DE number 6665105 (Why is no real title available?)
• A linear time and space algorithm for detecting path intersection
• On the shape of permutomino tiles
• A parallelogram tile fills the plane by translation in at most two distinct ways
• An optimal algorithm for tiling the plane with a translated polyomino

This page was built for publication: On the tiling by translation problem

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