12

Systematic generation of regular polygon tessellations using an expressive notation.

Uniform

12-3/m60/r30(1e)6-4-3/m60/r30(1c)12-6,4/m60/r30(1c)6-3-6/m30/r30(2e)8-4/m90/r45(1e)4-3,3-4,3/r90/r75(2e)4-4,3-0,3,3/m90/r75(2e)6-3-3,3/r60/r41(2e)2 Uniform

3-4-3/m30/r30(1c)6-4-3,3/m30/r(2e)6-4-3-3/r60/r30(2e)6-4-3,4-6/m30/r30(2c)12-4,6-3/m30/r30(1c)12-3,4-3/m30/r30(1c)12-3-4/r90/r60(1e)3-6/m60/r90(1c)3-6,3/r120/m90(1e)6-3-3,3-3/r60/r45(3e)6-3/m90/r19(2e)6-3,6/m90/r45(2e)6-3,4/m90/r70(2e)4-3,3-4,3/r90/m60(2c)4-3,3,3-4,3/r40(3e)/r270(1e)/r195(2e)4-4-3/m0(1e)/m90(1e)/r7(3e)4-4-3-3/m90/r90(1e)/r7(3e)4-3,4-3,3/m90/r15(3e)4-3-3-3/m90/r90(1e)/r25(4e)3-Uniform (2 Vertex Types)

6-3-3,3/m60/r30(2e)3-Uniform (3 Vertex Types)

12-6,4-3,3,4/m30/r30(2c)12-3,4,6-3/m60/m90(1c)6-4-3,3-12-0,0,0,3/m30/r60(2c)12-4,3-6,3-0,0,4/m30/m30(2c)12-3,4-3-3-3/m30/m30(2e)12-3,4-3,3/m30/r60(2e)6-3-3-4-3,3/m30/m45(5e)6-4-3,4-3,3/m30/m30(2c)3-4-3,6-4/m30/r60(2c)3-4-3-3/m30/r30(2e)12-4-3,3/m90/r20(2e)6-4,3-3,0,4-6/m90/r45(2e)6-4,3-3,3,4-0,0,6,3/m90/m(2e)/r60(2c)4-3-3-0,4/r90/r20(3e)6-4,3,3-4,4-4/m30(2c)/r/r120(1e)6-4,3,3-4/m30(2e)/r/r120(1e)4-6-3,0,3,3-0,0,4/r20(2e)/m904-6,4-0,3,3/r0(2e)/m90/m90(2c)4-6,4-0,3,3-0,3,3/r/r(1c)/r90(2e)6-6-3,3,3/r60/m(2c)6-6,6,3-3,3/m/r35(3e)/r145(2e)6-3-3/m/r135(1e)/r20(2e)3-6/r60/m30(1c)6-3-3,3-3,3-0,3/r90(1e)/r225(1e)/r30(3e)3-3,6-3/m/r35(2e)/r135(1c)6-3-3/r15(3e)/m/r3-3,3-3,6,3/m90/r90(2e)/r(2e)3-3-6-0,3/r60/m60(2c)3-3-6/r60/r30(2e)4-4-3-3/m90/r(3e)/r90(1e)4-4-3-3-3/m90/r5(5e)/r90(1e)4-4-3-3-3/r0(1e)/r0(3e)/m90(1e)4-4-3-3-3/r0(1e)/r7(5e)/m90(1e)4-Uniform (3 Vertex Types)

6-3-3-3/r15(4e)/m/rEuclidean tiling are a covering of a plane where the repetition of polygons make up tiles, which through symmetry operations can be extended indefinitely without any overlapping. There are three types of tilings:

- Regular tilings consist of a single polygon type, with each vertex surrounded by the same kinds of polygons (vertex-transitive).
- Semiregular tilings (uniform) are polymorphic and like regular tilings are vertex-transitive.
- Demiregular tilings (k-uniform) like semiregular tilings are polymorphic but are not vertex-transitive.

Tiling configurations are usually named using a notation, which represents the number of vertices; the number of polygons around each vertex (arranged clockwise) and the number of sides to each of those polygons. For example:

`(3⁶)²; 3⁴.6`

This notation (Cundy & Rollett's) 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,

`(3⁶)²`

tells us there are 2 vertices (denoted by the superscript 2), each with 6, 3 sided polygons (equilateral triangles). With a final vertex (`3⁴.6`

) of 4 more 3 sided polygons and a single 6 sided polygon (hexagon).However, this notation has a problem. When it comes to k-uniform tilings, the notation does not explain the relationships between the vertices. This makes it impossible to infinitely generate a plane given the notation alone. Taking the above

`(3⁶)²; 3⁴.6`

notation as an example. If a single vertex was placed, surrounded by 4, 3 sided polygons and a 6 sided polygon, there would be 3 other vertices with 2, 3 sided polygons. From here either the vertex type of `(3⁶)²`

or `3⁴.6`

is possible, and the notation gives no indication to which is correct.This is a slightly modified version of the research and notation presented by Valentin Gomez-Jauregui, in Generation and nomenclature of tessellations and double-layer grids, that allows for the infinite generation of regular polygon tilings through a set of shape placement stages and iterative rotation and reflection operations.

The stages are represented as forward-slash (

`/`

) separated blocks. When split up, the very first block is the "Shape placement" stage, this takes care of placing the regular polygons on the plane. The blocks after this are the transformation functions, of which there can be two or more of.The shape placement stage is made up of a series of hyphen (

`-`

) separated phases. Similar to the Cundy & Rollett's notation, each number represents the number of sides on the polygon. The very first phase will always contain a single number of either 3, 4, 6, 8 or 12* (see 'Angles' at the end to understand why these are the only possible shapes). This defines the 'seed' shape which is the first shape to be placed at the center of the area to be covered.The seed shape is always (except for 3 sided polygon) placed at the center of the plane so that "the two sides that intersect the horizontal axis "x", stay perpendicular to that axis" *(V. Gomez-Jauregui, 2012)*, as shown below. For a 3 sided polygon "the left-hand edge will be the one perpendicular to the x axis and will be aligned with the vertical axis 'y'" *(V. Gomez-Jauregui, 2012)*.

3 Sides

4 Sides

6 Sides

8 Sides

12 Sides

Following the seed shape phase, shapes are systematically placed clockwise around the available sides of the previously placed phase of shapes, using

`0`

to skip a side of a polygon.`6-3-3,3/...`

Using the

`(3⁶)²; 3⁴.6`

configuration as an example. With this new notation as shown above, the shape placement stages consist of:- A seed shape with 6 sides (a hexagon).
- A following phase with a 3 sided shape (triangle); placed on the first side clockwise of the y axis
- Followed by a final phase of two 3 sided shapes; placed on the only two available sides from the previously placed triangle.

The stages following the first shape placement stage are a series of transformation functions that take all of the shapes currently placed on the plane and either rotate or reflect them by a specified angle (when no angle is specified it defaults to 180°). The origin of the transformation can also be specified, which defaults to the center of the plane.

The type of transformation is represented in the notation by a single character. An '

`m`

' (mirror) applies a reflection transformation and a '`r`

' applies a rotation transformation. When specifying the origin of the transformation, it also slightly changes the behaviour of the ensuing transformation result.There are 3 types of transformation origins...

Origin 1. Center of the plane

This is the default origin type and when used, the transformation is applied continuously by incrementing the angle on each transformation by a factor of 2. This is done while the accumulated angle is less than 360°. This is the case for both reflection and rotation transforms. With every iteration of the transform, all shapes on the plane including those from previous iterations of the same transform are then duplicated.

`6-3-3,3/m60/...`

Using the

`(3⁶)²; 3⁴.6`

configuration as an example. The first transformation operation is `r60`

(rotate at the center of the plane by 60°). So all of the transformational operations performed would be:- Rotate 60°
- Rotate 120° (60° x2)
- Rotate 240° (120° x2). This is the last rotation as 240° x2 is 480° and is above the 360° limit.

Origin 2. Edge of a shape

There will always be a need for two or more transforms in order to completely cover a plane. At least one of these transform functions will need to shift the origin in order to expand the collection of shapes out to increase the area coverage. One way to do this is by shifting the origin to the edge of another shape.

Unlike when the origin is at the center of the plane, transforms with it's origin elsewhere are not continuous. In other words they are performed only once before moving onto the next transform.

The notation for shifting the origin to a shape's edge is done by specifying at what angle the point of origin is from the y axis and how many intersecting edges from the center point of the plane it is. For example, take the transform function

`r30(2e)`

. Imagine a line drawn starting from the center of the plane with an endpoint at 30°. The second edge intersecting that line would become the transform's new point of origin. In which the shapes are then rotated by 180°. However this 180° is now relative to the intersecting line, and the center point of the plane becomes 0°.`6-3-3,3/m60/r30(2e)`

Using the

`(3⁶)²; 3⁴.6`

configuration as an example. The second transformation function is `r(2e,30)`

(rotate 180° at the edge of the second intersecting shape at 30°).When shifting the origin to the edge of a shape for a reflection transform, it will never be needed to provide a transformation angle. This is because anything other the angle of the intersecting edge will result in an overlapping and invalid tessellations. The only valid and correct angle can easily be inferred from the angle of the intersecting edge.

Origin 3. Center of a shape

Similar to shifting the point of origin to the edge of a shape, the origin can also be shifted to the center point of a shape. However there are a couple of differences. The format of the notation is very similar, for example

`r30(2c)`

, except this origin type is represented by a ``c`

`. Instead of specifying the number of intersecting edges, it's simply the number of intersecting shapes (excluding the seed shape). This also allows for some flexibility in the angle of the intersection line as it does not have to target the center point of the shape directly. The shape simply needs to intersect on that line.Unlike the edge origin type, when this is applied on a reflection transform the angle of the transform is always respected.

`4-3,3-4,3/r90/m60(2c)`

Using the

`[3³.4²; 3².4.3.4]¹`

configuration as an example. The second transformation function is `m60(2c)`

(reflect over a line 180° relative to the intersection angle, at the center of the second intersecting shape at 60°).This is the final stage to completing the tiling, and it's simply repeating over the transformation functions as many times as are needed. Providing the configuration is correct, this should not result in any shape overlaps (apart from those excluded from the transformation functions), and it should continuously and infinitely grow.

`6-3-3,3/m60/r30(2e)`

Using the

`(3⁶)²; 3⁴.6`

configuration as an example. Both transformation functions `r60`

and `r30(2e)`

are continuously repeated, each time taken the shapes that are currently on the plane.* Angles - For a valid tessellation that produces no gaps, the sum of the interior angles of every shape around a vertex must equal 360°. For example, the interior angle of an equilateral triangle is `180°/3=60°`

, therefore you can have 6 triangles around a vertex as `360°/60°=6`

.

Taking the pentagon (unusable for regular tessellations) as an example the interior angle is `540°/5=108°`

. While you could place this around a vertex with a regular square and a icosagon (108°+90°+162°=360°), the next available vertices would not allow for this same configuration.

In total, there are seventeen combinations of regular polygons whose internal angles add up to 360°. However only eleven of these can occur in regular polygon tilings.

Gomez-Jauregui, Valentin & Otero, César & Arias, Ruben & Manchado, Cristina. (2012). Generation and Nomenclature of Tessellations and Double-Layer Grids. Journal of Structural Engineering. 138. 843–852. 10.1061/(ASCE)ST.1943-541X.0000532.