OPTIMUM APPROXIMATION OF DIGITAL PLANAR CURVES USING CIRCULAR ARCS

Authors
PEI SC HORNG JH
Citation
Sc. Pei et Jh. Horng, OPTIMUM APPROXIMATION OF DIGITAL PLANAR CURVES USING CIRCULAR ARCS, Pattern recognition, 29(3), 1996, pp. 383-388
Citations number
11
Categorie Soggetti
Computer Sciences, Special Topics","Engineering, Eletrical & Electronic","Computer Science Artificial Intelligence
Journal title
Pattern recognition → ACNP
ISSN journal
00313203
Volume
29
Issue
3
Year of publication
1996
Pages
383 - 388
Database
ISI
SICI code
0031-3203(1996)29:3<383:OAODPC>2.0.ZU;2-N
Abstract
Given a digital planar curve of N ordered points, the dynamic programm ing 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 resu lts.