Piecewise Polygonal Approximation of Digital Curves

Authors:
M. Sarfraz;M. R. Asim;A. Masood
Affiliations:
King Fahd University of Petroleum and Minerals, Saudi Arabia;University of Engineering and Technology, Lahore, Pakistan;University of Engineering and Technology, Lahore, Pakistan
Venue:
IV '04 Proceedings of the Information Visualisation, Eighth International Conference
Year:
2004

Citing 0
Cited 9

A novel approach to polygonal approximation of digital curves

Journal of Visual Communication and Image Representation
A randomized knot insertion algorithm for outline capture of planar images using cubic spline

Proceedings of the 2007 ACM symposium on Applied computing
Optimized polygonal approximation by dominant point deletion

Pattern Recognition
Dominant point detection by reverse polygonization of digital curves

Image and Vision Computing
Novel efficient two-pass algorithm for closed polygonal approximation based on LISE and curvature constraint criteria

Journal of Visual Communication and Image Representation
Measuring linearity of ordered point sets

PSIVT'07 Proceedings of the 2nd Pacific Rim conference on Advances in image and video technology
A discrete geometry approach for dominant point detection

Pattern Recognition
Approximation of digital circles by regular polygons

ICAPR'05 Proceedings of the Third international conference on Advances in Pattern Recognition - Volume Part I
Object coding for real time image processing applications

ICAPR'05 Proceedings of the Third international conference on Pattern Recognition and Image Analysis - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.