Pages that link to "Item:Q490307"
From MaRDI portal
The following pages link to On computing the degree of convexity of polyominoes (Q490307):
Displaying 7 items.
- Code for polyomino and computer search of isospectral polyominoes (Q512885) (← links)
- On the exhaustive generation of \(k\)-convex polyominoes (Q517034) (← links)
- Detection of the discrete convexity of polyominoes (Q1861555) (← links)
- Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses (Q2422035) (← links)
- Computing deviations from convexity in polygons (Q4274674) (← links)
- Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings (Q5234537) (← links)
- Discrete Geometry for Computer Imagery (Q5902448) (← links)