Pages that link to "Item:Q1603651"
From MaRDI portal
The following pages link to Reconstruction of convex 2D discrete sets in polynomial time (Q1603651):
Displaying 14 items.
- Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections (Q387855) (← links)
- Reconstruction of binary matrices under fixed size neighborhood constraints (Q952456) (← links)
- On image reconstruction algorithms for binary electromagnetic geotomography (Q952472) (← links)
- Solving nonograms by combining relaxations (Q1023434) (← links)
- Reconstruction of 8-connected but not 4-connected \(hv\)-convex discrete sets (Q1775617) (← links)
- Convex \((0, 1)\)-matrices and their epitopes (Q2022503) (← links)
- On the generation of convex polyominoes (Q2255820) (← links)
- A reconstruction algorithm for L-convex polyominoes. (Q2490808) (← links)
- Reconstruction of L-convex Polyominoes (Q3438927) (← links)
- Reconstruction of binary matrices under adjacency constraints (Q3439193) (← links)
- Reconstruction of Discrete Sets from Four Projections: Strong Decomposability (Q3439197) (← links)
- Recognizable Picture Languages and Polyominoes (Q3522865) (← links)
- DISCRETE TOMOGRAPHIC RECONSTRUCTION OF BINARY IMAGES WITH DISJOINT COMPONENTS USING SHAPE INFORMATION (Q5305548) (← links)
- Comparison of algorithms for reconstructing \(hv\)-convex discrete sets (Q5955123) (← links)
