Content deleted Content added
m Wikivoice |
|||
(9 intermediate revisions by 6 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|[[
== 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<sup>6</sup>; 3<sup>6</sup>; 3<sup>4</sup>.6, tells us there are 3 vertices with 2 different vertex types, so this tiling would be classed as a
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-
== Regular tilings ==
Line 41:
== Archimedean, uniform or semiregular tilings ==<!-- This section is linked from [[Archimedean tiling]] -->
{{Further|List of
[[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 126:
{| class="wikitable" align=left style="margin: auto; text-align:center;"
|+ ''k''-uniform, ''m''-Archimedean tiling counts <ref>{{Cite web|url=http://probabilitysports.com/tilings.html|title=n-Uniform Tilings|website=probabilitysports.com|access-date=2019-06-21}}</ref><ref>{{Cite OEIS |A068599 |Number of n-uniform tilings. |access-date=2023-01-07 }}</ref><ref>{{Cite web|url=https://zenorogue.github.io/tes-catalog/?c=k-uniform%2F|title=Enumeration of n-uniform k-Archimedean tilings|website=zenorogue.github.io/tes-catalog/?c=|access-date=2024-08-24}}</ref>
!colspan=2 rowspan=2 | !! colspan="16" |''m''-Archimedean
|-
Line 207:
|-
! scope="row"| 7
| 0 ||
|0
|0
Line 218:
|-
! scope="row"| 8
||0 ||
|0
|0
Line 229:
|-
! scope="row"| 9
| 0 ||
|0
|0
Line 239:
|-
! scope="row"| 10
| 0 ||
|0
|0
Line 249:
|-
! scope="row"| 11
|0||
|0
|0
Line 258:
|-
! scope="row"| 12
|0||
|0
|0
Line 266:
|-
! scope="row"| 13
|0
|0
|103082
|-
! scope="row"| 14
|0
|{{Dunno}}
|-
Line 328:
|- valign=top
| [[File:2-uniform n16.svg|120px]]<br/>[[33344-33434 tiling|[3<sup>3</sup>.4<sup>2</sup>; 3<sup>2</sup>.4.3.4]<sub>1</sub>]]<br/>4-3,3-4,3/r90/m(h3) <br/>(''t'' = 4, ''e'' = 5)
| [[File:2-uniform n17-1.
| [[File:2-uniform n4.svg|120px]]<br/>[4<sup>4</sup>; 3<sup>3</sup>.4<sup>2</sup>]<sub>1</sub><br/>4-3/m(h4)/m(h3)/r(h2)<br/>(''t'' = 2, ''e'' = 4)
| [[File:2-uniform n3.svg|120px]]<br/>[4<sup>4</sup>; 3<sup>3</sup>.4<sup>2</sup>]<sub>2</sub><br/>4-4-3-3/m90/r(h3)<br/>(''t'' = 3, ''e'' = 5)
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
{| class=wikitable width=600
Line 415:
|[[File:Distorted truncated square tiling.svg|120px]]<br/>[[Pythagorean tiling|A tiling by squares]]
|[[File:Gyrated truncated hexagonal tiling.png|120px]]<br/>Three hexagons surround each triangle
|[[File:Gyrated hexagonal tiling2.
|[[File:Trihexagonal tiling unequal2.svg|120px]]<br/>Three size triangles
|-
Line 436:
{{colbegin|colwidth=30em}}
* [[Grid (spatial index)]]
* [[Hyperbolic geometry]]
* [[Uniform tilings in hyperbolic plane]]▼
* [[Lattice (group)]]▼
* [[List of uniform tilings]]
* [[
* [[Wallpaper group]]▼
* [[Regular polyhedron]] (the [[Platonic solid]]s)
* [[Semiregular polyhedron]] (including the [[Archimedean solid]]s)
* [[
* [[Tiling with rectangles]]
▲* [[Uniform tilings in hyperbolic plane]]
▲* [[Lattice (group)]]
▲* [[Wallpaper group]]
* [[Wythoff symbol]]
{{colend}}
|