Planigon

Last updated
Three regular polygons, eight planigons, four demiregular planigons, and six not usable planigon triangles which cannot take part in dual uniform tilings; all to scale. All Planigons.svg
Three regular polygons, eight planigons, four demiregular planigons, and six not usable planigon triangles which cannot take part in dual uniform tilings; all to scale.

In geometry, a planigon is a convex polygon that can fill the plane with only copies of itself (isotopic to the fundamental units of monohedral tessellations). In the Euclidean plane there are 3 regular planigons; equilateral triangle, squares, and regular hexagons; and 8 semiregular planigons; and 4 demiregular planigons which can tile the plane only with other planigons.

Contents

All angles of a planigon are whole divisors of 360°. Tilings are made by edge-to-edge connections by perpendicular bisectors of the edges of the original uniform lattice, or centroids along common edges (they coincide).

Tilings made from planigons can be seen as dual tilings to the regular, semiregular, and demiregular tilings of the plane by regular polygons.

History

In the 1987 book, Tilings and patterns , Branko Grünbaum calls the vertex-uniform tilings Archimedean in parallel to the Archimedean solids. Their dual tilings are called Laves tilings in honor of crystallographer Fritz Laves. [1] [2] They're also called Shubnikov–Laves tilings after Shubnikov, Alekseĭ Vasilʹevich. [3] John Conway calls the uniform duals Catalan tilings, in parallel to the Catalan solid polyhedra.

The Laves tilings have vertices at the centers of the regular polygons, and edges connecting centers of regular polygons that share an edge. The tiles of the Laves tilings are called planigons. This includes the 3 regular tiles (triangle, square and hexagon) and 8 irregular ones. [4] Each vertex has edges evenly spaced around it. Three dimensional analogues of the planigons are called stereohedrons.

These tilings are listed by their face configuration, the number of faces at each vertex of a face. For example V4.8.8 (or V4.82) means isosceles triangle tiles with one corner with four triangles, and two corners containing eight triangles.

Construction

The Conway operation of dual interchanges faces and vertices. In Archimedean solids and k-uniform tilings alike, the new vertex coincides with the center of each regular face, or the centroid. In the Euclidean (plane) case; in order to make new faces around each original vertex, the centroids must be connected by new edges, each of which must intersect exactly one of the original edges. Since regular polygons have dihedral symmetry, we see that these new centroid-centroid edges must be perpendicular bisectors of the common original edges (e.g. the centroid lies on all edge perpendicular bisectors of a regular polygon). Thus, the edges of k-dual uniform tilings coincide with centroid-to-edge-midpoint line segments of all regular polygons in the k-uniform tilings.

Planigon Constructions
Centroid-to-Centroid12-5 Dodecagram
Construction of all Planigons.svg Dodecagram of Planigons.svg

Using the 12-5 Dodecagram (Above)

All 14 uniform usable regular vertex planigons also hail [5] from the 6-5 dodecagram (where each segment subtends radians, or 150 degrees).

The incircle of this dodecagram demonstrates that all the 14 VRPs are cocyclic, as alternatively shown by circle packings. The ratio of the incircle to the circumcircle is:

and the convex hull is precisely the regular dodecagons in the k-uniform tiling. The equilateral triangle, square, regular hexagon, and regular dodecagon; are shown above with the VRPs.

In fact, any group of planigons can be constructed from the edges of a polygram, where and is the number of sides of sides in the RP adjacent to each involved vertex figure. This is because the circumradius of any regular -gon (from the vertex to the centroid) is the same as the distance from the center of the polygram to its line segments which intersect at the angle , since all polygrams admit incircles of inradii tangent to all its sides.

Regular Vertices

In Tilings and Patterns, Grünbaum also constructed the Laves tilings using monohedral tiles withregular vertices. A vertex is regular if all angles emanating from it are equal. In other words: [1]

  1. All vertices are regular,
  2. All Laves planigons are congruent.

In this way, all Laves tilings are unique except for the square tiling (1 degree of freedom), barn pentagonal tiling (1 degree of freedom), and hexagonal tiling (2 degrees of freedom):

Tiling Variants
SquareBarn PentagonHexagon
Square Non-Canonical Tiling.svg Barn Pentagon Non-Canonical Tiling.svg Hexagon Non-Canonical Tiling.svg

When applied to higher dual co-uniform tilings, all dual coregular planigons can be distorted except for the triangles (AAA similarity), with examples below:

Tiling Variants
SSTCH Non-Canonical Tiling.svg
S2TCH
IIRFH Non-Canonical Tiling.svg
I2RFH
IrDC Non-Canonical Tiling.svg
IrDC
FH (p6) Non-Canonical Tiling.svg
FH (p6)
SBH (short) Non-Canonical Tiling.svg
sBH (short)
CB (pgg) Non-Canonical Tiling.svg
CB (pgg)

Derivation of all possible planigons

For edge-to-edge Euclidean tilings, the interior angles of the convex polygons meeting at a vertex must add to 360 degrees. A regular n-gon has internal angle degrees. There are seventeen combinations of regular polygons whose internal angles add up to 360 degrees, each being referred to as a species of vertex; in four cases there are two distinct cyclic orders of the polygons, yielding twenty-one types of vertex.

In fact, with the vertex (interior) angles , we can find all combinations of admissible corner angles according to the following rules:

  1. Every vertex has at least degree 3 (a degree-2 vertex must have two straight angles or one reflex angle);
  2. If the vertex has degree , the smallest polygon vertex angles sum to over ;
  3. The vertex angles add to , and must be angles of regular polygons of positive integer sides (of the sequence ).

Using the rules generates the list below:

Clusters of planigons which cannot tile the plane. Note the 8-cluster of V3.8.24 and the 10-cluster of V3.10.15 imply overlaps for the 24-gons and 15-gons, respectively. Also, V4.5.20 and V5 .10 can generate lines and curves, but those cannot be completed without overlap. Clusters Of Not Usable Planigons.svg
Clusters of planigons which cannot tile the plane. Note the 8-cluster of V3.8.24 and the 10-cluster of V3.10.15 imply overlaps for the 24-gons and 15-gons, respectively. Also, V4.5.20 and V5 .10 can generate lines and curves, but those cannot be completed without overlap.
Arrangements of regular polygons around a vertex
Degree-6 vertexDegree-5 vertexDegree-4 vertexDegree-3 vertex
*

*The cannot coexist with any other vertex types.

The solution to Challenge Problem 9.46, Geometry (Rusczyk), [6] is in the Degree 3 Vertex column above. A triangle with a hendecagon (11-gon) yields a 13.2-gon, a square with a heptagon (7-gon) yields a 9.3333-gon, and a pentagon with a hexagon yields a 7.5-gon). Hence there are combinations of regular polygons which meet at a vertex.

Planigons in the plane

Only eleven of these angle combinations can occur in a Laves Tiling of planigons.

In particular, if three polygons meet at a vertex and one has an odd number of sides, the other two polygons must be the same. If they are not, they would have to alternate around the first polygon, which is impossible if its number of sides is odd. By that restriction these six cannot appear in any tiling of regular polygons:

Six planigons which cannot tile the plane. Not Usable Planigons.svg
Six planigons which cannot tile the plane.

On the other hand, these four can be used in k-dual-uniform tilings:

There is one demiregular dual for each planigon V3 .4.12, V3.4.3.12, V3 .6 , V3.4 .6. And all quadrilaterals can tile the plane. Dualization Deriving Four Semiplanigons.png
There is one demiregular dual for each planigon V3 .4.12, V3.4.3.12, V3 .6 , V3.4 .6. And all quadrilaterals can tile the plane.

Finally, assuming unit side length, all regular polygons and usable planigons have side-lengths and areas as shown below in the table:

Regular Polygons and Planigons
Planigon Notation.svg
Regular PolygonsPlanigons
TriangleArea:

Side Lengths: 1

V3.122
(O)
Area:

Side Lengths:

V32.62
(I)
Area:

Side Lengths:

V44
(s)
Area: 1

Side Lengths: 1

SquareArea: 1

Side Lengths: 1

V4.6.12
(3)
Area:

Side Lengths:

V(3.6)2
(R)
Area:

Side Lengths:

V32.4.3.4
(C)
Area:

Side Lengths:

HexagonArea:

Side Lengths: 1

V32.4.12
(S)
Area:

Side Lengths:

V3.42.6
(r)
Area:

Side Lengths:

V33.42
(B)
Area:

Side Lengths:

OctagonArea:

Side Lengths: 1

V3.4.3.12
(T)
Area:

Side Lengths:

V3.4.6.4
(D)
Area:

Side Lengths:

V36
(H)
Area:

Side Lengths:

DodecagonArea:

Side Lengths: 1

V63
(E)
Area:

Side Lengths:

V34.6
(F)
Area:

Side Lengths:

V4.82
(i)
Area:

Side Lengths:

Number of Dual Uniform Tilings

Every dual uniform tiling is in a 1:1 correspondence with the corresponding uniform tiling, by construction of the planigons above and superimposition.

k-dual-uniform, m-Catalaves tiling counts [7]
m-Catalaves
123456Total
k-dual-uniform 1 1111
2 02020
3 0223961
4 0338533151
5 0741499415332
6 01002841879210673
Total11

Such periodic tilings may be classified by the number of orbits of vertices, edges and tiles. If there are k orbits of planigons, a tiling is known as k-dual-uniform or k-isohedral; if there are t orbits of dual vertices, as t-isogonal; if there are e orbits of edges, as e-isotoxal.

k-dual-uniform tilings with the same vertex faces can be further identified by their wallpaper group symmetry, which is identical to that of the corresponding k-uniform tiling.

1-dual-uniform tilings include 3 regular tilings, and 8 Laves tilings, with 2 or more types of regular degree vertices. There are 20 2-dual-uniform tilings, 61 3-dual-uniform tilings, 151 4-dual-uniform tilings, 332 5-dual-uniform tilings and 673 6--dualuniform tilings. Each can be grouped by the number m of distinct vertex figures, which are also called m-Archimedean tilings. [8]

Finally, if the number of types of planigons is the same as the uniformity (m = k below), then the tiling is said to be dual Krotenheerdt. In general, the uniformity is greater than or equal to the number of types of vertices (mk), as different types of planigons necessarily have different orbits, but not vice versa. Setting m = n = k, there are 11 such dual tilings for n = 1; 20 such dual tilings for n = 2; 39 such dual tilings for n = 3; 33 such dual tilings for n = 4; 15 such dual tilings for n = 5; 10 such dual tilings for n = 6; and 7 such dual tilings for n = 7.

Regular and Laves tilings

The 3 regular and 8 semiregular Laves tilings are shown, with planigons colored according to area as in the construction:

1-Co-Uniform Tilings.png

Higher Dual Uniform Tilings

Insets of Dual Planigons into Higher Degree Vertices

A manhole in Central Park with tiling CH (V3 .4.3.4,V3 ). Central Park Manhole Tiling.png
A manhole in Central Park with tiling CH (V3 .4.3.4,V3 ).
Inset Variations of Dual Uniform Tiling.svg
3D Minor Inset.gif 3D Major Inset.gif 3D Full Inset.gif 3D Major Inset Substitution.gif 3D Full Inset Substitution.gif
MinorMajorFullSubstitutions
Dual Processes (Insets)

This is done above for the dual of the 3-4-6-12 tiling. The corresponding uniform process is dissection, and is shown here.

2-Dual-Uniform

There are 20 tilings made from 2 types of planigons, the dual of 2-uniform tilings (Krotenheerdt Duals):

2-Co-Uniform Tilings.png

3-Dual-Uniform

There are 39 tilings made from 3 types of planigons (Krotenheerdt Duals):

3-Kroten Co-Uniform.png

4-Dual-Uniform

There are 33 tilings made from 4 types of planigons (Krotenheerdt Duals):

Everything Uniform 4 Krotenheerdt.png

5-Dual-Uniform

There are 15 5-uniform dual tilings with 5 unique planigons:

5-Krotenheerdt Co-Uniform Tilings.png

Krotenheerdt duals with six planigons

There are 10 6-uniform dual tilings with 6 unique planigons:

6-Krotenheerdt Co-Uniform Tilings.png

Krotenheerdt duals with seven planigons

There are 7 7-uniform dual tilings with 7 unique planigons:

7-Krotenheerdt Co-Uniform Tilings.png

The last two dual uniform-7 tilings have the same vertex types, even though they look nothing alike!

From onward, there are no uniform n tilings with n vertex types, or no uniform n duals with n distinct (semi)planigons. [9]

Fractalizing Dual k-Uniform Tilings

There are many ways of generating new k-dual-uniform tilings from other k-uniform tilings. Three ways is to scale by as seen below:

Fractalizing Examples
Fractalization of Dual.svg
OriginalSemi-FractalizationTruncated Hexagonal TilingTruncated Trihexagonal Tiling
Dual
Fractalizing
Floret Pentagonal with RPs.svg Snub Trihexagonal Dual Fractalization 1.svg Snub Trihexagonal Dual Fractalization 2.svg Snub Trihexagonal Dual Fractalization 3.svg

Large Fractalization

To enlarge the planigons V32.4.12 and V3.4.3.12 using the truncated trihexagonal method, a scale factor of must be applied:

Large Fractalization Tiles.gif

Big Fractalization

By two 9-uniform tilings in [10] a big fractalization is achieved by a scale factor of 3 in all planigons. In the case of s,C,B,H its own planigon is in the exact center:

Big Fractal Planigons.png

The two 9-uniform tilings are shown below, fractalizations of the demiregulars DC and DB, and a general example on S2TC:

9-UniformS2TC Big Fractalization
9-Uniform Big Fractalization (DC, DB).gif
3Ir3Ds2B (of DB)
3Ir4DsC (of DC)
4-Uniform SSTC Big Fractalization.gif
S2TC
Big Fractalization

Miscellaneous

Centroid-Centroid Construction

Dual co-uniform tilings (red) along with the originals (blue) of selected tilings. [7] [11] Generated by centroid-edge midpoint construction by polygon-centroid-vertex detection, rounding the angle of each co-edge to the nearest 15 degrees. Since the unit size of tilings varies from 15 to 18 pixels and every regular polygon slightly differs, [7] there is some overlap or breaks of dual edges (an 18-pixel size generator incorrectly generates co-edges from five 15-pixel size tilings, classifying some squares as triangles).

Dual Uniform Tilings Galebach.gif

Other Edge-Edge Construction Comparisons

Other edge-edge construction comparisons. Rotates every 3 seconds.

Comparisons
SDB3IrBTDDCIIRFrFBHOOOOT3SrFCBHO33STIr2C2B
Edge-to-Edge Tiling Variation 3.gif Edge-to-Edge Tiling Variation 6.gif Edge-to-Edge Tiling Variation 5.gif Edge-to-Edge Tiling Variation 2.gif Edge-to-Edge Tiling Variation 1.gif Edge-to-Edge Tiling Variation 4.gif Edge-to-Edge Tiling Variation 7.gif Edge-to-Edge Tiling Variation 8.gif

Affine Linear Expansions

Below are affine linear expansions of other uniform tilings, from the original to the dual and back:

Affine Linear Expansions
8-Uniform 3STDC12-Uniform 3STRrD12-Uniform O3STIrCB13-Uniform All Slab16-Uniform OSTEIrCB24-Uniform All Planigons
Affine Linear Expansion 8-Uniform 3STDC.gif Affine Linear Expansion 12-Uniform 3STRrD.gif Affine Linear Expansion 12-Uniform O3STIrCB.gif Affine Linear Expansion 13-Uniform All Slab.gif Affine Linear Expansion 16-Uniform OSTEIrCB.gif Affine Linear Expansion 24-Uniform All Planigons.gif

The first 12-uniform tiling contains all planigons with three types of vertices, and the second 12-uniform tiling contains all types of edges.

Optimized Tilings

A 14-Catalaves dual uniform tiling using p4g. Such tilings can assume any wallpaper group except for p4m since p4m only admits planigons O, S, T, D, s, C, B, H. 104-Uniform 14VRP p4g (6px).gif
A 14-Catalaves dual uniform tiling using p4g. Such tilings can assume any wallpaper group except for p4m since p4m only admits planigons O, S, T, D, s, C, B, H.

If - tiling means dual uniform, Catalaves tiling, then there exists a 11-9 tiling, [7] a 13-10 tiling, 15-11 tiling, a 19-12 tiling, two 22-13 tilings, and a 24-14 tiling. Also exists a 13-8 slab tiling and a 14-10 non-clock tiling. Finally, there are 7-5 tilings using all clock planigons: [10]

11-913-1015-1119-1222-13
11-Uniform 9-Catalaves Tiling.png
OSTRrD2sC2B
13-Uniform 10-Catalaves Tiling.png
3S2IRr3DFCBH
15-Uniform 11-Catalaves Tiling.png
3STEIRrFCB5H
19-Uniform 12-Catalaves Tiling.png
O3ST3Rr2D3FsCB3H
22-Uniform 13-Catalaves Tilings.gif
O32ST2EIRr4D2FCB4H
O32ST2EIRr3DFC2B5H
24-1413-8 Slab14-10 Non Clock7-5 All Clock
24-Uniform 14-Catalaves Tiling.png
O32S3TEIRr2DFsC2B6H
13-Uniform All Slab Tiling.png
EI2Rr2F2s2B2H
14-Uniform Non-Clock Tiling.png
EIRr3DFsCB2H
7-Uniform All Clock II.png
O33STB
7-Uniform All Clock Tiling.png
O32ST2D

Circle Packing

Each uniform tiling corresponds to a circle packing, in which circles of diameter 1 are placed at all vertex points, corresponding to the planigons. [11] Below are the circle packings of the Optimized Tilings and all-edge tiling:

Circles are colored according to vertex type, and gaps are colored according to regular polygon. Circle Packing Optimal Tilings.png
Circles are colored according to vertex type, and gaps are colored according to regular polygon.

5-dual-uniform 4-Catalaves tilings

A slideshow of all 94 5-dual-uniform tilings with 4 distinct planigons. Changes every 6 seconds, cycles every 60 seconds.

5-4 Dual Tilings.gif

Clock Tilings

All tilings with regular dodecagons in [7] are shown below, alternating between uniform and dual co-uniform every 5 seconds:

Clock Tilings (Uniform Tilings with Regular Dodecagons).gif
All tilings with regular dodecagons are shown below, alternating between uniform and dual co-uniform every 5 seconds.

65 k-Uniform Tilings

A comparison of 65 k uniform tilings in uniform planar tilings and their dual uniform tilings. The two lower rows coincide and are to scale:

Final Planar Tiling Project (30 Tiles).png
A comparison of 65 k uniform tilings in uniform planar tilings and their dual uniform tilings. The two lower rows coincide and are to scale.

Related Research Articles

<span class="mw-page-title-main">Antiprism</span> Polyhedron with parallel bases connected by triangles

In geometry, an n-gonal antiprism or n-antiprism is a polyhedron composed of two parallel direct copies of an n-sided polygon, connected by an alternating band of 2n triangles. They are represented by the Conway notation An.

<span class="mw-page-title-main">Cuboctahedron</span> Polyhedron with 8 triangular faces and 6 square faces

A cuboctahedron is a polyhedron with 8 triangular faces and 6 square faces. A cuboctahedron has 12 identical vertices, with 2 triangles and 2 squares meeting at each, and 24 identical edges, each separating a triangle from a square. As such, it is a quasiregular polyhedron, i.e., an Archimedean solid that is not only vertex-transitive but also edge-transitive. It is radially equilateral. Its dual polyhedron is the rhombic dodecahedron.

In geometry, a polygon is a plane figure made up of line segments connected to form a closed polygonal chain.

<span class="mw-page-title-main">Hexagon</span> Shape with six sides

In geometry, a hexagon is a six-sided polygon. The total of the internal angles of any simple (non-self-intersecting) hexagon is 720°.

<span class="mw-page-title-main">Decagon</span> Shape with ten sides

In geometry, a decagon is a ten-sided polygon or 10-gon. The total sum of the interior angles of a simple decagon is 1440°.

In Euclidean geometry, a regular polygon is a polygon that is direct equiangular and equilateral. Regular polygons may be either convex, star or skew. In the limit, a sequence of regular polygons with an increasing number of sides approximates a circle, if the perimeter or area is fixed, or a regular apeirogon, if the edge length is fixed.

<span class="mw-page-title-main">Dodecagon</span> Polygon with 12 edges

In geometry, a dodecagon, or 12-gon, is any twelve-sided polygon.

<span class="mw-page-title-main">120-cell</span> Four-dimensional analog of the dodecahedron

In geometry, the 120-cell is the convex regular 4-polytope (four-dimensional analogue of a Platonic solid) with Schläfli symbol {5,3,3}. It is also called a C120, dodecaplex (short for "dodecahedral complex"), hyperdodecahedron, polydodecahedron, hecatonicosachoron, dodecacontachoron and hecatonicosahedroid.

<span class="mw-page-title-main">Disdyakis dodecahedron</span> Geometric shape with 48 faces

In geometry, a disdyakis dodecahedron,, is a Catalan solid with 48 faces and the dual to the Archimedean truncated cuboctahedron. As such it is face-transitive but with irregular face polygons. It resembles an augmented rhombic dodecahedron. Replacing each face of the rhombic dodecahedron with a flat pyramid creates a polyhedron that looks almost like the disdyakis dodecahedron, and is topologically equivalent to it.

<span class="mw-page-title-main">Triaugmented triangular prism</span> Convex polyhedron with 14 triangle faces

The triaugmented triangular prism, in geometry, is a convex polyhedron with 14 equilateral triangles as its faces. It can be constructed from a triangular prism by attaching equilateral square pyramids to each of its three square faces. The same shape is also called the tetrakis triangular prism, tricapped trigonal prism, tetracaidecadeltahedron, or tetrakaidecadeltahedron; these last names mean a polyhedron with 14 triangular faces. It is an example of a deltahedron and of a Johnson solid.

<span class="mw-page-title-main">Euclidean tilings by convex regular polygons</span> Subdivision of the plane into polygons that are all regular

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.

<span class="mw-page-title-main">Hexagonal tiling</span> Regular tiling of a two-dimensional space

In geometry, the hexagonal tiling or hexagonal tessellation is a regular tiling of the Euclidean plane, in which exactly three hexagons meet at each vertex. It has Schläfli symbol of {6,3} or t{3,6} .

<span class="mw-page-title-main">Triangular tiling</span> Regular tiling of the plane

In geometry, the triangular tiling or triangular tessellation is one of the three regular tilings of the Euclidean plane, and is the only such tiling where the constituent shapes are not parallelogons. Because the internal angle of the equilateral triangle is 60 degrees, six triangles at a point occupy a full 360 degrees. The triangular tiling has Schläfli symbol of {3,6}.

<span class="mw-page-title-main">Snub trihexagonal tiling</span>

In geometry, the snub hexagonal tiling is a semiregular tiling of the Euclidean plane. There are four triangles and one hexagon on each vertex. It has Schläfli symbol sr{3,6}. The snub tetrahexagonal tiling is a related hyperbolic tiling with Schläfli symbol sr{4,6}.

In geometry, a polytope or a tiling is isotoxal or edge-transitive if its symmetries act transitively on its edges. Informally, this means that there is only one type of edge to the object: given two edges, there is a translation, rotation, and/or reflection that will move one edge to the other while leaving the region occupied by the object unchanged.

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

<span class="mw-page-title-main">Pentagon</span> Shape with five sides

In geometry, a pentagon is any five-sided polygon or 5-gon. The sum of the internal angles in a simple pentagon is 540°.

<span class="mw-page-title-main">Great triambic icosahedron</span>

In geometry, the great triambic icosahedron and medial triambic icosahedron (or midly triambic icosahedron) are visually identical dual uniform polyhedra. The exterior surface also represents the De2f2stellation of the icosahedron. These figures can be differentiated by marking which intersections between edges are true vertices and which are not. In the above images, true vertices are marked by gold spheres, which can be seen in the concave Y-shaped areas. Alternatively, if the faces are filled with the even–odd rule, the internal structure of both shapes will differ.

<span class="mw-page-title-main">3-4-3-12 tiling</span>

In geometry of the Euclidean plane, the 3-4-3-12 tiling is one of 20 2-uniform tilings of the Euclidean plane by regular polygons, containing regular triangles, squares, and dodecagons, arranged in two vertex configuration: 3.4.3.12 and 3.12.12.

References

  1. 1 2 Grünbaum, Branko; Shephard, G. C. (1987). Tilings and Patterns . W. H. Freeman and Company. pp.  59, 96. ISBN   0-7167-1193-1.
  2. Conway, John H.; Burgiel, Heidi; Goodman-Strauss, Chaim (April 18, 2008). "Chapter 21, Naming the Archimedean and Catalan polyhedra and tilings, Euclidean Plane Tessellations". The Symmetries of Things. A K Peters / CRC Press. p. 288. ISBN   978-1-56881-220-5. Archived from the original on 2010-09-19.
  3. Encyclopaedia of Mathematics: Orbit - Rayleigh Equation, 1991
  4. Ivanov, A. B. (2001) [1994], "Planigon", Encyclopedia of Mathematics , EMS Press
  5. "THE BIG LIST SYSTEM OF TILINGS OF REGULAR POLYGONS". THE BIG LIST SYSTEM OF TILINGS OF REGULAR POLYGONS. Retrieved 2019-08-30.
  6. Rusczyk, Richard. (2006). Introduction to geometry. Alpine, CA: AoPS Inc. ISBN   0977304523. OCLC   68040014.
  7. 1 2 3 4 5 "n-Uniform Tilings". probabilitysports.com. Retrieved 2019-06-21.
  8. k-uniform tilings by regular polygons Archived 2015-06-30 at the Wayback Machine Nils Lenngren, 2009 [ verification needed ]
  9. "11,20,39,33,15,10,7 - OEIS". oeis.org. Retrieved 2019-06-26.
  10. 1 2 3 "Tessellation catalog". zenorogue.github.io. Retrieved 2022-03-21.
  11. 1 2 J. E. Soto Sánchez, On Periodic Tilings with Regular Polygons, PhD Thesis, IMPA, Aug 2020.