An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves

DOI10.1016/S0167-8655(01)00098-8zbMath0993.68109OpenAlexW2090713438MaRDI QIDQ2778105

Ji-Hwei Horng, Johnny Tienyi Li

Publication date: 29 September 2002

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

Full work available at URL: https://doi.org/10.1016/s0167-8655(01)00098-8

zbMATH Keywords

dynamic programmingcurve-fitting

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

Optimized polygonal approximation by dominant point deletion ⋮ Polygonal approximation of closed discrete curves ⋮ Data reduction of large vector graphics ⋮ Polygonal approximation of digital planar curves through break point suppression ⋮ A global optimization and adaptivity-based algorithm for automated edge grid generation

This page was built for publication: An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves