On Polygonal Chain Approximation

Avraham Melkman; Joseph O'ROURKE

doi:10.1016/B978-0-444-70467-2.50012-6

On Polygonal Chain Approximation

Avraham Melkman
, Joseph O'ROURKE

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

80 Scopus citations

Abstract

Imai and Iri recently described a clever algorithm for approximating a polygonal chain within a given tolerance. Their algorithm requires O(n³) time in the worst case. In this note it is shown that their algorithm can be improved to O (n²logn) by exploiting the geometrical constraints of the problem.

Original language	English
Title of host publication	Machine Intelligence and Pattern Recognition
Pages	87-95
Number of pages	9
Edition	C
DOIs	https://doi.org/10.1016/B978-0-444-70467-2.50012-6
State	Published - 1 Jan 1988

Publication series

Name	Machine Intelligence and Pattern Recognition
Number	C
Volume	6
ISSN (Print)	0923-0459

ASJC Scopus subject areas

Computer Vision and Pattern Recognition
Artificial Intelligence

Access to Document

10.1016/B978-0-444-70467-2.50012-6

Cite this

@inbook{3ca83f222e4d46e6bbed0d4f2a129ea3,

title = "On Polygonal Chain Approximation",

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.",

author = "Avraham Melkman and Joseph O'ROURKE",

year = "1988",

month = jan,

day = "1",

doi = "10.1016/B978-0-444-70467-2.50012-6",

language = "English",

series = "Machine Intelligence and Pattern Recognition",

number = "C",

pages = "87--95",

booktitle = "Machine Intelligence and Pattern Recognition",

edition = "C",

}

TY - CHAP

T1 - On Polygonal Chain Approximation

AU - Melkman, Avraham

AU - O'ROURKE, Joseph

PY - 1988/1/1

Y1 - 1988/1/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85023368831

U2 - 10.1016/B978-0-444-70467-2.50012-6

DO - 10.1016/B978-0-444-70467-2.50012-6

M3 - Chapter

AN - SCOPUS:85023368831

T3 - Machine Intelligence and Pattern Recognition

SP - 87

EP - 95

BT - Machine Intelligence and Pattern Recognition

ER -

On Polygonal Chain Approximation

Abstract

Publication series

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this