Design Principles for Tilings with Regular Polygons: Symmetry, Angles, and Repetition

Exploring Tilings with Regular Polygons: Patterns and Principles

Overview

A tiling (tessellation) covers the plane without gaps or overlaps using repeated shapes. When tiles are regular polygons (equal sides and angles), tilings reveal rich geometric structure driven by vertex-angle constraints and symmetry.

Key principles

• Vertex-angle condition: At any vertex, the interior angles of meeting polygons must sum to 360°. For a regular n-gon, interior angle = (1 – 2/n)180°; this restricts which polygons can meet.
• Monohedral (regular) tilings: Single regular polygon types that tile the plane—only equilateral triangles (3), squares (4), and regular hexagons (6) satisfy the vertex condition alone.
• Edge-to-edge tilings: Tiles meet full edge to full edge; common in systematic classifications. Non-edge-to-edge tilings allow partial edge contacts and more variety.
• Semi-regular (Archimedean) tilings: Vertex-transitive tilings made from two or more regular polygon types in a repeating vertex pattern (e.g., 3.3.3.4.4 denotes three triangles and two squares around each vertex). There are 8 such tilings.
• Johnson/Grünbaum–Shephard classifications: Broader catalogs classify many combinations of regular polygons in edge-to-edge tilings (including 15+ families of uniform and demi-regular patterns).
• Symmetry groups: Wallpaper groups describe global symmetries of periodic tilings; regular-polygon tilings often realize several of the 17 wallpaper groups.
• Aperiodic and nonperiodic variantes: Using rules or matching constraints, one can form nonperiodic tilings that still use regular polygons (less common than with other prototiles).

• Angle arithmetic: Solve integer equations of the form sum_{i}(180(1-2/ni)) = 360 to find feasible vertex configurations.
• Dual graphs: Use planar graphs where vertices represent tiles and edges represent adjacency; helpful for enumerating patterns.
• Geometric construction: Start from a chosen vertex configuration and extend by reflecting/rotating tiles to build a patch, then test for tiling extendability.
• Computational search: Use software to exhaustively search vertex configurations and attempt finite patches grown by matching rules.