Pages that link to "Item:Q1331172"
From MaRDI portal
The following pages link to An optimal algorithm for polygonal approximation of digitized curves (Q1331172):
Displaying 27 items.
- Polygonal approximation of digital planar curves through break point suppression (Q733122) (← links)
- Two linear-time algorithms for computing the minimum length polygon of a digital contour (Q765322) (← links)
- Polygonal approximation of closed discrete curves (Q866695) (← links)
- Unsupervised segmentation and approximation of digital curves with rate-distortion curve modeling (Q898320) (← links)
- Gradient algorithms for polygonal approximation of convex contours (Q1012881) (← links)
- INTEGER analysis of two-dimensional polygonal objects (Q1123031) (← links)
- Fast heuristics for polygonal approximation of a 2D shape boundary (Q1391115) (← links)
- An optimal parallel algorithm for digital curve segmentation (Q1391535) (← links)
- Ant colony search algorithms for optimal polygonal approximation of plane curves. (Q1403765) (← links)
- Optimized polygonal approximation by dominant point deletion (Q2384969) (← links)
- Polygonal approximation of digital planar curves through vertex betweenness (Q2510511) (← links)
- A dynamic programming approach for fitting digital planar curves with line segments and circular arcs (Q2718467) (← links)
- An efficient algorithm for the optimal polygonal approximation of digitized curves (Q2718469) (← links)
- EIXY, a polygonal approximation algorithm. (Q2756440) (← links)
- An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves (Q2778105) (← links)
- Polygonal approximation and scale-space analysis of closed digital curves (Q2892083) (← links)
- A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Fréchet Distance (Q3000715) (← links)
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour (Q3648777) (← links)
- Polygonal approximation of planar curves in the<i>L</i><sub>1</sub>norm (Q3740113) (← links)
- (Q4022672) (← links)
- (Q4211494) (← links)
- (Q4218406) (← links)
- A non-parametric sequential method for polygonal approximation of digital curves (Q4287114) (← links)
- Improving fitting quality of polygonal approximation by using the dynamic programming technique (Q4792168) (← links)
- Structural, Syntactic, and Statistical Pattern Recognition (Q5466365) (← links)
- Discrete Geometry for Computer Imagery (Q5902464) (← links)
- Moment-based methods for polygonal approximation of digitized curves (Q5959613) (← links)
