# Euclidean tilings by convex regular polygons

Euclidean plane **tilings by convex regular polygons** have been widely used since antiquity. The first systematic mathematical treatment was that of Kepler in his *Harmonices Mundi* (Latin: *The Harmony of the World*, 1619).

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.

Vertex-transitivity means that for every pair of vertices there is a symmetry operation mapping the first vertex to the second.^{[1]}

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 *demiregular* tilings. Note that there are two mirror image (enantiomorphic or chiral) forms of 3^{4}.6 (snub hexagonal) tiling, only one of which is shown in the following table. All other regular and semiregular tilings are achiral.

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.

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.^{[2]}

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.

Some of the *k*-uniform tilings can be derived by symmetrically dissecting the tiling polygons with interior edges, for example (direct dissection):

Some k-uniform tilings can be derived by dissecting regular polygons with new vertices along the original edges, for example (indirect dissection):

There are twenty (20) **2-uniform tilings** of the Euclidean plane. (also called **2-isogonal tilings** or **demiregular tilings**)^{[4]}^{[5]}^{[6]} Vertex types are listed for each. If two tilings share the same two vertex types, they are given subscripts 1,2.

*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.

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.12^{2})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:^{[7]}

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.^{[8]} Such isogonal tilings are actually topologically identical to the uniform tilings, with different geometric proportions.