Abstract
We describe computer algorithms that can enumerate and display, for a given nā>ā0 (in theory, of any size), all n-ominoes, n-iamonds, and n-hexes that can tile the plane using only rotations; these sets necessarily contain all such tiles that are fundamental domains for p4, p3, and p6 isohedral tilings. We display the outputs for small values of n. This expands on earlier work [3].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Coxeter, H.S.M., Moser, W.O.J.: Generators and Relations for Discrete Groups. Springer, New York (1965)
Schattschneider, D.: The plane symmetry groups: their recognition and notation. American Mathematical MonthlyĀ 85, 439ā450 (1978)
Fukuda, H., Mutoh, N., Nakamura, G., Schattschneider, D.: A Method to Generate Polyominoes and Polyiamonds for Tilings with Rotational Symmetry. Graphs and CombinatoricsĀ (suppl. 23), 259ā267 (2007)
Heesch, H., Kienzle, O.: FlƤchenschluss. System der Formen lĆ¼ckenlos aneinanderschliessender Flachteile. Springer, Heidelberg (1963)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fukuda, H., Mutoh, N., Nakamura, G., Schattschneider, D. (2008). Enumeration of Polyominoes, Polyiamonds and Polyhexes for Isohedral Tilings with Rotational Symmetry. In: Ito, H., Kano, M., Katoh, N., Uno, Y. (eds) Computational Geometry and Graph Theory. KyotoCGGT 2007. Lecture Notes in Computer Science, vol 4535. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89550-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-89550-3_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89549-7
Online ISBN: 978-3-540-89550-3
eBook Packages: Computer ScienceComputer Science (R0)