Prof. Avraham Melkman
Know all about my research
On Polygonal Chain Approximation
Imai and Iri recently described a clever algorithm for approximating a polygonal chain within a given tolerance. Their algorithm requires O(n3) time in the worst case. In this note it is shown that their algorithm can be improved to O (n2logn) by exploiting the geometrical constraints of the problem.
| Publication language | English |
| Pages | 87-95 |
| Publication status | Published - 01.01.1988 |
ASJC Scopus subject areas
Computer Vision and Pattern Recognition
Artificial Intelligence
