An efficient algorithm for the optimal polygonal approximation of digitized curves

Authors
Salotti, M
Citation
M. Salotti, An efficient algorithm for the optimal polygonal approximation of digitized curves, PATT REC L, 22(2), 2001, pp. 215-221
Citations number
9
Categorie Soggetti
AI Robotics and Automatic Control
Journal title
PATTERN RECOGNITION LETTERS
ISSN journal
01678655 → ACNP
Volume
22
Issue
2
Year of publication
2001
Pages
215 - 221
Database
ISI
SICI code
0167-8655(200102)22:2<215:AEAFTO>2.0.ZU;2-5
Abstract
Perez and Vidal have proposed an optimal algorithm for the polygonal approx imation of digitized curves in 1994. The complexity of their algorithm is O ((PS)-S-2), where P is the number of points and S is the number of segments . We address the same problem using the framework of heuristic search strat egies to find the shortest path in a graph and show that the complexity of our algorithm is close to O(P-2). (C) 2001 Elsevier Science B.V. All rights reserved.