Discrete geometry redefines notions borrowed from Euclidean geometry creating a need for
new algorithmical tools. The notion of convexity does not translate trivially, and detecting if a …

It has been proved that, among the polyominoes that tile the plane by translation, the so-
called squares tile the plane in at most two distinct ways. In this paper, we focus on double …

An Optimal Algorithm for Tiling the Plane with a Translated Polyomino | SpringerLink Skip to
main content Advertisement SpringerLink Account Menu Find a journal Publish with us Track …

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) …

An unknown planar discrete set of points A can be inspected by means of a probe P of
generic shape that moves around it, and reveals, for each position, the number of its …

The notion of convexity translates non-trivially from Euclidean geometry to discrete
geometry, and detecting if a discrete region of the plane is convex requires analysis. In this …

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 …

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 …

We consider words on a finite alphabet Σ and study the structure of its σ-palindromes, ie
words w satisfying w= σ ($\tilde {w} $) for some involution σ on the alphabet. We provide …

A plane tiling by the copies of a polyomino is called isohedral if every pair of copies in the
tiling has a symmetry of the tiling that maps one copy to the other. We show that, for every n …