Planar tilings by polyominoes, polyhexes, and polyiamonds

Authors:
Glenn C. Rhoads
Affiliations:
Department of Computer Science, Rutgers, the State University of NJ, 110 Frelinghuysen Road, Piscataway, NJ
Venue:
Journal of Computational and Applied Mathematics
Year:
2005

Citing 4
Cited 4

Tilings and patterns

Tilings and patterns
Tiling complexity of small n-ominoes (n

Discrete Mathematics
Elements of the Theory of Computation

Elements of the Theory of Computation
Planar tilings and the search for an aperiodic prototile

Planar tilings and the search for an aperiodic prototile

Reliable networks with unreliable sensors

ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
How to tile by dominoes the boundary of a polycube

DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Fast track article: Reliable networks with unreliable sensors

Pervasive and Mobile Computing
Packing polyominoes clumsily

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	7.29

Visualization

Abstract

Using computer programs, we enumerate and classify the tiling behavior of small polyominoes (n ≤ 9), polyhexes (n ≤ 7), and polyiamonds (n ≤ 10). For tiles that tile the Euclidean plane, we give diagrams illustrating how they tile. We also show several larger tiles whose minimal fundamental domain in any admitted (periodic) tiling is significantly larger than for any previously known tile.