A reconstruction algorithm for L-convex polyominoes

Authors:
Giusi Castiglione;Antonio Restivo;Roberto Vaglica
Affiliations:
Dipartimento di Matematica e Applicazioni, Universitá degli Studi di Palermo, Palermo, Italy;Dipartimento di Matematica e Applicazioni, Universitá degli Studi di Palermo, Palermo, Italy;Dipartimento di Matematica e Applicazioni, Universitá degli Studi di Palermo, Palermo, Italy
Venue:
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Year:
2006

Reconstructing convex polyominoes from horizontal and vertical projections

Theoretical Computer Science
The number of convex polyominoes reconstructible from their orthogonal projections

Proceedings of the 6th conference on Formal power series and algebraic combinatorics
Reconstruction of convex 2D discrete sets in polynomial time

Theoretical Computer Science
Enumeration of L-convex polyominoes by rows and columns

Theoretical Computer Science
Ordering and convex polyominoes

MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
A tomographical characterization of l-convex polyominoes

DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery

Hi-index	0.00

We give an algorithm that uniquely reconstruct an L-convex polyomino from the size of some special paths, called bordered L-paths.