Piecewise Polygonal Approximation of Digital Curves

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by M. Sarfraz Articles by M. R. Asim Articles by A. Masood

Eighth International Conference on Information Visualisation (IV'04)

London, England

July 14-July 16

ISBN: 0-7695-2177-0

	ASCII Text	x
	M. Sarfraz, M. R. Asim, A. Masood, "Piecewise Polygonal Approximation of Digital Curves," Information Visualisation, International Conference on, pp. 991-996, Eighth International Conference on Information Visualisation (IV'04), 2004.

	BibTex	x
	@article{ 10.1109/IV.2004.1320262, author = {M. Sarfraz and M. R. Asim and A. Masood}, title = {Piecewise Polygonal Approximation of Digital Curves}, journal ={Information Visualisation, International Conference on}, volume = {0}, year = {2004}, issn = {1093-9547}, pages = {991-996}, doi = {http://doi.ieeecomputersociety.org/10.1109/IV.2004.1320262}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Information Visualisation, International Conference on TI - Piecewise Polygonal Approximation of Digital Curves SN - 1093-9547 SP991 EP996 A1 - M. Sarfraz, A1 - M. R. Asim, A1 - A. Masood, PY - 2004 KW - null VL - 0 JA - Information Visualisation, International Conference on ER -

M. Sarfraz, King Fahd University of Petroleum and Minerals, Saudi Arabia

M. R. Asim, University of Engineering and Technology, Lahore, Pakistan

A. Masood, University of Engineering and Technology, Lahore, Pakistan

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IV.2004.1320262

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.

Citation:

M. Sarfraz, M. R. Asim, A. Masood, "Piecewise Polygonal Approximation of Digital Curves," iv, pp.991-996, Eighth International Conference on Information Visualisation (IV'04), 2004

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.