Polygonal approximation of digital curve bygraduate iterative merging
K.-M. Ku, P.K. Chiu · Electronics Letters · 1995
In the Letter a graduate iterative merging algorithm for polygon approximation is described. 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.