Polygonal approximation by the minimax method
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 437533
- Approximation for minimum triangulation of convex polyhedra
- scientific article; zbMATH DE number 177850
- scientific article; zbMATH DE number 665688
- scientific article; zbMATH DE number 2080989
- scientific article; zbMATH DE number 3228720
- Polygonal approximation by boundary reduction
- Near minimax polynomial approximation
- An optimal algorithm for computing a minimum nested nonconvex polygon
Cited in
(42)- INTEGER analysis of two-dimensional polygonal objects
- 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
- Fast heuristics for polygonal approximation of a 2D shape boundary
- Ant colony search algorithms for optimal polygonal approximation of plane curves.
- Data reduction of large vector graphics
- Polygonal model fitting
- On piecewise linear approximation of planar Jordan curves
- What segments are the best in representing contours?
- A polygonal approximation for general 4-contours corresponding to weakly simple curves
- 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
- A Levenberg-Marquardt method for estimating polygonal regions
- Optimized polygonal approximation by dominant point deletion
- EIXY, a polygonal approximation algorithm.
- Dynamic minimum length polygon
- Isothetic polygon representation for contours
- scientific article; zbMATH DE number 437533 (Why is no real title available?)
- Piece wise linear least–squares approximation of planar curves
- Uniform partition and the best least-squares piecewise polynomial approximation
- Vectorization of bitmaps based of the LSQ method.
- Extraction of outline feature points based on the minimum approach error
- Polygonal approximation of planar curves in theL1norm
- Sandwich approximation of univariate convex functions with an application to separable convex programming
- Polygonal approximation by boundary reduction
- scientific article; zbMATH DE number 2044105 (Why is no real title available?)
- An optimal polygonal boundary encoding scheme in the rate distortion sense
- scientific article; zbMATH DE number 1930917 (Why is no real title available?)
- Internal model control and process uncertainty: mapping uncertainty regions for SISO controller design
- scientific article; zbMATH DE number 4000655 (Why is no real title available?)
- Piecewise linear Chebyshev approximation of planar curves
- Recovering a Polygon from Noisy Data
- SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE
- POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA
- Nonlinear optimization for polygonalization.
- 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
- Moment-based methods for polygonal approximation of digitized curves
- Polygonal approximation of closed discrete curves
- The equipartition of curves
This page was built for publication: Polygonal approximation by the minimax method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3318070)
