arXiv · 1508.01864
Tiling Problem: Convex Pentagons for Edge-to-Edge Monohedral Tiling and Convex Polygons for Aperiodic Tiling
Abstract
We show that convex pentagons that can generate edge-to-edge monohedral tilings of the plane can be classified into exactly eight types. Using these results, it is also proved that no single convex polygon can be an aperiodic prototile without matching conditions other than "edge-to-edge."
Explore related subjects
Keep this discovery
Teruhisa Sugimoto. 2015-08-08. Tiling Problem: Convex Pentagons for Edge-to-Edge Monohedral Tiling and Convex Polygons for Aperiodic Tiling. https://arxiv.org/abs/1508.01864
Cite the original work for its findings. Save a collection to share your selection of sources.