Exhaustive search of convex pentagons which tile the plane
arXiv:1708.00274
Abstract
We present an exhaustive search of all families of convex pentagons which tile the plane. This research shows that there are no more than the already 15 known families. In particular, this implies that there is no convex polygon which allows only non-periodic tilings.
Cited by in corpus (13)
- An aperiodic monotile
- Characterization of the Two-Dimensional Five-Fold Lattice Tiles
- Multiple Translative Tilings in Euclidean Spaces
- A guide to Penrose tilings
- Towards Obtaining 2D and 3D and 1D PtPN with Pentagonal Pattern
- Multiple Lattice Tilings in Euclidean Spaces
- Characterization of the Two-Dimensional Five-Fold Translative Tiles
- Characterization of the Two-Dimensional Six-Fold Lattice Tiles
- Tilings of the Sphere by Congruent Pentagons I: Edge Combinations and
- Can You Pave the Plane Nicely with Identical Tiles
- Pressure Actuated Cellular Structures
- Properties of Convex Pentagonal Tiles for Periodic Tiling
- Intensive use of computing resources for dominations in grids and other combinatorial problems