Faithful polygonal representation of the convex and concave parts of a digital curve

Tristan Roussillon (1) , Isabelle Sivignon (2)

1 M2DisCo - Geometry Processing and Constrained Optimization
2 GIPSA-AGPIG - GIPSA - Architecture, Géométrie, Perception, Images, Gestes

From results about digital convexity, we define a reversible polygon that faith- fully represents the maximal convex and concave parts of a digital curve. Such a polygon always exists and is unique in the general case. It is computed from a given digital curve in linear-time using well-known routines: adding a point at the front of a digital straight segment and removing a point from the back of a digital straight segment. It may helps to extract perceptually meaningful parts of shape outlines or lines.

Domaines: Traitement des images [eess.IV]

Tristan Roussillon, Isabelle Sivignon. Faithful polygonal representation of the convex and concave parts of a digital curve. Pattern Recognition, 2011, 44 (10-11), pp.2693-2700. ⟨10.1016/j.patcog.2011.03.018⟩. ⟨hal-00643573⟩