Optimum approximation of digital planar curves using circular arcs

PATTERN RECOGNITION

卷:29

Article

关键词: curve-fitting;    circular arc;    dynamic programming;    cyclic string;   

DOI  :  10.1016/0031-3203(95)00104-2

来源: Elsevier

【 摘 要 】

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 are is properly designed between each pair of adjacent dominant points. This curve-fitting method is generalized to approximate dosed curves. A fast algorithm for efficient computation is also introduced. The performance is shown by some experimental results.

【 授权许可】

Free