Tiling complexity of small n-ominoes (N<10)

DOI10.1016/0012-365X(88)90081-7MaRDI QIDQ1114701zbMATH OpenOpenAlexWikidataFDO

Authors Daniel A. Rawsthorne

Publication date 1988

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(88)90081-7

zbMATH Keywords

monohedral plane tilingsn-ominoespolyominoes

Mathematics Subject Classification ID

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

Review text

The author studies monohedral plane tilings by n-ominoes (polyominoes) for \(n<10\). He defines the complexity of a tile as the smallest number of congruent copies of the tile that are needed to form a patch which tiles by translation. A computer is used to calculate the complexity of n- ominoes for small n. Also examples of the different tiling types are given.

Recommendations

• Planar tilings by polyominoes, polyhexes, and polyiamonds
• scientific article; zbMATH DE number 3906514
• Enumeration of Polyominoes, Polyiamonds and Polyhexes for Isohedral Tilings with Rotational Symmetry
• scientific article; zbMATH DE number 7278010
• On the number of p4-tilings by an n-omino

Cites work

• An enneamorphic prototile
• Checker Boards and Polyominoes
• Convex Polygons that Cannot Tile the Plane
• Etalements cristallographiques
• scientific article; zbMATH DE number 3944707 (Why is no real title available?)
• scientific article; zbMATH DE number 3968590 (Why is no real title available?)
• scientific article; zbMATH DE number 3747148 (Why is no real title available?)
• scientific article; zbMATH DE number 3217531 (Why is no real title available?)
• scientific article; zbMATH DE number 3236016 (Why is no real title available?)
• On Paving the Plane
• Polymorphic Polyominoes
• Polymorphic prototiles
• Replicating Figures in the Plane
• Tetramorphic and pentamorphic prototiles
• The eighty-one types of isohedral tilings in the plane
• The Plane Symmetry Groups: Their Recognition and Notation
• Tiling the Plane with Congruent Pentagons
• Tiling with polyominoes
• Tiling with sets of polyominoes
• Tilings with congruent tiles
• Will It Tile? Try the Conway Criterion!

Cited in

(5)

• Planar tilings by polyominoes, polyhexes, and polyiamonds
• Small \(k\)-pyramids and the complexity of determining \(k\)
• A new mathematical model for tiling finite regions of the plane with polyominoes
• scientific article; zbMATH DE number 91040 (Why is no real title available?)
• On the number of isohedral polyominoes

This page was built for publication: Tiling complexity of small n-ominoes \((N<10)\)

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