Piecewise polygonal approximation of digital curves

Muhammad Sarfraz, Mohammed Asim, Asif Masood · Proceedings. Eighth International Conference on Information Visualisation, 2004. IV 2004. · 2004

In this paper, we present a recursive algorithm for piecewise polygonal approximation of a digital curves. The idea behind is to look for an optimal solution while approximating the given curve segment with a set of longest and minimum line segments such that the maximum squared error is less than the given threshold. The given curve is divided into pieces and parallel processing can be applied to each piece of curve thus making it computationally more efficient. Experimental results show that the proposed method has promising results.

Read the paper · More papers on PaperTik