\ A New Algorithm for Polygonal Approximation of Digital Planar Curves

Polygonal approximation plays an important role and has a wide application in computer vision and pattern recognition. It has therefore attracted much attention in the community. In particular, some good algorithms are put forward in recent years. A novel algorithm for polygonal approximation is presented in this paper. The proposed algorithm employs an iteration scheme until the required approximation is arrived. Firstly we set initial points through an easy rectangle method, which iteratively adds some dominant points until the required approximation is arrived, instead of using traditional Freeman chain code to extract dominant points. The performance of the proposed method is compared to that of several existing methods. time complexity of the proposed algorithm is lower.