TY - CHAP T1 - The number of line-convex directed polyominoes having the same orthogonal projections T2 - Discrete Geometry for Computer Imagery Y1 - 2006 A1 - Péter Balázs ED - Attila Kuba ED - László Gábor Nyúl ED - Kálmán Palágyi AB -

The number of line-convex directed polyominoes with givenhorizontal and vertical projections is studied. It is proven that diagonally convex directed polyominoes are uniquely determined by their orthogonal projections. The proof of this result is algorithmical. As a counterpart, we show that ambiguity can be exponential if antidiagonal convexity is assumed about the polyomino. Then, the results are generalised to polyominoes having convexity property along arbitrary lines. © Springer-Verlag Berlin Heidelberg 2006.

JF - Discrete Geometry for Computer Imagery PB - Springer-Verlag CY - Berlin, Heidelberg N1 - UT: 000241649600007ScopusID: 33845210215 ER -