Tilings Of Regular Polygons Shopping
Tiling
Website Links For
Regular
 

Information About

Tilings Of Regular Polygons





REGULAR TILINGS


Following Grünbaum and Shephard (section 1.3), a tiling is said to be ''regular'' if the Symmetry Group of the tiling Acts Transitively on the ''flags'' of the tiling, where a flag is a triple consisting of a mutually incident Vertex , edge and tile of the tiling. This means that for every pair of flags there is a symmetry operation mapping the first flag to the second. This is equivalent to the tiling being an Edge-to-edge Tiling by Congruent regular polygons. There must be six Equilateral Triangle s, four Square s or three regular Hexagon s at a vertex, yielding the three ''regular tessellations''.









3.3.3.3.3.3
Triangular Tiling


4.4.4.4
Square Tiling


6.6.6
Hexagonal Tiling



ARCHIMEDEAN, UNIFORM OR SEMIREGULAR TILINGS


Vertex-transitivity means that for every pair of vertices there is a symmetry operation mapping the first vertex to the second.

If the requirement of flag-transitivity is relaxed to one of vertex-transitivity, while the condition that the tiling is edge-to-edge is kept, there are eight additional tilings possible, known as ''Archimedean'', '' Uniform '' or ''semiregular'' tilings.





















3.3.3.3.6
Snub Hexagonal Tiling


3.6.3.6
Trihexagonal Tiling


3.3.3.4.4
Prismatic Trisquare Tiling


3.3.4.3.4
Snub Square Tiling


3.4.6.4
Small Rhombitrihexagonal Tiling


4.8.8
Truncated Square Tiling


3.12.12
Truncated Hexagonal Tiling


4.6.12
Great Rhombitrihexagonal Tiling


Grünbaum and Shephard distinguish the description of these tilings as ''Archimedean'' as referring only to the local property of the arrangement of tiles around each vertex being the same, and that as ''uniform'' as referring to the global property of vertex-transitivity. Though these yield the same set of tilings in the plane, in other spaces there are Archimedean tilings which are not uniform.


COMBINATIONS OF REGULAR POLYGONS THAT CAN MEET AT A VERTEX


The Internal Angle s of the polygons meeting at a vertex must add to 360 degrees. A regular n-gon has internal angle (1- rac{2}{n})180 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 fifteen of these can occur in any tiling of regular polygons. For example, 3.7.42 cannot occur because it is the only type involving a regular Heptagon , meaning that triangles and 42-gons would need to alternate around the heptagon, which is impossible since it has an odd number of sides.

With 3 polygons at a vertex:
  • 3.7.42 (cannot appear in any tiling of regular polygons)

  • 3.8.24 (cannot appear in any tiling of regular polygons)

  • 3.9.18 (cannot appear in any tiling of regular polygons)

  • 3.10.15 (cannot appear in any tiling of regular polygons)

  • 3.12.12

  • 4.5.20 (cannot appear in any tiling of regular polygons)

  • 4.6.12

  • 4.8.8 (can only appear in one tiling of regular polygons, which is a uniform tiling)

  • 5.5.10 (cannot appear in any tiling of regular polygons)

  • 6.6.6

  • With 4 polygons at a vertex:

  • 3.3.4.12 or 3.4.3.12

  • 3.3.6.6 or 3.6.3.6

  • 4.4.4.4

  • 3.4.4.6 or 3.4.6.4

  • With 5 polygons at a vertex:

  • 3.3.3.3.6

  • 3.3.3.4.4 or 3.3.4.3.4

  • With 6 polygons at a vertex:

  • 3.3.3.3.3.3



OTHER EDGE-TO-EDGE TILINGS


Any number of non-uniform (sometimes called demiregular) edge-to-edge tilings by regular polygons may be drawn. Here are four examples:












3.3.6.6 & 3.3.3.3.3.3


3.3.6.6 & 3.6.3.6


3.3.4.12 & 3.3.3.3.3.3


3.4.4.6 & 3.6.3.6


Such periodic tilings may be classified by the number of Orbits of vertices, edges and tiles. If there are n orbits of vertices, a tiling is known as n-uniform or n-isogonal; if there are n orbits of tiles, as n-isohedral; if there are n orbits of edges, as n-isotoxal. The examples above are four of the twenty 2-uniform tilings. Chavey lists all those edge-to-edge tilings by regular polygons which are at most 3-uniform, 3-isohedral or 3-isotoxal.


TILINGS THAT ARE NOT EDGE-TO-EDGE


Regular polygons can also form plane tilings that are not edge-to-edge. Such tilings may also be known as uniform if they are vertex-transitive; there are eight families of such uniform tilings, each family having a real-valued parameter determining the overlap between sides of adjacent tiles or the ratio between the edge lengths of different tiles.


BEYOND THE PLANE


These tessellations are also related to regular and semiregular polyhedra and tessellations of the Hyperbolic Plane . Semiregular polyhedra are made from regular polygon faces, but their angles at a point add to less than 360 degrees. Regular polygons in hyperbolic geometry have angles smaller than they do in the plane. In both these cases, that the arrangement of polygons is the same at each vertex does not mean that the polyhedron or tiling is vertex-transitive.

Some regular tilings of the hyperbolic plane (Using Poincaré disc model projection)


SEE ALSO




REFERENCES




EXTERNAL LINKS


  • http://www.uwgb.edu/dutchs/symmetry/uniftil.htm

  • http://www.ics.uci.edu/~eppstein/junkyard/tiling.html

  • --- http://www.uwgb.edu/dutchs/symmetry/archpol.htm

  • http://www.ics.uci.edu/~eppstein/junkyard/hypertile.html

  • --- http://www.hadron.org/~hatch/HyperbolicTesselations/

  • --- http://aleph0.clarku.edu/~djoyce/poincare/poincare.html

  • --- http://members.lycos.co.uk/tiletris/