By Topic

Piecewise polygonal approximation of digital curves

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 $13
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

3 Author(s)
Sarfraz, M. ; Dept. of Inf. & Comput., King Fahd Univ. of Pet. & Minerals, Dhahran, Saudi Arabia ; Asim, M.R. ; Masood, A.

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.

Published in:

Information Visualisation, 2004. IV 2004. Proceedings. Eighth International Conference on

Date of Conference:

14-16 July 2004