Abstract
A simple and fast algorithm for polygonal approximation of digital curves is proposed. The algorithm is based on a greedy iterative elimination of a point with the currently minimal error value. The error criterion is defined such that the elimination of a curve point requires the update of the error associated only with its two neighbors. The use of a heap data-structure yields a worst case complexity of O(n log n). The algorithm is independent of the starting point.
Original language | English |
---|---|
Pages (from-to) | 557-563 |
Number of pages | 7 |
Journal | Pattern Recognition Letters |
Volume | 16 |
Issue number | 6 |
DOIs | |
State | Published - 1 Jan 1995 |
Keywords
- Digital curves
- Heap data structure
- Pattern recognition
- Polygonal approximation
- Shape analysis
ASJC Scopus subject areas
- Software
- Signal Processing
- Computer Vision and Pattern Recognition
- Artificial Intelligence