Pages that link to "Item:Q2718469"
From MaRDI portal
The following pages link to An efficient algorithm for the optimal polygonal approximation of digitized curves (Q2718469):
Displaying 7 items.
- Speeding up simplification of polygonal curves using nested approximations (Q710621) (← links)
- Polygonal approximation of digital planar curves through break point suppression (Q733122) (← 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)
- Data reduction of large vector graphics (Q1765582) (← links)
- Radial symmetries based decomposition of cell clusters in binary and gray level images (Q2476949) (← links)
