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 …

This paper proposes full convexity as an alternative definition of digital convexity, which is
valid in arbitrary dimension. It solves many problems related to its usual definitions, like …

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 …

Basically, detecting convex and concave points on the boundary of an object plays an
important role in computer vision, object recognition and image understanding. In this paper …

For discrete sets coded by the Freeman chain describing their contour, several linear
algorithms have been designed for determining their shape properties. Most of them are …

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 …

The notion convexity has a long history in mathematics. It is a useful concept to describe
shapes, functions, smoothness of curves or boundaries, and it has applications in many …

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 …

Some sufficient conditions are obtained for the global exponential stability and existence of
the periodic solution to the BAM neural networks with distributed delay and impulsive on …

Dossier de candidature pour le poste de Maˆıtre de conférences Page 1 Dossier de candidature
pour le poste de Maˆıtre de conférences Xavier Provençal 4 rue Thomas 34000 Montpellier …