Polygonal approximation of planar curves in theL1norm

DOI10.1080/00207728608926910MaRDI QIDQ3740113zbMATH OpenOpenAlexFDO

Authors Nabih N. Abdelmalek

Publication date 1986

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207728608926910

zbMATH Keywords

error normlinear programmingNumerical resultsplane curvepolygonal approximation

Mathematics Subject Classification ID

Curves in Euclidean and related spaces (53A04) Numerical smoothing, curve fitting (65D10)

Recommendations

• Piecewise linear L₁approximation of planar curves†
• An optimal algorithm for polygonal approximation of digitized curves
• scientific article; zbMATH DE number 4074316
• Polygonal approximation by the minimax method
• An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves

Cites work

• A Geometric Method for Approximating Convex Arcs
• An efficient algorithm for determining the convex hull of a finite planar set
• scientific article; zbMATH DE number 3186062 (Why is no real title available?)
• Norms for Smoothing and Estimation
• On the discrete linear L\(_1\) approximation and L\(_1\) solutions of overdetermined linear equations
• Polygonal approximation by the minimax method
• The Use of Algorithms of Piecewise Approximations for Picture Processing Applications
• Two Algorithms for Piecewise-Linear Continuous Approximation of Functions of One Variable

Cited in

(18)

• An optimal algorithm for polygonal approximation of digitized curves
• On piecewise linear approximation of planar Jordan curves
• Fast algorithms for minimum matrix norm with application in computer graphics
• The rate of polygonal approximation of a non-rectifiable curve and the jump problem
• A Levenberg-Marquardt method for estimating polygonal regions
• EIXY, a polygonal approximation algorithm.
• An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves
• Curve fitting by segmented straight lines
• Piece wise linear least–squares approximation of planar curves
• Extraction of outline feature points based on the minimum approach error
• Piecewise linear L₁approximation of planar curves†
• scientific article; zbMATH DE number 4074316 (Why is no real title available?)
• scientific article; zbMATH DE number 1241781 (Why is no real title available?)
• Optimum polygonal approximation of digitized curves
• Fast Polynomial Segmentation of Digitized Curves
• Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths
• Fitting rectilinear polgonal curves to a set of points in the plane.
• Optimal polygonal approximation of digitized curves using the sum of square deviations criterion

This page was built for publication: Polygonal approximation of planar curves in theL₁norm

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