Pages that link to "Item:Q5578084"
From MaRDI portal
The following pages link to A note on minimal length polygonal approximation to a digitized contour (Q5578084):
Displaying 15 items.
- Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length (Q265042) (← links)
- Two linear-time algorithms for computing the minimum length polygon of a digital contour (Q765322) (← links)
- Digital straightness -- a review (Q1827822) (← links)
- What segments are the best in representing contours? (Q1979858) (← links)
- Green's function for two absorbing boundaries in the reaction-diffusion system: beyond Oster-Nishijima model in barrierless reaction (Q2116580) (← links)
- Silhouette vectorization by affine scale-space (Q2127270) (← links)
- Some aspects of the recognition of convex polyhedra from two plane projections. II (Q2561973) (← links)
- Combining Topological Maps, Multi-Label Simple Points, and Minimum-Length Polygons for Efficient Digital Partition Model (Q3003522) (← 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)
- Digital Straightness (Q4917088) (← links)
- A class of integro-differential Fokker–Planck equations with space-dependent coefficients (Q5158897) (← links)
- CIM algorithm for approximating three-dimensional polygonal curves (Q5956845) (← links)
- Computing the minimal perimeter polygon for digital objects in the triangular tiling (Q6671384) (← links)
