A Dynamic Programming approach for segmenting digital planar curves into line segments and circular arcs

We present a method for segmenting a planar digital curve into line segments and circular arcs. It is based on Dynamic Programming and works in a transformed domain which makes the approximation process simpler and independent from the particular geometrical primitive considered. Experiments performed on some shapes conjirm the effectiveness oj the approach.