We address the problem of finding an optimal polygonal approximation of digitized curves. Several optimal algorithms have already been proposed to determine the minimum number of points that define a polygonal approximation of the curve, with respect to a criterion error. We present a new algorithm with reasonable complexity to determine the optimal polygonal approximation using the mean square error norm. The idea is to estimate the remaining number of segments and to integrate the cost in the A* algorithm. The solution is optimal in the minimum number of segments. (C) 2001 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved. [References: 26]
展开▼
