An iterative point elimination technique to retain significant vertices on digital planar curves
by Mangayarkarasi Ramaiah; Bimal Kumar Ray
International Journal of Computational Vision and Robotics (IJCVR), Vol. 6, No. 4, 2016

Abstract: This paper presents a technique that uses distance to a point as a metric to measure the collinearity to delete quasi linear points on a digital curve. The technique described here iteratively deletes points whose deviation is minimal from the line segment joining its neighbours. The results of the proposed technique are compared with recent iterative point elimination techniques. The comparative results show that the proposed technique produces the polygon by preserving the significant vertices such as sharp turning, with less approximation error.

Online publication date: Wed, 28-Sep-2016

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