Edge Tessellation¶
A congruent polygonal tiling closed under reflection across every tile edge, so one tile and its edge reflections generate the entire tiling.
Core Idea¶
An edge tessellation is a tiling of a plane by congruent convex polygons with a stringent local-to-global rule: reflect any tile across the line containing any one of its edges, and the reflected polygon must be another whole tile of the same tessellation. Starting from one generator tile and repeatedly reflecting across exposed tile edges therefore recovers the entire connected tiling. The same operation that crosses a boundary also constructs the neighbor on the other side.
This reflection-closure condition is much stronger than ordinary tessellation. A monohedral tiling asks that all tiles be congruent. An edge-to-edge tiling asks that neighboring polygons meet along a whole common edge rather than a partial edge.
Scope of Application¶
The primary scope is Euclidean tiling theory. The every-edge reflection rule turns a broad classification question—what convex polygon can tile the plane?—into a finite and complete list. It relates metric geometry, local vertex figures, plane crystallographic restrictions, and global symmetry. The structure also provides canonical examples of Laves or dual-uniform tilings, but “Laves tiling” is a broader classificatory setting rather than an alias.
Clarity¶
The phrase “edge tessellation” is easy to misread as “a tessellation whose edges line up.” The decisive word is not edge-to-edge but reflection. At every shared edge, the two incident polygons are mirror images in the supporting line. This provides a mechanical diagnostic that ordinary tiling labels lack.
Manages Complexity¶
The every-edge condition converts a global extension problem into local constraints with global force. Once one tile is fixed, a neighboring tile is not chosen from a library or positioned independently: reflection determines it uniquely. Continuing across the connected adjacency graph determines every tile in the orbit. Candidate freedom moves from infinitely many placements to the shape and angle data of one polygon plus consistency relations around vertices.
Abstract Reasoning¶
A reliable construction-and-test procedure is:
- Specify the ambient metric plane and a convex candidate polygon (P). 2. Reflect (P) across each supporting edge line to create its immediate neighbors. 3. Continue reflection across new boundary edges while tracking coincident copies. 4. At each vertex, verify that congruent corner sectors sum to (360^°) in the Euclidean case, or to the appropriate full angle in the chosen geometry.
Knowledge Transfer¶
Within discrete geometry, the same recognition machinery transfers among Euclidean polygon classification, reflection groups, Laves tilings, kaleidoscopic image propagation, triangular billiards, and stamp-folding sheets. The carrier and application change, but one generator, its full edge set, reflection propagation, vertex closure, and path consistency remain literal.
Transfer to non-Euclidean geometry is also literal if “line,” “polygon,” “congruent,” and “reflection” are interpreted in the spherical or hyperbolic metric. What does not transfer is the Euclidean classification. Curvature changes angle sums and discreteness conditions, producing other reflection polygons and groups.
Relationships to Other Abstractions¶
Current abstraction Edge Tessellation Domain-specific
Parents (1) — more general patterns this builds on
-
Edge Tessellation is a kind of Symmetry Prime
Symmetry — proposed parent. The tile set is invariant under the group generated by reflections in tile-edge lines.
Hierarchy path (1) — routes to 1 parentless root
- Edge Tessellation → Symmetry
Neighborhood in Abstraction Space¶
Edge Tessellation sits in a sparse region of the domain-specific corpus (72nd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Unclustered & Miscellaneous (1565 abstractions)
Nearest neighbors
- Triangle group — 0.85
- Reuleaux polygon — 0.85
- Relative convex hull — 0.85
- Convex hull — 0.84
- Polygon partition — 0.83
Computed from structural-signature embeddings · 2026-09-08