Abstract
Approximation of polygonal curves can be solved by dynamic programming. These methods provide optimal solution but they are slow for a large number of vertices. We propose a new optimization approach based on dynamic programming with a reduced-search in the state space. The proposed algorithm is simple, fast, and it has low space complexity. The time and quality trade-off can be controlled by selecting appropriate corridor width and the number of iterations in the algorithm.