Optimum approximation of digital planar curves using circular arcs

摘要

Given a digital planar curve of N ordered points, the dynamic programming algorithm is applied to find M dominant points, among the N points, which construct a globally optimal approximation to the given curve provided that a circular arc is properly designed between each pair of adjacent dominant points. This curve-fitting method is generalized to approximate closed curves. A fast algorithm for efficient computation is also introduced. The performance is shown by some experimental results.