Pages that link to "Item:Q1861555"
From MaRDI portal
The following pages link to Detection of the discrete convexity of polyominoes (Q1861555):
Displaying 10 items.
- On computing the degree of convexity of polyominoes (Q490307) (← links)
- A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\) (Q638566) (← links)
- Lyndon + Christoffel = digitally convex (Q834259) (← links)
- Geometric preservation of 2D digital objects under rigid motions (Q1722617) (← links)
- Efficiently testing digital convexity and recognizing digital convex polygons (Q2203347) (← links)
- Faithful polygonal representation of the convex and concave parts of a digital curve (Q2276012) (← links)
- A Linear Time and Space Algorithm for Detecting Path Intersection (Q3648803) (← links)
- Efficient Algorithms to Test Digital Convexity (Q5237086) (← links)
- Combinatorial View of Digital Convexity (Q5458874) (← links)
- Convexity preserving deformations of digital sets: characterization of removable and insertable pixels (Q6069173) (← links)
