Novel efficient two-pass algorithm for closed polygonal approximation based on LISE and curvature constraint criteria

Given a closed curve with n points, based on the local integral square error and the curvature constraint criteria, this paper presents a novel two-pass O(Fn + mn2)-time algorithm for solving the closed polygonal approximation problem where m(≪n) denotes the minimal number of covering feasible segments for one point and empirically the value of m is rather small, and F (≪n2) denotes the number of feasible approximate segments. Based on some real closed curves, experimental results demonstrate that under the same number of segments used, our proposed two-pass algorithm has better quality and execution-time performance when compared to the previous algorithm by Chung et al. Experimental results also demonstrate that under the same number of segments used, our proposed two-pass algorithm has better quality, but has some execution-time degradation when compared to the currently published algorithms by Wu and Sarfraz et al.