Pages that link to "Item:Q3648777"
From MaRDI portal
The following pages link to Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour (Q3648777):
Displaying 10 items.
- Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length (Q265042) (← links)
- A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\) (Q638566) (← links)
- Two linear-time algorithms for computing the minimum length polygon of a digital contour (Q765322) (← links)
- Digital straight segment filter for geometric description (Q2061807) (← 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)
- Faithful polygonal representation of the convex and concave parts of a digital curve (Q2276012) (← 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)
- Computing the minimal perimeter polygon for digital objects in the triangular tiling (Q6671384) (← links)
