A data reduction algorithm for planar curves

DOI10.1016/0734-189X(85)90117-3zbMATH Open0622.68088OpenAlexW2057315536MaRDI QIDQ3759978FDOQ3759978

James Robergé

Publication date: 1985

Published in: Computer Vision, Graphics, and Image Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0734-189x(85)90117-3

Recommendations

• Data reduction of polygonal curves using B-splines.
• scientific article; zbMATH DE number 1070447
• Data reduction of large vector graphics
• scientific article; zbMATH DE number 1066208
• An efficient algorithm for the optimal polygonal approximation of digitized curves

zbMATH Keywords

computer graphicsplanar curvenumber of line segments used to represent a curve

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25)

Cited In (8)

• Title not available (Why is that?)
• Moment-based methods for polygonal approximation of digitized curves
• Title not available (Why is that?)
• New approach for automated inspection and feedback control systems
• A data reduction scheme for triangulated surfaces
• Data reduction of polygonal curves using B-splines.
• Numerical methods for approximating digitized curves by piecewise circular arcs
• A method for vertex recognition in an automated vision system

This page was built for publication: A data reduction algorithm for planar curves

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