Improving fitting quality of polygonal approximation by using the dynamic programming technique
From MaRDI portal
Publication:4792168
DOI10.1016/S0167-8655(02)00129-0zbMATH Open1010.68139OpenAlexW1990290671MaRDI QIDQ4792168FDOQ4792168
Authors: 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
Recommendations
- An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves
- An improved method for calculating the no-fit polygon
- Reduced-search dynamic programming for approximation of polygonal curves
- Optimum polygonal approximation of digitized curves
- An optimal algorithm for polygonal approximation of digitized curves
- Optimized polygonal approximation by dominant point deletion
- An efficient evolutionary algorithm for accurate polygonal approximation
- An efficient algorithm for the optimal polygonal approximation of digitized curves
- Optimal polygonal approximation of digitized curves using the sum of square deviations criterion
- scientific article; zbMATH DE number 3228720
Cited In (6)
- Speeding up simplification of polygonal curves using nested approximations
- Optimized polygonal approximation by dominant point deletion
- An adaptive method for detecting dominant points.
- An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves
- Polygonal approximation of digital planar curves through break point suppression
- Polygonal approximation of closed discrete curves
This page was built for publication: Improving fitting quality of polygonal approximation by using the dynamic programming technique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4792168)
