An algorithm for polygonal approximation based on iterative point elimination

Arie Pikaz, Its'hak Dinstein

Research output: Contribution to journalArticlepeer-review

56 Scopus citations


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 languageEnglish
Pages (from-to)557-563
Number of pages7
JournalPattern Recognition Letters
Issue number6
StatePublished - 1 Jan 1995


  • 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


Dive into the research topics of 'An algorithm for polygonal approximation based on iterative point elimination'. Together they form a unique fingerprint.

Cite this