Planigon

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.

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ünbaums. Their dual tilings are called ''Laves tilings'' in honor of crystallographer Fritz Laves. They're also called Shubnikov–Laves tilings after Shubnikov, Alekseĭ Vasilʹevich. 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. 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.8²) 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.

Using the 12-5 Dodecagram (Above)

All 14 uniform usable regular vertex planigons also hail from the 6-5 dodecagram (where each segment subtends $5\pi/6$ 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:

$\sin\frac=\sin 15^=\frac\approx 0.258819$

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 $2k\text(k-1)$ polygram, where $k=\gcd(n_1,\dots,n_m)$ and $n_i$ is the number of sides of sides in the RP adjacent to each involved vertex figure. This is because the circumradius $\frac\csc\frac$ of any regular $n_i$-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 $2\pi/n_i$, since all $2k\text(k-1)$ polygrams admit incircles of inradii $1/2$ tangent to all its sides.

Regular Vertices

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

# All vertices are regular,
# 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):

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

Edge-to-Edge Correspondence

Alternatively, ''k''-dual uniform tilings (and all 21 planigons) can be constructed by forming new centroid-edge midpoint line segments of the original regular polygons (dissecting the regular ''n''-gons into ''n'' congruent deltoids or ortho), and then removing the original edges (leaving the dual). Complete planigons will form around interior vertices, and line segments of (many possible) planigons will form around boundary vertices, giving a 1-to-1 edge ''k''-dual uniform lattice. On the other hand, centroid-centroid connecting only yields interior planigons, but this construction is nonetheless equivalent to the original in the interior. If the ''k''-uniform tiling fills the entire frame, then so will the ''k''-dual uniform tiling, and the boundary line segments can be ignored (equivalent to original construction).

Affine Linear Expansion

Starting from the regular polygons of a k-uniform tiling, we can scale all regular polygons about their centroids over a linear factor 0, and put planigons in the vertex-figure gaps of scale $1-x$. The original tiling starts from x = 0 and ends at the dual tiling (x = 1

This is true because the circumradii of the regular polygons are the same as the diagonals from the Incenter, incenters of the planigons to their co-vertices, as we could see in the construction above (or by applying a kis-operator to both the uniform and dual adds the same join lattic

. Therefore, scaling the regular polygons by $x$ yields proportional plangions of scale $1-x$ at the vertex-figure gaps. The intermediate stages are equivalent to Conway polyhedron notation#Original operations, expand (hence the expansion), and the union of all dyadic-$x$ affine linear expansions of a tiling is closed under expansion (contains all expands

An example is shown below:

Derivation of all possible planigons

For edge-to-edge Euclidean tilings, the Internal angle, interior angles of the convex polygons meeting at a vertex must add to 360 degrees. A regular '-gon has internal angle $\left(1-\frac\right)180^\circ$ 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 $60^\circ,90^\circ,108^\circ,120^\circ,128\frac^\circ,135^\circ,140^\circ,144^\circ, 147\frac^\circ,150^\circ,\dots$, we can find all combinations of admissible corner angles according to the following rules:

# Every vertex has at least degree 3 (a degree-2 vertex must have two straight angles or one reflex angle);
# If the vertex has degree $d$, the smallest $d-1$ polygon vertex angles sum to over $180^$;
#The vertex angles add to $360^$, and must be angles of regular polygons of positive integer sides (of the sequence $60^\circ,90^\circ,108^\circ,120^\circ,128\frac^\circ,135^\circ,140^\circ,144^\circ, 147\frac^\circ,150^\circ,\dots$).
Using the rules generates the list below:

*The $90^\text135^\text135^~(\times 1)$ cannot coexist with any other vertex types.

The solution to Challenge Problem 9.46, ''Geometry'' (Rusczyk), 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 $1(1)+(1(2)+1)+(3(2)+1)+10=21$ combinations of regular polygons which meet at a vertex.

Plangions 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:

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

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

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.

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.

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 (''m'' ≥ ''k''), 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:

Higher Dual Uniform Tilings

Insets of Dual Planigons into Higher Degree Vertices

* A degree-six vertex can be replaced by a center regular hexagon and six edges emanating thereof;
* A degree-twelve vertex can be replaced by six deltoids (a center deltoidal hexagon) and twelve edges emanating thereof;
* A degree-twelve vertex can be replaced by six Cairo pentagons, a center hexagon, and twelve edges emanating thereof (by dissecting the degree-6 vertex in the center of the previous example).

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):

3-Dual-Uniform

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

4-Dual-Uniform

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

5-Dual-Uniform

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

Krotenheerdt duals with six planigons

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

Krotenheerdt duals with seven planigons

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

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

From $n\ge 8$ onward, there are no uniform ''n'' tilings with ''n'' vertex types, or no uniform ''n'' duals with ''n'' distinct (semi)planigons.

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 $1+\sqrt,2+\sqrt,3+\sqrt$ as seen below:

Large Fractalization

To enlarge the planigons V3².4.12 and V3.4.3.12 using the truncated trihexagonal method, a scale factor of $2(3+\sqrt)$ must be applied:

Big Fractalization

By two 9-uniform tilings in 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:

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

Miscellaneous

Centroid-Centroid Construction

Dual co-uniform tilings (red) along with the originals (blue) of selected tilings. J. E. Soto Sánchez
On Periodic Tilings with Regular Polygons
PhD Thesis, IMPA, Aug 2020. 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, 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).

Other Edge-Edge Construction Comparisons

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

Affine Linear Expansions

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

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

If $a$-$b$ tiling means $a$ dual uniform, $b$ Catalaves tiling, then there exists a 11-9 tiling, 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:

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.

Clock Tilings

All tilings with regular dodecagons in 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:

References

{{reflist

Planigon tessellation cellular automata
Alexander Korobov , 30 September 1999

B. N. Delone, “Theory of planigons”
Izv. Akad. Nauk SSSR Ser. Mat., 23:3 (1959), 365–386

Types of polygons
Euclidean tilings