Abstract
Among the polyominoes that tile the plane by translation, the so-called squares have been conjectured to tile the plane in at most two distinct ways (these are called double squares). In this paper, we study two families of tiles : one is directly linked to Christoffel words while the other stems from the Fibonacci sequence. We show that these polyominoes are double squares, revealing strong connections between discrete geometry and other areas by means of combinatorics on words.
With support of the NSERC.
Chapter PDF
Similar content being viewed by others
References
Brlek, S., Provençal, X.: An optimal algorithm for detecting pseudo-squares. In: Kuba, A., Nyúl, L.G., Palágyi, K. (eds.) DGCI 2006. LNCS, vol. 4245, pp. 403–412. Springer, Heidelberg (2006)
Wijshoff, H.A.G., van Leeuven, J.: Arbitrary versus periodic storage schemes and tesselations of the plane using one type of polyomino. Inform. Control 62, 1–25 (1984)
Beauquier, D., Nivat, M.: On translating one polyomino to tile the plane. Discrete Comput. Geom. 6, 575–592 (1991)
Provençal, X.: Combinatoire des mots, géométrie discrète et pavages. PhD thesis, D1715, Université du Québec à Montréal (2008)
Brlek, S., Labelle, G., Lacasse, A.: Properties of the contour path of discrete sets. Int. J. Found. Comput. Sci. 17(3), 543–556 (2006)
Lothaire, M.: Combinatorics on Words. Cambridge University Press, Cambridge (1997)
Freeman, H.: On the encoding of arbitrary geometric configurations. IRE Trans. Electronic Computer 10, 260–268 (1961)
Freeman, H.: Boundary encoding and processing. In: Lipkin, B., Rosenfeld, A. (eds.) Picture Processing and Psychopictorics, pp. 241–266. Academic Press, New York (1970)
Braquelaire, J.P., Vialard, A.: Euclidean paths: A new representation of boundary of discrete regions. Graphical Models and Image Processing 61, 16–43 (1999)
Brlek, S., Provençal, X., Fédou, J.M.: On the tiling by translation problem. Discrete Applied Mathematics 157(3), 464–475 (2009)
Berstel, J., Lauve, A., Reutenauer, C., Saliola, F.: Combinatorics on Words: Christoffel Words and Repetition in Words. CRM monograph series, vol. 27, 147 pages. American Mathematical Society, Providence (2008)
Pirillo, G.: A new characteristic property of the palindrome of standard sturmian word. Sém. Lothar. Combin. 43, 1–3 (1999)
Borel, J.P., Reutenauer, C.: On christoffel classes. RAIRO-Theoretical Informatics and Applications 40, 15–28 (2006)
Monnerot-Dumaine, A.: The Fibonacci fractal. Submitted (September 2008)
Rozenberg, G., Salomaa, A.: Mathematical Theory of L Systems. Academic Press, Inc., Orlando (1980)
Rozenberg, G., Salomaa, A. (eds.): Lindenmayer Systems: Impacts on Theoretical Computer Science, Computer Graphics, and Developmental Biology. Springer, Secaucus (2001)
Prusinkiewicz, P., Lindenmayer, A.: The algorithmic beauty of plants. Springer, New York (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blondin-Massé, A., Brlek, S., Garon, A., Labbé, S. (2009). Christoffel and Fibonacci Tiles. In: Brlek, S., Reutenauer, C., Provençal, X. (eds) Discrete Geometry for Computer Imagery. DGCI 2009. Lecture Notes in Computer Science, vol 5810. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04397-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-04397-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04396-3
Online ISBN: 978-3-642-04397-0
eBook Packages: Computer ScienceComputer Science (R0)