On Polygonal Chain Approximation

Avraham Melkman, Joseph O'ROURKE

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

75 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationMachine Intelligence and Pattern Recognition
Pages87-95
Number of pages9
EditionC
DOIs
StatePublished - 1 Jan 1988

Publication series

NameMachine Intelligence and Pattern Recognition
NumberC
Volume6
ISSN (Print)0923-0459

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Artificial Intelligence

Cite this