Euclidean tilings by convex regular polygons: Difference between revisions

Revision as of 17:29, 22 September 2024

Latest revision as of 22:16, 13 August 2025

(5 intermediate revisions by 4 users not shown)

Line 9:

|[[File:Distorted truncated square tiling.svg|150px]]<br/>A [[#Tilings_that_are_not_edge-to-edge|non-edge-to-edge tiling]] can have different-sized regular faces.

|}

Euclidean [[Plane (mathematics)|plane]] '''[[Tessellation|tilings]] by convex [[regular polygon]]s''' have been widely used since antiquity. The first systematic mathematical treatment was that of [[Johannes Kepler|Kepler]] in his {{lang|la|[[HarmonicesHarmonice Mundi]]}} ([[Latin language|Latin]]: ''The Harmony of the World'', 1619).

== 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 ==

Line 41:

== Archimedean, uniform or semiregular tilings ==<!-- This section is linked from [[Archimedean tiling]] -->

{{Further|List of convexEuclidean uniform tilings}}

[[Vertex-transitive|Vertex-transitivity]] means that for every pair of vertices there is a [[symmetry operation]] mapping the first vertex to the second.<ref name="Critchlow 1969">{{cite book |last1=Critchlow |first1=K. |title=Order in Space: A Design Source Book |date=1969 |publisher=Thames and Hudson |___location=London |pages=60–61}}</ref>

Line 398:

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 figure|isogonal]]s, 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.<ref>[{{Cite web |url=http://www.maa.org/sites/default/files/images/upload_library/22/Allendoerfer/1978/0025570x.di021102.02p0230f.pdf |title=Tilings by regular polygons] |p.=236 |archive-url=https://web.archive.org/web/20160303235526/http://www.maa.org/sites/default/files/images/upload_library/22/Allendoerfer/1978/0025570x.di021102.02p0230f.pdf |archive-date=2016-03-03 |url-status=dead}}</ref> Such isogonal tilings are actually topologically identical to the uniform tilings, with different geometric proportions.

{| class=wikitable width=600

Line 436:

{{colbegin|colwidth=30em}}

* [[Grid (spatial index)]]

* [[Hyperbolic geometry]]

* [[Uniform tilings in hyperbolic plane]]

* [[Lattice (group)]]

* [[List of uniform tilings]]

* [[WythoffPenrose symboltiling]]

* [[Tessellation]]

* [[Wallpaper group]]

* [[Regular polyhedron]] (the [[Platonic solid]]s)

* [[Semiregular polyhedron]] (including the [[Archimedean solid]]s)

* [[Hyperbolic geometryTessellation]]

* [[Penrose tiling]]

* [[Tiling with rectangles]]

* [[Uniform tilings in hyperbolic plane]]

* [[Lattice (group)]]

* [[Wallpaper group]]

* [[Wythoff symbol]]

{{colend}}