Recommendations
- A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino
- An algorithm for deciding if a polyomino tiles the plane
- An optimal algorithm for tiling the plane with a translated polyomino
- Tiling the Plane with a Fixed Number of Polyominoes
- On translating one polyomino to tile the plane
Cited in
(18)- Planar tilings by polyominoes, polyhexes, and polyiamonds
- Enumeration of Polyominoes, Polyiamonds and Polyhexes for Isohedral Tilings with Rotational Symmetry
- Tiling the plane with a set of ten polyominoes
- Polyomino convolutions and tiling problems
- Tiling Three-Dimensional Space with Polyhedral Tiles of a Given Isomorphism Type
- Tiling the Plane with a Fixed Number of Polyominoes
- scientific article; zbMATH DE number 6897879 (Why is no real title available?)
- On the number of isohedral polyominoes
- Non-lattice-periodic tilings of R^3 by single polycubes
- scientific article; zbMATH DE number 7742570 (Why is no real title available?)
- An algorithm for deciding if a polyomino tiles the plane
- Rectangular tileability and complementary tileability are undecidable
- A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino
- On characterizations of spectra and tilings
- An Optimal Algorithm for Detecting Pseudo-squares
- Arbitrary versus periodic storage schemes and tessellations of the plane using one type of polyomino
- A new approach towards the Golomb-Welch conjecture
- An optimal algorithm for tiling the plane with a translated polyomino
This page was built for publication: Isohedral polyomino tiling of the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1293680)
