Euclidean tilings are usually named after Cundy & Rollett’s notation.[1] 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: 36; 36; 34.6, tells us there are 3 vertices with 2 different vertex types, so this tiling would be classed as a ‘3-uniform (2-vertex types)’ tiling. Broken down, 36; 36 (both of different transitivity class), or (36)2, tells us that there are 2 vertices (denoted by the superscript 2), each with 6 equilateral 3-sided polygons (triangles). With a final vertex 34.6, 4 more contiguous equilateral triangles and a single regular hexagon.
However, this notation has two main problems related to ambiguous conformation and uniqueness [2] 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’s notation [3] is a slightly modified version of the research and notation presented in 2012,[2] about the generation and nomenclature of tessellations and double-layer grids. Antwerp v3.0,[4] 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’s notation.
Regular tilings
Following Grünbaum and Shephard (section 1.3), a tiling is said to be regular if the symmetry group of the tiling acts transitively on the flags of the tiling, where a flag is a triple consisting of a mutually incident vertex, edge and tile of the tiling. This means that, for every pair of flags, there is a symmetry operation mapping the first flag to the second. This is equivalent to the tiling being an edge-to-edge tiling by congruent regular polygons. There must be six equilateral triangles, four squares or three regular hexagons at a vertex, yielding the three regular tessellations.
If the requirement of flag-transitivity is relaxed to one of vertex-transitivity, while the condition that the tiling is edge-to-edge is kept, there are eight additional tilings possible, known as Archimedean, uniform or semiregular tilings. Note that there are two mirror image (enantiomorphic or chiral) forms of 34.6 (snub hexagonal) tiling, only one of which is shown in the following table. All other regular and semiregular tilings are achiral.
C&R: Cundy & Rollet's notation GJ-H: Notation of GomJau-Hogg
Grünbaum and Shephard distinguish the description of these tilings as Archimedean as referring only to the local property of the arrangement of tiles around each vertex being the same, and that as uniform as referring to the global property of vertex-transitivity. Though these yield the same set of tilings in the plane, in other spaces there are Archimedean tilings which are not uniform.
Plane-vertex tilings
There are 17 combinations of regular convex polygons that form 21 types of plane-vertex tilings.[6][7] Polygons in these meet at a point with no gap or overlap. Listing by their vertex figures, one has 6 polygons, three have 5 polygons, seven have 4 polygons, and ten have 3 polygons.[8]
As detailed in the sections above, three of them can make regular tilings (63, 44, 36), and eight more can make semiregular or archimedean tilings, (3.12.12, 4.6.12, 4.8.8, (3.6)2, 3.4.6.4, 3.3.4.3.4, 3.3.3.4.4, 3.3.3.3.6). Four of them can exist in higher k-uniform tilings (3.3.4.12, 3.4.3.12, 3.3.6.6, 3.4.4.6), while six can not be used to completely tile the plane by regular polygons with no gaps or overlaps - they only tessellate space entirely when irregular polygons are included (3.7.42, 3.8.24, 3.9.18, 3.10.15, 4.5.20, 5.5.10).[9]
The plane-vertex tilings
6
36
5
3.3.4.3.4
3.3.3.4.4
3.3.3.3.6
4
3.3.4.12
3.4.3.12
3.3.6.6
(3.6)2
3.4.4.6
3.4.6.4
44
3
3.7.42
3.8.24
3.9.18
3.10.15
3.12.12
4.5.20
4.6.12
4.8.8
5.5.10
63
k-uniform tilings
Such periodic tilings may be classified by the number of orbits of vertices, edges and tiles. If there are k orbits of vertices, a tiling is known as k-uniform or k-isogonal; if there are t orbits of tiles, as t-isohedral; if there are e orbits of edges, as e-isotoxal.
k-uniform tilings with the same vertex figures can be further identified by their wallpaper group symmetry.
1-uniform tilings include 3 regular tilings, and 8 semiregular ones, with 2 or more types of regular polygon faces. There are 20 2-uniform tilings, 61 3-uniform tilings, 151 4-uniform tilings, 332 5-uniform tilings and 673 6-uniform tilings. Each can be grouped by the number m of distinct vertex figures, which are also called m-Archimedean tilings.[10]
Finally, if the number of types of vertices is the same as the uniformity (m = k below), then the tiling is said to be Krotenheerdt. In general, the uniformity is greater than or equal to the number of types of vertices (m ≥ k), as different types of vertices necessarily have different orbits, but not vice versa. Setting m = n = k, there are 11 such tilings for n = 1; 20 such tilings for n = 2; 39 such tilings for n = 3; 33 such tilings for n = 4; 15 such tilings for n = 5; 10 such tilings for n = 6; and 7 such tilings for n = 7.
Below is an example of a 3-unifom tiling:
Colored 3-uniform tiling #57 of 61
by sides, yellow triangles, red squares (by polygons)
by 4-isohedral positions, 3 shaded colors of triangles (by orbits)
There are twenty (20) 2-uniform tilings of the Euclidean plane. (also called 2-isogonal tilings or demiregular tilings) [5]: 62-67 [13][14] Vertex types are listed for each. If two tilings share the same two vertex types, they are given subscripts 1,2.
[36; 33.42]2 4-3-3-3/m90/r(h7)/r(h5) (t = 4, e = 5)
Higher k-uniform tilings
k-uniform tilings have been enumerated up to 6. There are 673 6-uniform tilings of the Euclidean plane. Brian Galebach's search reproduced Krotenheerdt's list of 10 6-uniform tilings with 6 distinct vertex types, as well as finding 92 of them with 5 vertex types, 187 of them with 4 vertex types, 284 of them with 3 vertex types, and 100 with 2 vertex types.
Fractalizing k-uniform tilings
There are many ways of generating new k-uniform tilings from old k-uniform tilings. For example, notice that the 2-uniform [3.12.12; 3.4.3.12] tiling has a square lattice, the 4(3-1)-uniform [343.12; (3.122)3] tiling has a snub square lattice, and the 5(3-1-1)-uniform [334.12; 343.12; (3.12.12)3] tiling has an elongated triangular lattice. These higher-order uniform tilings use the same lattice but possess greater complexity. The fractalizing basis for theses tilings is as follows:[15]
Triangle
Square
Hexagon
Dissected Dodecagon
Shape
Fractalizing
The side lengths are dilated by a factor of .
This can similarly be done with the truncated trihexagonal tiling as a basis, with corresponding dilation of .
Triangle
Square
Hexagon
Dissected Dodecagon
Shape
Fractalizing
Fractalizing examples
Truncated Hexagonal Tiling
Truncated Trihexagonal Tiling
Fractalizing
Tilings that are not edge-to-edge
Convex regular polygons can also form plane tilings that are not edge-to-edge. Such tilings can be considered edge-to-edge as nonregular polygons with adjacent colinear edges.
There are seven families of isogonal each family having a real-valued parameter determining the overlap between sides of adjacent tiles or the ratio between the edge lengths of different tiles. Two of the families are generated from shifted square, either progressive or zig-zagging positions. Grünbaum and Shephard call these tilings uniform although it contradicts Coxeter's definition for uniformity which requires edge-to-edge regular polygons.[16] Such isogonal tilings are actually topologically identical to the uniform tilings, with different geometric proportions.
Periodic isogonal tilings by non-edge-to-edge convex regular polygons
Ren, Ding; Reay, John R. (1987). "The boundary characteristic and Pick's theorem in the Archimedean planar tilings". J. Comb. Theory A. 44 (1): 110–119. doi:10.1016/0097-3165(87)90063-X.
