Pages that link to "Item:Q3740113"
From MaRDI portal
The following pages link to Polygonal approximation of planar curves in the<i>L</i><sub>1</sub>norm (Q3740113):
Displaying 10 items.
- An optimal algorithm for polygonal approximation of digitized curves (Q1331172) (← links)
- On piecewise linear approximation of planar Jordan curves (Q1891049) (← links)
- Fast algorithms for minimum matrix norm with application in computer graphics (Q1907031) (← links)
- The rate of polygonal approximation of a non-rectifiable curve and the jump problem (Q1956614) (← links)
- A Levenberg-Marquardt method for estimating polygonal regions (Q2381620) (← links)
- EIXY, a polygonal approximation algorithm. (Q2756440) (← links)
- An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves (Q2778105) (← links)
- Piece wise linear least–squares approximation of planar curves (Q3200454) (← links)
- Piecewise linear L<sub>1</sub>approximation of planar curves† (Q3719703) (← links)
- A 'taut string algorithm' for straightening a piecewise linear path in two dimensions (Q4399517) (← links)