Polygonal approximation by the minimax method
From MaRDI portal
Publication:3318070
DOI10.1016/0146-664X(82)90011-9zbMath0534.65096MaRDI QIDQ3318070
Wayne A. Davis, Yoshisuke Kurozumi
Publication date: 1982
Published in: Computer Graphics and Image Processing (Search for Journal in Brave)
least-squares method; minimax method; cone intersection method; polygonal approximation; digitized picture; piecewise line fitting
Related Items
Internal model control and process uncertainty: mapping uncertainty regions for SISO controller design, Piecewise linear Chebyshev approximation of planar curves, SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE, POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA, Fitting rectilinear polgonal curves to a set of points in the plane., An efficient evolutionary algorithm for accurate polygonal approximation, CIM algorithm for approximating three-dimensional polygonal curves, Polygonal approximation of closed discrete curves, The convergence rate of the sandwich algorithm for approximating convex functions, The afforestation problem: A heuristic method based on simulated annealing, On the complexity of some basic problems in computational convexity. I. Containment problems, Ant colony search algorithms for optimal polygonal approximation of plane curves., Data reduction of large vector graphics, Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications, Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces, Optimized polygonal approximation by dominant point deletion, Piece wise linear least–squares approximation of planar curves, Uniform partition and the best least-squares piecewise polynomial approximation, Polygonal approximation of planar curves in theL1norm, Sandwich approximation of univariate convex functions with an application to separable convex programming
