From linear partitions to parallelogram polyominoes

Authors:
Roberto Mantaci;Paolo Massazza
Affiliations:
LIAFA, CNRS, UMR, Université Paris Diderot-Paris 7, Paris Cedex 13, France;Università degli Studi dell'Insubria, Dipartimento di Informatica e Comunicazione, Varese, Italy
Venue:
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Year:
2011

Citing 6
Cited 1

A method for the enumeration of various classes of column-convex polygons

Discrete Mathematics
Reconstructing convex polyominoes from horizontal and vertical projections

Theoretical Computer Science
Parallelogram polyominoes and corners

Journal of Symbolic Computation - Special issue on symbolic computation in combinatorics
Reconstruction of convex 2D discrete sets in polynomial time

Theoretical Computer Science
Tiling the Plane with a Fixed Number of Polyominoes

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Recognizable picture languages and polyominoes

CAI'07 Proceedings of the 2nd international conference on Algebraic informatics

On the exhaustive generation of plane partitions

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide a bijection between parallelogram polyominoes and suitable pairs of linear partitions. This lets us design a CAT (Constant Amortized Time) algorithm for generating all parallelogram poly-ominoes of size n using O(√n) space.