We consider paths in the 2D square grid, composed of grid edges, given as a sequence of
moves in the four cardinal compass directions, without U-turns, but possibly passing several …

The Freeman chain code is a common and useful way for representing discrete paths by
means of words such that each letter encodes a step in a given direction. In the discrete …

A plane tiling consisting of congruent copies of a shape is isohedral provided that for any
pair of copies, there exists a symmetry of the tiling mapping one copy to the other. We give a …

We review some recent results in digital geometry obtained by using a combinatorics on
words approach to discrete geometry. Motivated on the one hand by the well-known theory …

Arithmetic discrete planes can be considered as liftings in the space of quasicrystals and
tilings of the plane generated by a cut and project construction. We first give an overview of …

In the late 30's, Maurits Cornelis Escher astonished the artistic world by producing some
puzzling drawings. In particular, the tesselations of the plane obtained by using a single tile …

Ce travail se consacre principalement à l'étude d'équations sur les mots ainsi qu'à leur
application en géométrie discrète. Comme le rappelle Freeman en 1961, tout chemin dans …

Ce mémoire de maîtrise se consacre à l'étude des figures discrètes, un sujet à l'intersection
de la combinatoire des mots et la géométrie digitale. Décrite simplement, une figure discrète …

Arithmetic discrete planes are sets of integer points located within a fixed bounded distance
(called thickness) of a Euclidean plane. We focus here on a class of “thin” arithmetic discrete …

Some applications of combinatorics on words to discrete geometry Page 1 Introduction Words
Discrete Figures Some applications of combinatorics on words to discrete geometry Srecko …