close
Jump to content

Tessellation

From Simple English Wikipedia, the free encyclopedia

Tessellation of a flat surface refers to the repeated placement of shapes with no overlaps and no gaps. These shapes are also called tiles. In mathematics, tessellations can be generalized to higher dimensions and a variety of geometries.

The three regular polygons that can tesselate.
Six regular polygons and a few other shapes, making tessellations.
This is a common pattern in the floors of buildings.
Using only regular pentagons to cover a flat plane like this leaves star-shaped holes everywhere.

Only three regular polygons can cover a perfectly level surface: triangles, squares, and hexagons. Other shapes, like pentagons, will need help from other shapes like rhombi.

Roger Penrose in front of Penrose tiles in a bathroom in Philadelphia.

Penrose tilings are special cases where the pattern never repeats, no matter how much it continues.

In real life

[change | change source]

Since ancient times, people have used tessellations to decorate buildings.

The artist M.C. Escher was brilliant at painting pictures involving tessellation. He was inspired by the walls and floors in Muslim buildings.[1]

Tilings like this one inspired MC Escher.

Tessellations appear a lot in nature. One of the best examples is the honeycomb. Honeycombs are built with hexagonal holes to hold honey and bees. If you can build a square that's big enough to hold 225 bees, you can bend the edges into a hexagon and hold 260 bees. If you want to have a lot of area with only a certain amount of perimeter, the best shape is a circle, so bees build circles, and the wax slowly melts into hexagons.[2] This is called the honeycomb theorem.[3]

A detail from M.C. Escher's painting, Metamorphosis, displayed in a museum in Brazil.

In puzzles

[change | change source]

Many puzzles like Tangram are built around tessellation.

.


  1. Locher, J. L. (1971). The World of M. C. Escher. Abrams. pp. 17, 70–71. ISBN 0-451-79961-5.
  2. Wentworth, Thompson, D'Arcy (1917). On growth and form. Cambridge [Eng.]: University press.{{cite book}}: CS1 maint: multiple names: authors list (link)
  3. Hales, T. C. (2001-01-01). "The Honeycomb Conjecture". Discrete & Computational Geometry. 25 (1): 1–22. doi:10.1007/s004540010071. ISSN 1432-0444.