Optimal polygonal approximation of digitized curves using the sum of square deviations criterion

DOI10.1016/S0031-3203(01)00051-6zbMath0993.68129WikidataQ126645180 ScholiaQ126645180MaRDI QIDQ5959614

Marc Salotti

Publication date: 14 March 2002

Published in: Pattern Recognition (Search for Journal in Brave)

zbMATH Keywords

digitized curvesgraph searchpolygonal approximation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

Unsupervised segmentation and approximation of digital curves with rate-distortion curve modeling ⋮ Data reduction of large vector graphics ⋮ Polygonal approximation of digital planar curves through break point suppression ⋮ Corner detection and curve segmentation by multiresolution chain-code linking

Cites Work

• An application of heuristic search methods to edge and contour detection
• Optimum polygonal approximation of digitized curves
• Segmentation of Plane Curves
• Unnamed Item

This page was built for publication: Optimal polygonal approximation of digitized curves using the sum of square deviations criterion