Speeding up simplification of polygonal curves using nested approximations

DOI10.1007/s10044-008-0133-yzbMath1422.68252arXiv0709.1941OpenAlexW3104580753MaRDI QIDQ710621

G. Ménier, Pierre-François Marteau

Publication date: 19 October 2010

Published in: PAA. Pattern Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0709.1941

zbMATH Keywords

dynamic programmingmultiresolutionpolygonal approximation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items

Adaptive Down-Sampling and Dimension Reduction in Time Elastic Kernel Machines for Efficient Recognition of Isolated Gestures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient algorithm for the optimal polygonal approximation of digitized curves
• Segmentation of Discrete Curves into Fuzzy Segments
• Dynamic programming algorithm optimization for spoken word recognition
• Optimum polygonal approximation of digitized curves
• Reduced-search dynamic programming for approximation of polygonal curves
• Improving fitting quality of polygonal approximation by using the dynamic programming technique
• APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR