Euclidean tilings by convex regular polygons: Difference between revisions

Revision as of 14:10, 7 August 2025

Latest revision as of 22:16, 13 August 2025

Line 13:

== Notation of Euclidean tilings ==

Euclidean tilings are usually named after Cundy & Rollett’s notation.<ref>{{cite book |last1=Cundy |first1=H.M.|last2=Rollett |first2=A.P. |title=Mathematical Models; |date=1981 |publisher=Tarquin Publications |___location=Stradbroke (UK)}}</ref> This notation represents (i) the number of vertices, (ii) the number of polygons around each vertex (arranged clockwise) and (iii) the number of sides to each of those polygons. For example: 3⁶; 3⁶; 3⁴.6, tells us there are 3 vertices with 2 different vertex types, so this tiling would be classed as a ‘3"3-uniform (2-vertex types)’" tiling. Broken down, 3⁶; 3⁶ (both of different transitivity class), or (3⁶)², tells us that there are 2 vertices (denoted by the superscript 2), each with 6 equilateral 3-sided polygons (triangles). With a final vertex 3⁴.6, 4 more contiguous equilateral triangles and a single regular hexagon.

However, this notation has two main problems related to ambiguous conformation and uniqueness <ref name="Gomez-Jauregui 2012">{{cite journal |last1=Gomez-Jauregui |first1=Valentin al.|last2=Otero |first2=Cesar |display-authors=etal |title=Generation and Nomenclature of Tessellations and Double-Layer Grids |journal=Journal of Structural Engineering |date=2012 |volume=138 |issue=7 |pages=843–852 |doi=10.1061/(ASCE)ST.1943-541X.0000532 |hdl=10902/5869 |url=https://ascelibrary.org/doi/10.1061/%28ASCE%29ST.1943-541X.0000532|hdl-access=free }}</ref> First, when it comes to k-uniform tilings, the notation does not explain the relationships between the vertices. This makes it impossible to generate a covered plane given the notation alone. And second, some tessellations have the same nomenclature, they are very similar but it can be noticed that the relative positions of the hexagons are different. Therefore, the second problem is that this nomenclature is not unique for each tessellation.

In order to solve those problems, GomJau-Hogg’sHogg's notation <ref>{{cite journal |last1=Gomez-Jauregui |first1=Valentin |last2=Hogg |first2=Harrison|display-authors=etal |title=GomJau-Hogg's Notation for Automatic Generation of k-Uniform Tessellations with ANTWERP v3.0 |journal=Symmetry |date=2021 |volume=13 |issue=12 |page=2376 |doi=10.3390/sym13122376 |bibcode=2021Symm...13.2376G |doi-access=free |hdl=10902/23907 |hdl-access=free }}</ref> is a slightly modified version of the research and notation presented in 2012,<ref name="Gomez-Jauregui 2012" /> about the generation and nomenclature of tessellations and double-layer grids. Antwerp v3.0,<ref>{{cite web |last1=Hogg |first1=Harrison |last2=Gomez-Jauregui |first2=Valentin |title=Antwerp 3.0 |url=https://antwerp.hogg.io/<}}</ref> a free online application, allows for the infinite generation of regular polygon tilings through a set of shape placement stages and iterative rotation and reflection operations, obtained directly from the GomJau-Hogg’sHogg's notation.

== Regular tilings ==