Math 2.0

Convex and discrete geometry Tilings Example

Euclidean tilings by convex regular polygons

Builds on Regular polygonPeriodic tiling

Example

Consider tilings of the plane whose tiles are convex regular polygons. The tiling is edge-to-edge if two tiles that meet share either one full edge or one vertex. The interior angle of a regular nn-gon is (n−2)π/n(n-2)\pi/n. A tiling by copies of a single regular nn-gon is called regular. At each vertex of such a tiling some number k≥3k \ge 3 of tiles meet, so k(n−2)π/n=2πk(n-2)\pi/n = 2\pi, which gives (n−2)(k−2)=4(n-2)(k-2) = 4. The only solutions are (n,k)=(3,6),(4,4),(6,3)(n, k) = (3, 6), (4, 4), (6, 3). So there are exactly three regular tilings. They use equilateral triangles, six at each vertex; squares, four at each vertex; and regular hexagons, three at each vertex. In particular, regular pentagons do not tile the plane edge-to-edge, since 3⋅3π/5<2π<4⋅3π/53 \cdot 3\pi/5 < 2\pi < 4 \cdot 3\pi/5.

Remarks

An edge-to-edge tiling by regular polygons is semiregular, or Archimedean, if it uses more than one kind of polygon and its symmetries map any vertex to any other vertex. There are exactly eight semiregular tilings. One of them has at each vertex a triangle, a square, a hexagon and a square, in this cyclic order; the angles add up to π/3+π/2+2π/3+π/2=2π\pi/3 + \pi/2 + 2\pi/3 + \pi/2 = 2\pi. The three regular and the eight semiregular tilings are all periodic.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Periodic tiling concept
  2. Regular polygon concept
  3. Euclidean tilings by convex regular polygons example

Further reading

  1. Web https://en.wikipedia.org/wiki/Euclidean_tilings_by_convex_regular_polygons
About this page
TagCTVSGWNB19
URIm2://CTVSGWNB19
Kindexample
WritingW0 stub
MSC52C20, 05B45
Instance ofTessellation
UsesRegular polygon, Periodic tiling
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.