Pages that link to "Item:Q1917521"

The following pages link to Generating convex polyominoes at random (Q1917521):

Displaying 16 items.

• Binary image reconstruction from a small number of projections and the morphological skeleton (Q499725) (← links)
• A framework for generating some discrete sets with disjoint components by using uniform distributions (Q952451) (← links)
• A benchmark set for the reconstruction of \(hv\)-convex discrete sets (Q967404) (← links)
• Saturated fully leafed tree-like polyforms and polycubes (Q1711661) (← links)
• Stability in discrete tomography: some positive results (Q1775620) (← links)
• Detection of the discrete convexity of polyominoes (Q1861555) (← links)
• An evolutionary algorithm for discrete tomography (Q2573237) (← links)
• Optimization and reconstruction of \(hv\)-convex (0,1)-matrices (Q2573240) (← links)
• Random generation of \(Q\)-convex sets (Q2576884) (← links)
• Using pattern matching for tiling and packing problems (Q2643924) (← links)
• Optimization and reconstruction of hv-convex (0,1)-matrices (Q3438901) (← links)
• An experimental study of the stability problem in discrete tomography (Q3438902) (← links)
• Convex polyominoes revisited: enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees (Q5132590) (← links)
• X-rays characterizing some classes of discrete sets (Q5955122) (← links)
• Comparison of algorithms for reconstructing \(hv\)-convex discrete sets (Q5955123) (← links)
• Reconstruction of 4- and 8-connected convex discrete sets from row and column projections (Q5955124) (← links)