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 21 items.
- Speeding up simplification of polygonal curves using nested approximations (Q710621) (← links)
- 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)
- An optimal parallel algorithm for digital curve segmentation (Q1391535) (← links)
- Data reduction of large vector graphics (Q1765582) (← links)
- Algorithm for circle approximation and generation (Q1803695) (← links)
- Radial symmetries based decomposition of cell clusters in binary and gray level images (Q2476949) (← links)
- Polygonal approximation of digital planar curves through vertex betweenness (Q2510511) (← 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)
- (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)
