An efficient algorithm for the optimal polygonal approximation of digitized curves

DOI10.1016/S0167-8655(00)00088-XzbMath0977.68090OpenAlexW1983579396WikidataQ127293972 ScholiaQ127293972MaRDI QIDQ2718469

Marc Salotti

Publication date: 19 June 2001

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

Full work available at URL: https://doi.org/10.1016/s0167-8655(00)00088-x

zbMATH Keywords

polygonal approximation of digitized curves

Mathematics Subject Classification ID

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

Related Items (7)

Some algorithms under non-parametric framework versus an unsupervised approach ⋮ Polygonal approximation of closed discrete curves ⋮ Unsupervised segmentation and approximation of digital curves with rate-distortion curve modeling ⋮ Radial symmetries based decomposition of cell clusters in binary and gray level images ⋮ Data reduction of large vector graphics ⋮ Speeding up simplification of polygonal curves using nested approximations ⋮ Polygonal approximation of digital planar curves through break point suppression

This page was built for publication: An efficient algorithm for the optimal polygonal approximation of digitized curves