Pages that link to "Item:Q2778105"
From MaRDI portal
The following pages link to An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves (Q2778105):
Displaying 18 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)
- Some algorithms under non-parametric framework versus an unsupervised approach (Q826309) (← links)
- Polygonal approximation of closed discrete curves (Q866695) (← links)
- Unsupervised segmentation and approximation of digital curves with rate-distortion curve modeling (Q898320) (← links)
- An optimal algorithm for polygonal approximation of digitized curves (Q1331172) (← links)
- Fast heuristics for polygonal approximation of a 2D shape boundary (Q1391115) (← links)
- Data reduction of large vector graphics (Q1765582) (← links)
- A global optimization and adaptivity-based algorithm for automated edge grid generation (Q2090704) (← 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)
- 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)
- (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)
