Pages that link to "Item:Q1891049"
From MaRDI portal
The following pages link to On piecewise linear approximation of planar Jordan curves (Q1891049):
Displaying 9 items.
- Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length (Q265042) (← links)
- Properties of Gauss digitized shapes and digital surface integration (Q279100) (← links)
- Two linear-time algorithms for computing the minimum length polygon of a digital contour (Q765322) (← links)
- A polygonal approximation for general 4-contours corresponding to weakly simple curves (Q2127283) (← links)
- A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects (Q2210520) (← links)
- Dynamic Minimum Length Polygon (Q3003536) (← links)
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour (Q3648777) (← links)
- Digital Deformable Model Simulating Active Contours (Q3648785) (← links)
- Multigrid-convergence of digital curvature estimators (Q4682467) (← links)
