A reconstruction algorithm for L-convex polyominoes. (Q2490808): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2006.01.045
@@ Property / DOI: 10.1016/j.tcs.2006.01.045 / rank @@
-Normal rank
@@ Property / cites work @@
+Reconstructing convex polyominoes from horizontal and vertical projections
+Normal rank
@@ Property / cites work @@
+Combinatorial aspects of \(L\)-convex polyominoes
@@ Property / cites work: Combinatorial aspects of \(L\)-convex polyominoes / rank @@
+Normal rank
@@ Property / cites work @@
+Enumeration of L-convex polyominoes by rows and columns
+Normal rank
@@ Property / cites work @@
+Discrete Geometry for Computer Imagery
@@ Property / cites work: Discrete Geometry for Computer Imagery / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstruction of L-convex Polyominoes
@@ Property / cites work: Reconstruction of L-convex Polyominoes / rank @@
+Normal rank
@@ Property / cites work @@
+Machines, Computations, and Universality
@@ Property / cites work: Machines, Computations, and Universality / rank @@
+Normal rank
@@ Property / cites work @@
+The number of convex polyominoes reconstructible from their orthogonal projections
+Normal rank
@@ Property / cites work @@
+Checker Boards and Polyominoes
@@ Property / cites work: Checker Boards and Polyominoes / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstruction of convex 2D discrete sets in polynomial time
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2006.01.045
@@ Property / DOI: 10.1016/J.TCS.2006.01.045 / rank @@
+Normal rank