Optimum polygonal approximation of digitized curves

DOI10.1016/0167-8655(94)90002-7MaRDI QIDQ4324590zbMATH OpenOpenAlexFDO

Authors Juan-Carlos Perez, Enrique Vidal

Publication date 15 August 1995

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

Full work available at URL https://doi.org/10.1016/0167-8655(94)90002-7

zbMATH Keywords

pattern recognitionmultiresolution methodscurve approximation/digitizationglobally optimal polygonal approximationlinearly ordered set of points

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Computing methodologies for image processing (68U10) Computer-aided design (modeling of curves and surfaces) (65D17)

Recommendations

• An efficient algorithm for the optimal polygonal approximation of digitized curves
• Polygonal approximation of planar curves in theL₁norm
• An optimal algorithm for polygonal approximation of digitized curves
• Optimal polygonal approximation of digitized curves using the sum of square deviations criterion
• scientific article; zbMATH DE number 4018212

Cited in

(27)

• Approximating Polygonal Curves in Two and Three Dimensions
• Some algorithms under non-parametric framework versus an unsupervised approach
• A non-parametric sequential method for polygonal approximation of digital curves
• Improving fitting quality of polygonal approximation by using the dynamic programming technique
• Tangential cover for thick digital curves
• Algorithm for circle approximation and generation
• Dominant point detection based on discrete curve structure and applications
• Speeding up simplification of polygonal curves using nested approximations
• Digital straightness, circularity, and their applications to image analysis
• On the order properties of digital curves in the pan-Euclidean geometry
• Optimized polygonal approximation by dominant point deletion
• Polygonal approximation of digital planar curves through vertex betweenness
• Optimal polygonal approximation of digitized curves using the sum of square deviations criterion
• Data reduction of large vector graphics
• Polygonal approximation and scale-space analysis of closed digital curves
• Approximation of virus structure by icosahedral tilings
• Extraction of dominant points by estimation of the contour fluctuations
• Unsupervised segmentation and approximation of digital curves with rate-distortion curve modeling
• An efficient algorithm for the optimal polygonal approximation of digitized curves
• The equipartition of curves
• Corner detection and curve segmentation by multiresolution chain-code linking
• Polygonal approximation using integer particle swarm optimization
• Polygonal approximation of digital planar curves through break point suppression
• Polygonal approximation of closed discrete curves
• Efficient algorithms for 3-D polygonal approximation based on LISE criterion
• Optimal polygonal approximation of digital planar curves using meta heuristics
• An efficient evolutionary algorithm for accurate polygonal approximation

This page was built for publication: Optimum polygonal approximation of digitized curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4324590)