A Note on Planar Monohedral Tilings

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Abstract

A planar monohedral tiling is a decomposition of $R^2$ into congruent tiles. We say that such a tiling has the flag property if for each triple of tiles that intersect pairwise, the three tiles intersect in a common point. We show that for convex tiles, there exist only three classes of tilings that are not flag, and they all consist of triangular tiles; in particular, each convex tiling using polygons with $ngeq 4$ vertices is flag. We also show that an analogous statement for the case of non-convex tiles is not true by presenting a family of counterexamples.
Original languageEnglish
Title of host publicationProc. 34th European Workshop on Computational Geometry EuroCG '18
Place of PublicationBerlin, Germany
Pages31:1-31:6
Publication statusPublished - 2018
Event34th European Workshop on Computational Geometry - FU Berlin, Berlin, Germany
Duration: 21 Mar 201823 Mar 2018
https://conference.imp.fu-berlin.de/eurocg18/home

Conference

Conference34th European Workshop on Computational Geometry
Abbreviated titleEuroCG 2018
CountryGermany
CityBerlin
Period21/03/1823/03/18
Internet address

Cite this

Aichholzer, O., Kerber, M., Talata, I., & Vogtenhuber, B. (2018). A Note on Planar Monohedral Tilings. In Proc. 34th European Workshop on Computational Geometry EuroCG '18 (pp. 31:1-31:6). Berlin, Germany.

A Note on Planar Monohedral Tilings. / Aichholzer, Oswin; Kerber, Michael; Talata, István; Vogtenhuber, Birgit.

Proc. 34th European Workshop on Computational Geometry EuroCG '18. Berlin, Germany, 2018. p. 31:1-31:6.

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Aichholzer, O, Kerber, M, Talata, I & Vogtenhuber, B 2018, A Note on Planar Monohedral Tilings. in Proc. 34th European Workshop on Computational Geometry EuroCG '18. Berlin, Germany, pp. 31:1-31:6, 34th European Workshop on Computational Geometry, Berlin, Germany, 21/03/18.
Aichholzer O, Kerber M, Talata I, Vogtenhuber B. A Note on Planar Monohedral Tilings. In Proc. 34th European Workshop on Computational Geometry EuroCG '18. Berlin, Germany. 2018. p. 31:1-31:6
Aichholzer, Oswin ; Kerber, Michael ; Talata, István ; Vogtenhuber, Birgit. / A Note on Planar Monohedral Tilings. Proc. 34th European Workshop on Computational Geometry EuroCG '18. Berlin, Germany, 2018. pp. 31:1-31:6
@inproceedings{1930f941fcee4122bdf4064662acff37,
title = "A Note on Planar Monohedral Tilings",
abstract = "A planar monohedral tiling is a decomposition of $R^2$ into congruent tiles. We say that such a tiling has the flag property if for each triple of tiles that intersect pairwise, the three tiles intersect in a common point. We show that for convex tiles, there exist only three classes of tilings that are not flag, and they all consist of triangular tiles; in particular, each convex tiling using polygons with $ngeq 4$ vertices is flag. We also show that an analogous statement for the case of non-convex tiles is not true by presenting a family of counterexamples.",
author = "Oswin Aichholzer and Michael Kerber and Istv{\'a}n Talata and Birgit Vogtenhuber",
year = "2018",
language = "English",
pages = "31:1--31:6",
booktitle = "Proc. 34th European Workshop on Computational Geometry EuroCG '18",

}

TY - GEN

T1 - A Note on Planar Monohedral Tilings

AU - Aichholzer, Oswin

AU - Kerber, Michael

AU - Talata, István

AU - Vogtenhuber, Birgit

PY - 2018

Y1 - 2018

N2 - A planar monohedral tiling is a decomposition of $R^2$ into congruent tiles. We say that such a tiling has the flag property if for each triple of tiles that intersect pairwise, the three tiles intersect in a common point. We show that for convex tiles, there exist only three classes of tilings that are not flag, and they all consist of triangular tiles; in particular, each convex tiling using polygons with $ngeq 4$ vertices is flag. We also show that an analogous statement for the case of non-convex tiles is not true by presenting a family of counterexamples.

AB - A planar monohedral tiling is a decomposition of $R^2$ into congruent tiles. We say that such a tiling has the flag property if for each triple of tiles that intersect pairwise, the three tiles intersect in a common point. We show that for convex tiles, there exist only three classes of tilings that are not flag, and they all consist of triangular tiles; in particular, each convex tiling using polygons with $ngeq 4$ vertices is flag. We also show that an analogous statement for the case of non-convex tiles is not true by presenting a family of counterexamples.

M3 - Conference contribution

SP - 31:1-31:6

BT - Proc. 34th European Workshop on Computational Geometry EuroCG '18

CY - Berlin, Germany

ER -