Pages that link to "Item:Q3953196"
From MaRDI portal
The following pages link to Digital Convexity, Straightness, and Convex Polygons (Q3953196):
Displaying 11 items.
- Parallel algorithms for separation of two sets of points and recognition of digital convex polygons (Q685228) (← links)
- Lyndon + Christoffel = digitally convex (Q834259) (← links)
- Discrete sets with minimal moment of inertia (Q952455) (← links)
- Computing convexity properties of images on a pyramid computer (Q1175644) (← links)
- Digital straightness -- a review (Q1827822) (← links)
- Detection of the discrete convexity of polyominoes (Q1861555) (← 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)
- Convex digital polygons, maximal digital straight segments and convergence of discrete geometric estimators (Q2384109) (← links)
- Combinatorial View of Digital Convexity (Q5458874) (← links)
- A chronological and mathematical overview of digital circle generation algorithms – introducing efficient 4- and 8-connected circles (Q5739611) (← links)
