Abstract
To tile consists in assembling colored tiles on while respecting color matching. Tilings, the outcome of the tile process, can be seen as a computation model. In order to better understand the global structure of tilings, we introduce two topologies on tilings, one à la Cantor and another one à la Besicovitch. Our topologies are concerned with the whole set of tilings that can be generated by any tile set and are thus independent of a particular tile set. We study the properties of these two spaces and compare them. Finally, we introduce two infinite games on these spaces that are promising tools for the study of the structure of tilings. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Lafitte, G., & Weiss, M. (2008). A topological study of tilings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4978 LNCS, pp. 375–387). Springer Verlag. https://doi.org/10.1007/978-3-540-79228-4_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
