Polygonal approximation by the minimax method

From MaRDI portal
Publication:3318070

DOI10.1016/0146-664X(82)90011-9zbMath0534.65096OpenAlexW2008893187MaRDI QIDQ3318070

Yoshisuke Kurozumi, Wayne A. Davis

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0146-664x(82)90011-9




Related Items (21)

Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applicationsComputational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spacesOn the complexity of some basic problems in computational convexity. I. Containment problemsSandwich approximation of univariate convex functions with an application to separable convex programmingOptimized polygonal approximation by dominant point deletionSPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACEPolygonal approximation of planar curves in theL1normPolygonal approximation of closed discrete curvesPiece wise linear least–squares approximation of planar curvesUniform partition and the best least-squares piecewise polynomial approximationAnt colony search algorithms for optimal polygonal approximation of plane curves.The equipartition of curvesThe convergence rate of the sandwich algorithm for approximating convex functionsThe afforestation problem: A heuristic method based on simulated annealingFitting rectilinear polgonal curves to a set of points in the plane.Data reduction of large vector graphicsAn efficient evolutionary algorithm for accurate polygonal approximationCIM algorithm for approximating three-dimensional polygonal curvesPOLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIAInternal model control and process uncertainty: mapping uncertainty regions for SISO controller designPiecewise linear Chebyshev approximation of planar curves




This page was built for publication: Polygonal approximation by the minimax method