Have you ever studied a tiling of a floor or a pattern on a quilt? Often a repetition of similarly shaped tiles is used for artistic effect. In this section, we will define a regular polygon and explore tilings that consist only of regular polygons. Is there a limit to the number of tilings that can created in this way?
In ExplorationΒ 1.1.1, we created a tiling of a square using tetrominoes. In this section, we will consider tilings of the plane. Since the plane continues infinitely, we will not be able to create a complete tiling in a finite space or finite time span. Instead, we sketch enough of the tiling to determine whether a tiling is possible. We ask ourselves whether we can continue the pattern vertically, horizontally, and diagonally without creating gaps or irregularities.
A tiling is a collection of closed polygons that cover a plane (continuing infinitely in all directions) with no gaps and no overlaps. A monohedral tiling is a tiling that uses only one shaped tile while a regular tiling is a monohedral tiling that uses a single regular polygon as its tile. In a regular tiling, each side of a polygon will line up perfectly with a side of an adjacent c.
This activity may be completed using physical tiles or in the interactive applet below. Be sure to save a record of your designs by tracing, photography, or screenshots. Some of the computations will also be used later in this section, so you are encouraged to keep an accessible record of your work for future reference.
The web application Polypad by Amplify provides regular \(n\)-gons for \(3\leq n\leq 8\text{.}\) These are the top six shapes provided in FigureΒ 2.4.6. Simply drag the shape from the left into the whiteboard area and it will make a new copy. Rotate the polygon using the dotted stem and move it by clicking on the interior and dragging. For \(n\)-gons with \(n\gt 8\text{,}\) use the nonagon at the bottom. Pull on the dotted vertex to change the number of sides. With the new \(n\)-gon selected, you can now use the duplicated sheet icon on the flip/cut/... menu to make copies of your \(n\)-gon. Undo, redo, reset, and extract buttons are provided on the right. The blue icon will enable you to open the interactive in the PolyPad application and work full screen.
Select a single regular polygon, make copies of it as needed, and use it to construct a regular tiling. Construct enough of the tiling to convince others that the tiling can continue to tile the plane, upward and downward, to the left and the right, with no gaps and overlaps.
Experiment with equilateral triangles, squares, regular pentagons, regular hexagons, and other regular \(n\)-gons to determine which can be used to create a regular tiling and which cannot. What do you think will happen with regular polygons with more than eight sides? Why?
Perhaps you noticed that the vertex angle measure plays a critical role in determining whether a regular polygon can be used to create a regular tiling. The steps in this exploration will lead you to determine the measure of the vertex angle of a regular pentagon. This technique will lead to a formula for computing the measure of the vertex angles for any regular \(n\)-gon.
Some of these properties, but not all, will be true for any convex pentagon. What results about angle measure will also hold for non-regular convex pentagons? What will be different?
Use your work from the previous task to complete the row for regular pentagon in the table below. Repeat this procedure for squares, regular hexagons, regular octagons, and regular decagons: First draw diagonals from a single vertex to dissect the polygon into triangles, next use the triangles to determine the total vertex angle measure, and then determine the measure of each angle. In the final row, \(n\) is a variable representing the number of sides and the answers will be algebraic expressions involving the variable \(n\text{.}\)
Now that we can compute the measure of an angle of a regular polygon, we return to the question of which regular tilings exist. Perhaps, you have determined the answer, but how do you convince others that you know all regular tilings? The relationship between angle measure and existance of regular tilings will be pursued in the tasks that follow. The interactive in FigureΒ 2.4.6 or the your work from ExplorationΒ 2.4.5 may be helpful in answering the questions.
If \(n\geq 7\text{,}\) do you know whether a regular \(n\)-gon might produce a regular tiling? Include a discussion of vertex angle measure in your explanation.
A vertex angle of a polygon is any angle which shares its vertex with that of the polygon. The sides of a vertex angle lie along the two sides of the polygon, meeting at the vertex.
When a polygon is regular, we can also define its center to be the point which is equidistant from all vertices of the polygon. A central angle of a regular polygon has its vertex at the center of the polygon and its sides consist of a pair of rays emanating from the center to two adjacent vertices.
A semiregular tiling is a tiling consisting of two or more regular polygons with common side lengths with the additional requirement that the arrangement of polygonal faces around every vertex is the same.
We can denote the vertex arrangement by identifying the number of sides in each polygon as we travel around a vertex. An example of this is the 3.3.4.3.4-vertex arrangement, referring to triangle, triangle, square, triangle, square. This arrangement is shown in FigureΒ 2.4.15 and will be discussed in the next exploration.
Note that \(3.4.3.4.3\) and \(4.3.4.3.3\) are two other ways of writing \(3.3.4.3.4\) in FigureΒ 2.4.15. We could begin at any polygon with a vertex at a given point and list the polygons sharing this vertex in order as we circle clockwise or counterclockwise. To avoid these repetitions, it is standard practice to begin with the polygon with the smallest number of sides and then move to its neighbor with the smallest number of sides, continuing around until all the polygons around the point have been named. Similarly, we write \(3.3.3.4.4\) rather than \(3.3.4.4.3\) for the tiling where the two squares are adjacent.
Check that the number of squares meeting at a vertex is the same.
4.8.4
Check that the number of squares meeting at a vertex is the same.
8.4.8
Correct. Note how we can move the first 8 to the end to get 4.8.8. The ordering is consistant even though the starting number differs.
8.8.4
Correct. Note how this is the same pattern in the reverse order. Since we are going around a point in a circular fashion, we can move the last number to the beginning without changing the order of the shapes.
In the first arrangement, the triangles are next to each other and the hexagons are next to each other. In the second arrangement the shapes alternate as they encircle each meeting point. No hexagon shares a side with another hexagon.
False.
In the first arrangement, the triangles are next to each other and the hexagons are next to each other. In the second arrangement the shapes alternate as they encircle each meeting point. No hexagon shares a side with another hexagon.
Extend the \(3.3.4.3.4\) design making sure that at each vertex you always have one or two triangles between any two squares; no two squares will share a side. Will this eventually fill the plane without gaps or overlaps?
Note that \(3.3.3.4.4\) gives a different pattern. In this pattern, squares that meet at a vertex will also share a side. Show that it is possible to create a tiling using the vertex arrangement \(3.3.3.4.4\) by building outward from your initial vertex arrangement.
Verify arithmetically that it is possible for an equilateral triangle, a regular heptagon, and a regular tetracontakaidigon (42-gon), to fit snugly around a single vertex with no overlaps. In shorthand, we can write this vertex arrangement as \(3.7.42\text{.}\)
Use the angle measures you found in TableΒ 2.4.9 and TaskΒ 2.4.14.b to list all combinations of three, four, or five regular polygons that could meet at a vertex, writing the vertex configurations in shorthand notation. Like the example in TaskΒ 2.4.14.c, the same shape may be repeated. If more than three polygons meet at a vertex, consider the different ways in which they could be arranged.
We are not including the three regular tilings in this list. There is one more vertex arrangement using five polygons (in addition to 3.3.4.3.4 and 3.3.3.4.4), five using four polygons, and eight more using three polygons (in addition to 3.7.42).
Some of the vertex arrangements in the previous task will extend to create a semiregular tiling, but not all of them! Choose some of your vertex arrangements in TaskΒ 2.4.14.e Experiment by surrounding one vertex using the pattern and then try to surround the neighboring vertices using the same arrangement. Which seem to work and which fail? For the ones that fail, what seems to go wrong?
This activity may have involved more of a struggle than some of the others. Perhaps you only found about half of the possibilities in TaskΒ 2.4.14.f or you cannot yet see a pattern to help determine which vertex arrangements lead to a semiregular tiling. That is perfectly normal. Write down the ideas that you do have and share them with classmates. As you share what you have observed and listen to othersβ discoveries, you and your classmates may uncover some amazing results.
When we look at possible vertex arrangements for a semiregular tiling, our options are very limited. Not including the regular tiling by squares, you should have found three groups of four regular polygons with an angle sum of 360 degrees. All of these have at least one polygon appearing twice. It would be nice to know why some of these extend to a semiregular tiling while others do not? For vertex patterns with the same set of shapes, does it matter whether the common polygons are next to each other or separated?
As we attempt to create a 3.3.6.6 pattern, we find that it is impossible to maintain a consistent vertex arrangement. Fairly quickly, we are forced to create a 3.6.3.6 arrangement at some vertices. On the other hand, a 3.3.6.6 vertex arrangement can continue indefinitely. Let us explore why this happens.
Exploration2.4.17.Semiregular Tilings with Four Regular Polygons at a Vertex.
(a)
Use physical or virtual triangles and hexagons to sketch a single copy of the vertex arrangement 3.3.6.6. The Polypad by Amplify applet in FigureΒ 2.4.18 may be used.
Choose one of the two triangles at this vertex and attempt to surround it with triangles and/or hexagons while maintaining the 3.3.6.6 arrangement at each vertex.
Explain why the arrangement \(3.3.m.n\) will not extend to a semiregular tiling using an argument similar to what we did with \(3.3.6.6\) in TaskΒ 2.4.17.c.
At least one of the polygons has an odd number,say \(m\text{,}\) of sides. Are you able to surround the \(m\)-gon along its sides by an alternating sequence of squares and \(n\)-gons?
Explain in words and pictures why \(m.4.n.4\) extends to a semiregular tiling, but \(m.4.4.n\) does not. Draw or record a sketch of \(m.4.n.4\) if you do not already have one.
We conclude that there are only two semiregular tilings and one regular tiling of the plane where four polygons meet at a vertex. All three vertex arrangements with five polygons meeting extend to semiregular tilings. To complete this analysis, we consider which three-polygon vertex arrangements extend to a semiregular tiling.
Exploration2.4.20.Semiregular Tilings with Three Regular Polygons at a Vertex.
(a)
Not including the regular tiling \(6.6.6\text{,}\) there are nine possible vertex arrangements consisting of three regular polygons. List as many as you can, referring back to the work you did in TaskΒ 2.4.14.f.
Use the fact that 5 is an odd number to explain why \(5.5.10\) does not extend to a semiregular tiling. You may include pictures as well as words in your explanation.
As we conclude this long section, it is wise to reflect on what we have learned. What should we add to our toolbox for later use? Definitions for regular polygons, tilings, regular tilings, and semiregular tilings were introduced at the beginning of the section. You should also note the items below:
What is the sum of the measures of the vertex angles for any (not necessarily regular) convex \(n\)-gon? For example, the measures of the angles of any triangle add up to 180 degrees. What is the total for a convex quadrilateral, a convex pentagon, etc.?
Just because a collection of regular polygons can surround a vertex does not mean that they can create a semiregular tiling. Give an example of a vertex arrangement that does not extend to a regular tiling. Support your claim.
If a regular 18-gon, a regular 9-gon, and an equilateral triangle meet at a vertex, will there be a gap? an overlap? or will they fit together without gaps or overlaps?
In FigureΒ 2.4.21, \(\angle{EAB}\) and \(\angle{ABC}\) are right angles, \(m(\angle{CDE})=99^\circ\text{,}\) and \(\angle{AED}\cong\angle{BCD}\text{.}\)
16.Another Way to Calculate the Vertex Angle of a Regular Polygon.
In FigureΒ 2.4.25, a regular nonagon, its center \(O\text{,}\) and segments joining each vertex to the center are shown. Use it to answer the following:
Explain how we can use the measure of a central angle to justify that the vertex angle of a regular \(n\)-gon has measure \(180-\frac{360}{n}\text{.}\)
You may use the applet in FigureΒ 2.4.26 for exploration and illustration. You may create other \(n\)-gons as needed. The βcircle and radius toolβ may be used to check your work, but not for finding the center.
Refer to FigureΒ 2.4.25. Do lines connecting vertices pass through the center? Give an alternate strategy for drawing lines that will pass through the center of an \(n\)-gon when \(n\) is odd.
You may use the nonagon in the GeoGebra applet in FigureΒ 2.4.26. The βcircle and radius toolβ may be used to check your work, but not for finding the center.
Write a letter to a friend in which you give a formula for the vertex angle of a regular \(n\)-gon and explain why it holds for all regular \(n\)-gons.