Abstract

Tilings of the discrete plane Z 2 generated by quasi-linear transformations (QLT) have been introduced by Nehlig [P. Nehlig, Applications quasi-affines: Pavages par images réciproques, Theoretical Computer Science 156 (1995) 1–38]. We studied these tilings and gave some results, such as periodicity and the number of neighbours of each of them [M.-A. Jacob-Da Col, Applications quasi-affines et pavages du plan discret, Theoretical Computer Science 259 (2001) 245–269. Also available in English: http://dpt-info.u-strasbg.fr/~jacob/articles/paving.pdf]. The aim of this paper is to go on with this study in the discrete n -dimensional space Z 2 ; we give a lower and an upper bound to the number of distinct tiles. We also give an algorithm to determine the points of a given tile, this algorithm will induce another algorithm to determine the number of distinct tiles associated to a QLT.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.