Uniform tiling

In geometry, a uniform tiling is a tessellation of the plane by regular polygon faces with the restriction of being vertex-transitive.

Uniform tilings can exist in both the Euclidean plane and hyperbolic plane. Uniform tilings are related to the finite uniform polyhedra; these can be considered uniform tilings of the sphere.

Most uniform tilings can be made from a Wythoff construction starting with a symmetry group and a singular generator point inside of the fundamental domain. A planar symmetry group has a polygonal fundamental domain and can be represented by its group notation: the sequence of the reflection orders of the fundamental domain vertices.

A fundamental domain triangle is denoted (''p q r''), where ''p'', ''q'', ''r'' are whole numbers > 1, i.e. ≥ 2; a fundamental domain right triangle is denoted (''p q'' 2). The triangle may exist as a spherical triangle, a Euclidean plane triangle, or a hyperbolic plane triangle, depending on the values of ''p'', ''q'', and ''r''.

There are several symbolic schemes for denoting these figures:
* The modified Schläfli symbol for a right triangle domain: (''p q'' 2) → .
* The Coxeter-Dynkin diagram is a triangular graph with ''p'', ''q'', ''r'' labeled on the edges. If ''r'' = 2, then the graph is linear, since diagram nodes with connectivity 2 are not connected to each other by a diagram branch (since domain mirrors meeting at 90 degrees generate no new mirrors).
* The Wythoff symbol takes the three integers and separates them by a vertical bar (, ). If the generator point is off the mirror opposite to a domain vertex, then the reflection order of this domain vertex is given before the bar.
* Finally, a uniform tiling can be described by its vertex configuration: the (identical) sequence of polygons around each (equivalent) vertex.

All uniform tilings can be constructed from various operations applied to regular tilings. These operations, as named by Norman Johnson, are called truncation (cutting vertices), rectification (cutting vertices until edges disappear), and cantellation (cutting edges and vertices). Omnitruncation is an operation that combines truncation and cantellation. Snubbing is an operation of alternate truncation of the omnitruncated form. (See Uniform polyhedron#Wythoff construction operators for more details.)

Coxeter groups

Coxeter groups for the plane define the Wythoff construction and can be represented by Coxeter-Dynkin diagrams:

For groups with integer reflection orders, including:

Uniform tilings of the Euclidean plane

There are symmetry groups on the Euclidean plane constructed from fundamental triangles: (4 4 2), (6 3 2), and (3 3 3). Each is represented by a set of lines of reflection that divide the plane into fundamental triangles.

These symmetry groups create 3 regular tilings, and 7 semiregular ones. A number of the semiregular tilings are repeated from different symmetry constructors.

A prismatic symmetry group, (2 2 2 2), is represented by two sets of parallel mirrors, which in general can make a rectangular fundamental domain. It generates no new tilings.

A further prismatic symmetry group, (∞ 2 2), has an infinite fundamental domain. It constructs two uniform tilings: the apeirogonal prism and apeirogonal antiprism.

The stacking of the finite faces of these two prismatic tilings constructs one non-Wythoffian uniform tiling of the plane. It is called the elongated triangular tiling, composed of alternating layers of squares and triangles.

Right angle fundamental triangles: (''p q'' 2)

General fundamental triangles: (''p q r'')

Non-simplical fundamental domains

The only possible fundamental domain in Euclidean 2-space that is not a simplex is the rectangle (∞ 2 ∞ 2), with Coxeter diagram: . All forms generated from it become a square tiling.

Uniform tilings of the hyperbolic plane

There are infinitely many uniform tilings by convex regular polygons on the hyperbolic plane, each based on a different reflective symmetry group (''p q r'').

A sampling is shown here with a Poincaré disk projection.

The Coxeter-Dynkin diagram is given in a linear form, although it is actually a triangle, with the trailing segment ''r'' connecting to the first node.

Further symmetry groups exist in the hyperbolic plane with quadrilateral fundamental domains — starting with (2 2 2 3), etc. — that can generate new forms. As well, there are fundamental domains that place vertices at infinity, such as (∞ 2 3), etc.

Right angle fundamental triangles: (''p q'' 2)

General fundamental triangles: (''p q r'')

Expanded lists of uniform tilings

There are several ways the list of uniform tilings can be expanded:
# Vertex figures can have retrograde faces and turn around the vertex more than once.
# Star polygon tiles can be included.
# Apeirogons, , can be used as tiling faces.
# Zigzags (apeirogons alternating between two angles) can also be used.
# The restriction that tiles meet edge-to-edge can be relaxed, allowing additional tilings such as the Pythagorean tiling.

Symmetry group triangles with retrogrades include:
: (4/3 4/3 2), (6 3/2 2), (6/5 3 2), (6 6/5 3), (6 6 3/2).
Symmetry group triangles with infinity include:
: (4 4/3 ∞), (3/2 3 ∞), (6 6/5 ∞), (3 3/2 ∞).

Branko Grünbaum and G. C. Shephard, in the 1987 book '' Tilings and patterns'', section 12.3, enumerate a list of 25 uniform tilings, including the 11 convex forms, and add 14 more they call ''hollow tilings'', using the first two expansions above: star polygon faces and generalized vertex figures.

H. S. M. Coxeter, M. S. Longuet-Higgins, and J. C. P. Miller, in the 1954 paper 'Uniform polyhedra', ''Table 8: Uniform Tessellations'', use the first three expansions and enumerate a total of 38 uniform tilings. If a tiling made of 2 apeirogons is also counted, the total can be considered 39 uniform tilings.

In 1981, Grünbaum, Miller, and Shephard, in their paper ''Uniform Tilings with Hollow Tiles'', list 25 tilings using the first two expansions and 28 more when the third is added (making 53 using Coxeter ''et al''.'s definition). When the fourth is added, they list an additional 23 uniform tilings and 10 families (8 depending on continuous parameters and 2 on discrete parameters).

Besides the 11 convex solutions, the 28 uniform star tilings listed by Coxeter ''et al.'', grouped by shared edge graphs, are shown below, followed by 15 more listed by Grünbaum ''et al.'' that meet Coxeter ''et al''.'s definition but were missed by them.

This set is not proved complete. By "2.25" is meant tiling 25 in Grünbaum ''et al''.'s table 2 from 1981.

The following three tilings are exceptional in that there is only finitely many of one face type: two apeirogons in each. Sometimes the order-2 apeirogonal tiling is not included, as its two faces meet at more than one edge.

For clarity, the tilings are not colored from here onward (due to the overlaps). A set of polygons around one vertex is highlighted. McNeill only lists tilings given by Coxeter ''et al''. (1954). The eleven convex uniform tilings have been repeated for reference.

There are two uniform tilings for the vertex configuration 4.8.−4.8.−4.∞ (Grünbaum ''et al.'', 2.10 and 2.11) and also two uniform tilings for the vertex configuration 4.8/3.4.8/3.−4.∞ (Grünbaum ''et al.'', 2.12 and 2.13), with different symmetries. There is also a third tiling for each vertex configuration that is only pseudo-uniform (vertices come in two symmetry orbits). They use different sets of square faces. Hence, for star Euclidean tilings, the vertex configuration does not necessarily determine the tiling.

In the pictures below, the included squares with horizontal and vertical edges are marked with a central dot. A single square has edges highlighted.

Grünbaum ambiguous tilings 1.png, 2.10 and 2.12 (p4m)
Grünbaum ambiguous tilings 2.png, 2.11 and 2.13 (p4g)
Grünbaum ambiguous tilings 3.png, Pseudo-uniform

The tilings with zigzags are listed below. denotes a zigzag with angle 0 < 𝛼 < π. The apeirogon can be considered the special case 𝛼 = π. The symmetries are given for the generic case, but there are sometimes special values of 𝛼 that increase the symmetry. Tilings 3.1 and 3.12 can even become regular; 3.32 already is (it has no free parameters). Sometimes, there are special values of 𝛼 that cause the tiling to degenerate.

The tiling pairs 3.17 and 3.18, as well as 3.19 and 3.20, have identical vertex configurations but different symmetries.

Tilings 3.7 through 3.10 have the same edge arrangement as 2.1 and 2.2; 3.17 through 3.20 have the same edge arrangement as 2.10 through 2.13; 3.21 through 3.24 have the same edge arrangement as 2.18 through 2.23; and 3.25 through 3.33 have the same edge arrangement as 1.25 (the regular triangular tiling).

Self-dual tilings

A tiling can also be self-dual. The square tiling, with Schläfli symbol , is self-dual; shown here are two square tilings (red and black), dual to each other.

Uniform tilings using regular or isotoxal polygrams as nonconvex isotoxal simple polygons

Seeing a regular star polygon as a nonconvex isotoxal simple polygon with twice as many (shorter) sides but alternating the same outer and "inner" internal angles allows regular star polygons to be used in a tiling, and seeing isotoxal simple polygons as "regular" allows regular star polygons to (but not all of them can) be used in a "uniform" tiling.

Also, the outlines of certain non-regular isotoxal star polygons are nonconvex isotoxal (simple) polygons with ''as many'' (shorter) sides and alternating the same outer and "inner" internal angles; seeing this kind of isotoxal star polygons as their outlines allows it to be used in a tiling, and seeing isotoxal simple polygons as "regular" allows this kind of isotoxal star polygons to (but not all of them can) be used in a "uniform" tiling.

An isotoxal simple 2''n''-gon with outer internal angle 𝛼 is denoted by ; its outer vertices are labeled as ''n'', and inner ones as ''n''.

These expansions to the definition for a tiling require corners with only 2 polygons to not be considered vertices — since the vertex configuration for vertices with at least 3 polygons suffices to define such a "uniform" tiling, and so that the latter has one vertex configuration alright (otherwise it would have two) —. There are 4 such uniform tilings with adjustable angles 𝛼, and 18 such uniform tilings that only work with specific angles, yielding a total of 22 uniform tilings that use star polygons.''Tilings and Patterns'', Branko Gruenbaum, G. C. Shephard, 1987, 2.5 Tilings using star polygons, pp. 82–85.

All of these tilings, with possible order-2 vertices ignored, with possible double edges and triple edges reduced to single edges, are topologically related to the ordinary uniform tilings (using only convex regular polygons).

Uniform tilings using convex isotoxal simple polygons

Non-regular isotoxal either star or simple 2''n''-gons always alternate two angles. Isotoxal simple 2''n''-gons, , can be convex; the simplest ones are the rhombi (2×2-gons), . Considering these convex as "regular" polygons allows more tilings to be considered "uniform".

See also

* Wythoff symbol
* List of uniform tilings
* Uniform tilings in hyperbolic plane
* Uniform polytope

References

* Norman Johnson ''Uniform Polytopes'', Manuscript (1991)
** N. W. Johnson: ''The Theory of Uniform Polytopes and Honeycombs'', Ph. D. Dissertation, University of Toronto, 1966
* (Star tilings section 12.3)
* H. S. M. Coxeter, M. S. Longuet-Higgins, J. C. P. Miller, ''Uniform polyhedra'', Phil. Trans., 1954, 246 A, 401–50 (Table 8)

External links

*

Uniform Tessellations on the Euclid plane



David Bailey's World of Tessellations




*

{{Tessellation