Detection of the Discrete Convexity of Polyominoes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Applied Mathematics Year : 2003

Detection of the Discrete Convexity of Polyominoes


The convexity of a discrete region is a property used in numerous domains of computational imagery. We study its detection in the particular case of polyominoes. We present a first method, directly relying on its definition. A second method, which is based on techniques for segmentation of curves in discrete lines, leads to a very simple, linear algorithm, whose correction is proven. Correlatively, we obtain a characterisation of lower and upper frontiers of the convex hull of a discrete line segment. Finally, we evoke some applications of these results to the problem of discrete tomography.
No file

Dates and versions

inria-00099507 , version 1 (26-09-2006)


  • HAL Id : inria-00099507 , version 1


Isabelle Debled-Rennesson, Jean-Luc Rémy, Jocelyne Rouyer-Degli. Detection of the Discrete Convexity of Polyominoes. Discrete Applied Mathematics, 2003, 125 (1), pp.115-133. ⟨inria-00099507⟩
57 View
0 Download


Gmail Facebook Twitter LinkedIn More