Authors: Mangayarkarasi Ramaiah; Bimal Kumar Ray
Addresses: School of Information Technology and Engineering, VIT University, Vellore-632014, Tamilnadu, India ' School of Information Technology and Engineering, VIT University, Vellore-632014, Tamilnadu, India
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.
Keywords: digital planar curve; dominant points; iterative point elimination; sum of squares of deviation; polygonal approximation; local integral deviation.
International Journal of Computational Vision and Robotics, 2015 Vol.5 No.3, pp.302 - 319
Received: 24 Oct 2013
Accepted: 15 May 2014
Published online: 20 Aug 2015 *