By Topic

A fast near-optimal algorithm for approximation of polygonal curves

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kolesnikov, A. ; Dept. of Comput. Sci., Joensuu Univ., Finland ; Franti, P.

Approximation of polygonal curves can be solved by dynamic programming. These methods provide an optimal solution but 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 has low space complexity. The time and quality trade-off can be controlled by selecting an appropriate corridor width and number of iterations in the algorithm.

Published in:

Pattern Recognition, 2002. Proceedings. 16th International Conference on  (Volume:4 )

Date of Conference: