Pages that link to "Item:Q5316518"
From MaRDI portal
The following pages link to Discrete Geometry for Computer Imagery (Q5316518):
Displaying 14 items.
- Reconstruction of convex polyominoes with a blocking component (Q265062) (← links)
- On computing the degree of convexity of polyominoes (Q490307) (← links)
- On the exhaustive generation of \(k\)-convex polyominoes (Q517034) (← links)
- On the tiling system recognizability of various classes of convex polyominoes (Q659791) (← links)
- Algorithms for linear time reconstruction by discrete tomography (Q2009015) (← links)
- The number of directed \(k\)-convex polyominoes (Q2286592) (← links)
- Combinatorial aspects of \(L\)-convex polyominoes (Q2372433) (← links)
- Discrete tomography for inscribable lattice sets (Q2446839) (← links)
- The number of Z-convex polyominoes (Q2474263) (← links)
- A reconstruction algorithm for L-convex polyominoes. (Q2490808) (← links)
- Enumeration of L-convex polyominoes by rows and columns (Q2576881) (← links)
- Permutation classes and polyomino classes with excluded submatrices (Q2971061) (← links)
- Reconstruction of Discrete Sets from Four Projections: Strong Decomposability (Q3439197) (← links)
- Recognizable Picture Languages and Polyominoes (Q3522865) (← links)
