Improving fitting quality of polygonal approximation by using the dynamic programming technique

DOI10.1016/S0167-8655(02)00129-0zbMath1010.68139OpenAlexW1990290671MaRDI QIDQ4792168

Ji-Hwei Horng

Publication date: 11 February 2003

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

Full work available at URL: https://doi.org/10.1016/s0167-8655(02)00129-0

zbMATH Keywords

dynamic programmingcurve fittingpolygonal approximationdominant point detectionscale-spacefiltering

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (5)

Optimized polygonal approximation by dominant point deletion ⋮ Polygonal approximation of closed discrete curves ⋮ An adaptive method for detecting dominant points. ⋮ 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: Improving fitting quality of polygonal approximation by using the dynamic programming technique