Optimum approximation of digital planar curves using circular arcs
Journal
Pattern Recognition
Journal Volume
29
Journal Issue
3
Pages
383-388
Date Issued
1996
Date
1996
Author(s)
Horng, Ji-Hwei
Abstract
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.
Subjects
Circular arc; Curve-fitting; Cyclic string; Dynamic programming
Other Subjects
Algorithms; Approximation theory; Calculations; Curve fitting; Digital signal processing; Dynamic programming; Errors; Mathematical models; Circular arc; Cyclic string; Pattern recognition
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
29.pdf
Size
421.08 KB
Format
Adobe PDF
Checksum
(MD5):56cf50b7bb290d99291700337d0781d8