Regular polygonal systems
DOI:
https://doi.org/10.26493/1855-3974.997.7efKeywords:
Regular polygonal system, boundary code, face vector, symmetry group, reconstructibility from the boundaryAbstract
Let M = M(Ω) be any triangle-free tiling of a planar polygonal region Ω with regular polygons. We prove that its face vector f(M) = (f3, f4, f5, …), its symmetry group S(M) and the tiling M itself are uniquely determined by its boundary angles code ca(M) = ca(Ω) = (t1, …, tr), a cyclical sequence of numbers ti describing the shape of Ω.
Downloads
Additional Files
- Regular polygonal systems (corrected version 25.8.2017)
- A list of corrections 25.8.2017
- slika1.pdf
- slika3.pdf
- slika7.pdf
- slika8b.pdf
- slika10.pdf
- slika9,pdf
- simgrupa1.pdf
- slika11.pdf
- slika12.pdf
- slika13.pdf
- Regular polygonal systems corrected March 2018
- Regular polygonal systems corrected March 2018 .pdf
Published
2018-11-18
Issue
Section
Articles
License
Articles in this journal are published under Creative Commons Attribution 4.0 International License
https://creativecommons.org/licenses/by/4.0/