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|