On piecewise linear approximation of planar Jordan curves

DOI10.1016/0377-0427(94)90040-XzbMath0823.65017MaRDI QIDQ1891049

Fridrich Sloboda, Josef Stoer

Publication date: 24 October 1995

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(94)90040-x

zbMATH Keywords

convergence; numerical example; polygonal approximation; piecewise linear approximation; minimum perimeter polygon; polygonal planar Jordan curves; polygonally bounded planar set; shortest polygonal path

Mathematics Subject Classification ID

65D10: Numerical smoothing, curve fitting

65D17: Computer-aided design (modeling of curves and surfaces)

Related Items

Multigrid-convergence of digital curvature estimators, Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length, Properties of Gauss digitized shapes and digital surface integration, Two linear-time algorithms for computing the minimum length polygon of a digital contour, A polygonal approximation for general 4-contours corresponding to weakly simple curves, A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects, Dynamic Minimum Length Polygon, Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour, Digital Deformable Model Simulating Active Contours

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solution Fields of Nonlinear Equations and Continuation Methods
• A Theory of Nonuniformly Digitized Binary Pictures
• On Limit Properties in Digitization Schemes
• Discrete Approximation of Continuous Convex Blobs
• Minimum-Perimeter Polygons of Digitized Silhouettes
• Measuring Concavity on a Rectangular Mosaic