Polygonal Approximation of Closed Contours
Optimal approximation of closed curves differs from the case of open curve in the sense that the location of the starting point must also be determined. Straightforward exhaustive search would take N times more time than the corresponding algorithm for open curve. We propose to approximate a cyclically extended contour of double size, and to select the best possible starting point by analyzing the state space. This takes only twice of the time required by the algorithm for open curve.
KeywordsState Space Open Curve Goal State Dynamic Programming Algorithm Closed Curf
- 2.Chen, D.Z., Daescu, O.: Space efficient algorithm for polygonal curves in two dimensional space, Proc. 4th Int. Conf. Computing and Combinatorics. (1998) 55–64.Google Scholar
- 6.Kolesnikov, A., Fränti, P.: A fast near-optimal algorithm for approximation of polygonal curves. Proc. Int. Conf. Pattern Recognition-ICPR’02. 4 (2002) 335–338.Google Scholar
- 7.Kolesnikov, A., Fränti, P.: Reduced search dynamic programming for approximation of polygonal curves. Pattern Recognition Letters. 2003. (in press)Google Scholar
- 15.Schroeder, K., Laurent, P.: Efficient polygon approximations for shape signatures. Proc. Int. Conf. Image Processing-ICIP’99. 2 (1999) 811–814.Google Scholar