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

作者：Chung Kuo Liang^*; Liao Po Hsuan; Chang Jia Ming

来源：Journal of Visual Communication and Image Representation, 2008, 19(4): 219-230.

DOI：10.1016/j.jvcir.2008.01.004

• algorithm
• closed curve
• closed polygonal approximation algorithm
• curvature
• local integral square error
• shortest path algorithm

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 + mn(2))-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 (<< n(2)) 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.

• 出版日期2008-5