An optimal algorithm for polygonal approximation of digitized curves
From MaRDI portal
Recommendations
- Optimal polygonal approximation of digitized curves using the sum of square deviations criterion
- An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves
- Polygonal approximation of planar curves in theL1norm
- An efficient algorithm for the optimal polygonal approximation of digitized curves
- Optimal polygonal approximation of digital planar curves using meta heuristics
Cited in
(41)- Gradient algorithms for polygonal approximation of convex contours
- INTEGER analysis of two-dimensional polygonal objects
- Fast heuristics for polygonal approximation of a 2D shape boundary
- An optimal parallel algorithm for digital curve segmentation
- Ant colony search algorithms for optimal polygonal approximation of plane curves.
- A polygonal approximation for general 4-contours corresponding to weakly simple curves
- Optimized polygonal approximation by dominant point deletion
- Polygonal approximation of digital planar curves through vertex betweenness
- A dynamic programming approach for fitting digital planar curves with line segments and circular arcs
- An efficient algorithm for the optimal polygonal approximation of digitized curves
- EIXY, a polygonal approximation algorithm.
- An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves
- Polygonal approximation and scale-space analysis of closed digital curves
- Curve fitting by segmented straight lines
- A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Fréchet Distance
- scientific article; zbMATH DE number 4018212 (Why is no real title available?)
- An improved sequential polygonal approximation algorithm on skeleton curves
- Extraction of outline feature points based on the minimum approach error
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
- Polygonal approximation of planar curves in theL1norm
- scientific article; zbMATH DE number 98536 (Why is no real title available?)
- scientific article; zbMATH DE number 1200214 (Why is no real title available?)
- scientific article; zbMATH DE number 1222818 (Why is no real title available?)
- A non-parametric sequential method for polygonal approximation of digital curves
- Optimum polygonal approximation of digitized curves
- scientific article; zbMATH DE number 2044105 (Why is no real title available?)
- scientific article; zbMATH DE number 2079747 (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?)
- Optimal Inscribed Polygons in Convex Curves
- Improving fitting quality of polygonal approximation by using the dynamic programming technique
- How good is the chord algorithm?
- Structural, Syntactic, and Statistical Pattern Recognition
- Nonlinear optimization for polygonalization.
- Optimal polygonal approximation of digital planar curves using meta heuristics
- Moment-based methods for polygonal approximation of digitized curves
- Optimal polygonal approximation of digitized curves using the sum of square deviations criterion
- Polygonal approximation of digital planar curves through break point suppression
- Two linear-time algorithms for computing the minimum length polygon of a digital contour
- Polygonal approximation of closed discrete curves
- Unsupervised segmentation and approximation of digital curves with rate-distortion curve modeling
This page was built for publication: An optimal algorithm for polygonal approximation of digitized curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1331172)
