Pages that link to "Item:Q4324590"
From MaRDI portal
The following pages link to Optimum polygonal approximation of digitized curves (Q4324590):
Displaying 25 items.
- Polygonal approximation using integer particle swarm optimization (Q506726) (← links)
- 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)
- Tangential cover for thick digital curves (Q834266) (← links)
- Polygonal approximation of closed discrete curves (Q866695) (← links)
- Unsupervised segmentation and approximation of digital curves with rate-distortion curve modeling (Q898320) (← links)
- The equipartition of curves (Q924088) (← links)
- Extraction of dominant points by estimation of the contour fluctuations (Q1601562) (← links)
- Dominant point detection based on discrete curve structure and applications (Q1747505) (← links)
- Data reduction of large vector graphics (Q1765582) (← links)
- Efficient algorithms for 3-D polygonal approximation based on LISE criterion (Q1860236) (← links)
- On the order properties of digital curves in the pan-Euclidean geometry (Q1891689) (← links)
- Optimized polygonal approximation by dominant point deletion (Q2384969) (← links)
- Polygonal approximation of digital planar curves through vertex betweenness (Q2510511) (← links)
- Corner detection and curve segmentation by multiresolution chain-code linking (Q2565834) (← links)
- Approximation of virus structure by icosahedral tilings (Q2810256) (← links)
- Polygonal approximation and scale-space analysis of closed digital curves (Q2892083) (← links)
- Approximating Polygonal Curves in Two and Three Dimensions (Q4216036) (← links)
- A non-parametric sequential method for polygonal approximation of digital curves (Q4287114) (← links)
- Digital Straightness, Circularity, and Their Applications to Image Analysis (Q4648755) (← links)
- Improving fitting quality of polygonal approximation by using the dynamic programming technique (Q4792168) (← links)
- Optimal polygonal approximation of digital planar curves using meta heuristics (Q5943305) (← links)
- An efficient evolutionary algorithm for accurate polygonal approximation (Q5953123) (← links)
- Optimal polygonal approximation of digitized curves using the sum of square deviations criterion (Q5959614) (← links)
