Reduced-search dynamic programming for approximation of polygonal curves

DOI10.1016/S0167-8655(03)00051-5zbMath1035.68123OpenAlexW2076627497MaRDI QIDQ4418143

Pasi Fränti, Alexander V. Kolesnikov

Publication date: 7 August 2003

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

Full work available at URL: https://doi.org/10.1016/s0167-8655(03)00051-5

zbMATH Keywords

Dynamic programmingPolygonal approximationVectorizationData reduction

Mathematics Subject Classification ID

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 ⋮ Dominant point detection based on discrete curve structure and applications ⋮ Data reduction of large vector graphics ⋮ Speeding up simplification of polygonal curves using nested approximations

This page was built for publication: Reduced-search dynamic programming for approximation of polygonal curves