Optimal polygonal approximation of digital curves

Arie Pikaz, Its'hak Dinstein

Research output: Contribution to journalArticlepeer-review

51 Scopus citations


An algorithm for optimal polygonal approximation is presented. Given a value for the maximal allowed distance between the approximation and the curve, the algorithm finds an approximation with the minimal number of vertices. The city-block metric is used to measure the distance between the approximation and the curve. The algorithm worst case complexity is O(n2), where n is the number of points in the curve. An efficient and optimal solution for the case of closed curves where no initial point is given, is also presented.

Original languageEnglish
Pages (from-to)373-379
Number of pages7
JournalPattern Recognition
Issue number3
StatePublished - 1 Jan 1995


  • Breadth-first-search
  • City-block metric
  • Optimal polygonal approximation

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence

Cite this