By Topic

Polygonal approximation of digital curve by graduate iterative merging

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
K. -M. Ku ; Dept. of Electron. Eng., Hong Kong Polytech., Kowloon, Hong Kong ; P. K. Chui

The authors present a graduate iterative merging algorithm for polygon approximation. The algorithm always gives a minimum area difference between the curve and the polygon with the minimum number of breakpoints. Realisation of the algorithm is compared with other algorithms as tested on good and noisy images and the performance is very close to that of a human viewer

Published in:

Electronics Letters  (Volume:31 ,  Issue: 6 )