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 proceedingConference contribution


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 languageEnglish (US)
Title of host publicationProceedings of the 21st International Conference on Pattern Recognition (ICPR2012)
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
StatePublished - 2012

Bibliographical note

KAUST Repository Item: Exported on 2020-04-23


Dive into the research topics of 'A direction Change-based algorithm for polygonal approximation'. Together they form a unique fingerprint.

Cite this