Pages that link to "Item:Q765322"
From MaRDI portal
The following pages link to Two linear-time algorithms for computing the minimum length polygon of a digital contour (Q765322):
Displaying 6 items.
- A polygonal approximation for general 4-contours corresponding to weakly simple curves (Q2127283) (← links)
- Euclidean farthest-point Voronoi diagram of a digital edge (Q2255824) (← links)
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour (Q3648777) (← links)
- Discrete Geometry for Computer Imagery (Q5316525) (← links)
- Combinatorial Image Analysis (Q5465754) (← links)
- Computing the minimal perimeter polygon for digital objects in the triangular tiling (Q6671384) (← links)