Convex Polygons for Aperiodic Tiling
From MaRDI portal
Publication:6270664
arXiv1602.06372MaRDI QIDQ6270664FDOQ6270664
Authors: Teruhisa Sugimoto 
Publication date: 20 February 2016
Abstract: If all tiles in a tiling are congruent, the tiling is called monohedral. Tiling by convex polygons is called edge-to-edge if any two convex polygons are either disjoint or share one vertex or one entire edge in common. In this paper, we prove that a convex polygon that can generate an edge-to-edge monohedral tiling must be able to generate a periodic tiling.
Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Quasicrystals and aperiodic tilings in discrete geometry (52C23)
This page was built for publication: Convex Polygons for Aperiodic Tiling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6270664)
