A direction Change-based algorithm for polygonal approximation

Han Liu; Xiangliang Zhang; Alyn Rockwood

A direction Change-based algorithm for polygonal approximation

Han Liu^*, Xiangliang Zhang, Alyn Rockwood

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

A linear-time algorithm is proposed for polygonal approximation of digital curves. The direction changes of the x- and y-coordinates are traced to generate a new, compact representation of curves. The algorithm, Direction Change-based Polygonal Approximation (DCPA), has two advantages: linear time complexity and insensitivity to parameter setting. Benchmark results demonstrate the competitive performance of DCPA using standard assessment techniques.

Original language	English (US)
Title of host publication	Proceedings of the 21st International Conference on Pattern Recognition (ICPR2012)
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
State	Published - 2012

Cite this

@inproceedings{eeed1dd3acdb4ecc9dd78a55c35b4682,

title = "A direction Change-based algorithm for polygonal approximation",

abstract = "A linear-time algorithm is proposed for polygonal approximation of digital curves. The direction changes of the x- and y-coordinates are traced to generate a new, compact representation of curves. The algorithm, Direction Change-based Polygonal Approximation (DCPA), has two advantages: linear time complexity and insensitivity to parameter setting. Benchmark results demonstrate the competitive performance of DCPA using standard assessment techniques.",

author = "Han Liu and Xiangliang Zhang and Alyn Rockwood",

note = "KAUST Repository Item: Exported on 2020-04-23",

year = "2012",

language = "English (US)",

booktitle = "Proceedings of the 21st International Conference on Pattern Recognition (ICPR2012)",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

}

TY - GEN

T1 - A direction Change-based algorithm for polygonal approximation

AU - Liu, Han

AU - Zhang, Xiangliang

AU - Rockwood, Alyn

N1 - KAUST Repository Item: Exported on 2020-04-23

PY - 2012

Y1 - 2012

N2 - A linear-time algorithm is proposed for polygonal approximation of digital curves. The direction changes of the x- and y-coordinates are traced to generate a new, compact representation of curves. The algorithm, Direction Change-based Polygonal Approximation (DCPA), has two advantages: linear time complexity and insensitivity to parameter setting. Benchmark results demonstrate the competitive performance of DCPA using standard assessment techniques.

AB - A linear-time algorithm is proposed for polygonal approximation of digital curves. The direction changes of the x- and y-coordinates are traced to generate a new, compact representation of curves. The algorithm, Direction Change-based Polygonal Approximation (DCPA), has two advantages: linear time complexity and insensitivity to parameter setting. Benchmark results demonstrate the competitive performance of DCPA using standard assessment techniques.

UR - http://hdl.handle.net/10754/656114

UR - https://ieeexplore.ieee.org/document/6460940/

M3 - Conference contribution

AN - SCOPUS:84874570307

BT - Proceedings of the 21st International Conference on Pattern Recognition (ICPR2012)

PB - Institute of Electrical and Electronics Engineers (IEEE)

ER -

A direction Change-based algorithm for polygonal approximation

Abstract

Other files and links

Cite this