Polygonal approximation of closed contours

DOI10.1007/3-540-45103-X_103MaRDI QIDQ4448166zbMATH OpenFDO

Authors Alexander V. Kolesnikov, Pasi Fränti

Publication date 17 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2749/27490778.htm

Mathematics Subject Classification ID

Machine vision and scene understanding (68T45) Computing methodologies and applications (68U99)

Recommendations

• Polygonal approximation of closed discrete curves
• An optimal algorithm for polygonal approximation of digitized curves
• Approximation of a closed polygon with a minimum number of circular arcs and line segments
• Polygonal approximation by the minimax method
• Optimal polygonal approximation of digitized curves using the sum of square deviations criterion

Cited in

(9)

• Gradient algorithms for polygonal approximation of convex contours
• Data reduction of large vector graphics
• Approximation of a closed polygon with a minimum number of circular arcs and line segments
• What segments are the best in representing contours?
• A polygonal approximation for general 4-contours corresponding to weakly simple curves
• Closing gaps of discontinuous lines: A new criterion for choosing the best prolongation
• Enclosing a polygonal cavity in a two-dimensional bounded domain from Cauchy data
• Evaluation and prediction of polygon approximations of planar contours for shape analysis
• Polygonal approximation of closed discrete curves

This page was built for publication: Polygonal approximation of closed contours

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