To study convexity properties of digital planar objects, the minimum perimeter polygon
(MPP) was defined in the 1970 s in articles by Sklansky, Chazin, Hansen, Kibler, and Kim …

A linear time combinatorial algorithm to construct the relative orthogonal convex hull of the
inner isothetic cover of a digital object (hole-free) with respect to its outer isothetic cover is …

The analysis of digital shapes requires tools to determine accurately their geometric
characteristics. Their boundary is by essence discrete and is seen by continuous geometry …

The paper proposes a polygonal approximation for closed 4-paths obtained from standard
contour following under 4-connectivity. Those 4-contours generate weakly simple polygons …

This work presents an algorithm, together with its correctness proof, to determine the
minimum perimeter polygon (MPP) for digital objects given as regular complexes in the …

From results about digital convexity, we define a reversible polygon that faithfully represents
the maximal convex and concave parts of a digital curve. Such a polygon always exists and …

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 …

We show in this paper how a digital shape can be efficiently analyzed through the maximal
segments defined along its digital contour. They are efficiently computable. They can be …

A new algorithm for the determination of the relative convex hull in the plane of a simple
polygon A with respect to another simple polygon B which contains A, is proposed. The …

The calculation of relative convex hulls is a special subject in computational geometry
(shortest paths), in image analysis (calculation of features), in robotics (shortest path of a …