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.
View more info for "Polygonal approximation of digital planar curve using local integral deviation"
|International Journal of Computational Vision and Robotics