Polygonal approximation of digital planar curve using local integral deviation
by Mangayarkarasi Ramaiah; Bimal Kumar Ray
International Journal of Computational Vision and Robotics (IJCVR), Vol. 5, No. 3, 2015

Abstract: An algorithm for polygonal approximation based on local integral deviation is presented. The algorithm is tested on various shapes with varying number of dominant points. A comparative study of the proposed procedure with other iterative methods shows that the proposed procedure produces polygon from a digital curve approximating high as well as low curvature regions with almost equal precision.

Online publication date: Fri, 21-Aug-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Vision and Robotics (IJCVR):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com