Pages that link to "Item:Q4287114"
From MaRDI portal
The following pages link to A non-parametric sequential method for polygonal approximation of digital curves (Q4287114):
Displaying 9 items.
- 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)
- Data reduction of large vector graphics (Q1765582) (← links)
- Efficient algorithms for 3-D polygonal approximation based on LISE criterion (Q1860236) (← links)
- Faithful polygonal representation of the convex and concave parts of a digital curve (Q2276012) (← links)
- A Levenberg-Marquardt method for estimating polygonal regions (Q2381620) (← links)
- An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves (Q2778105) (← links)
- Moment-based methods for polygonal approximation of digitized curves (Q5959613) (← links)