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

@article{Chung2008NovelET,
  title={Novel efficient two-pass algorithm for closed polygonal approximation based on LISE and curvature constraint criteria},
  author={Kuo-Liang Chung and Po-Hsuan Liao and Jia-Ming Chang},
  journal={J. Visual Communication and Image Representation},
  year={2008},
  volume={19},
  pages={219-230}
}
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)-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) denotes the number of feasible approximate segments. Based on some real closed curves, experimental results demonstrate… CONTINUE READING