Original file (SVG file, nominally 207 × 251 pixels, file size: 631 bytes)
 | This is a file from the Wikimedia Commons. Information from its description page there is shown below. Commons is a freely licensed media file repository. You can help. |
Summary
| Description |
English: This image illustrates an example of Combinations of regular polygons that can meet at a vertex.
For Euclidean tilings, the internal angles of the polygons meeting at a vertex must add to 360 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. Only eleven of these can occur in a uniform tiling of regular polygons. 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. These arrangements are here enumerated:
|
| Date | |
| Source | Own work |
| Author | Dllu |
Licensing
 
|
This file is made available under the Creative Commons CC0 1.0 Universal Public Domain Dedication. |
| The person who associated a work with this deed has dedicated the work to the public domain by waiving all of their rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
|
