On the generation of convex polyominoes

4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

A convex polyomino can be easily represented by a pair of suitable integer vectors. This lets us design a CAT (Constant Amortized Time) algorithm for generating all convex polyominoes of size n using O(n) space.

Cite

CITATION STYLE

APA

Massazza, P. (2015). On the generation of convex polyominoes. In Discrete Applied Mathematics (Vol. 183, pp. 78–89). Elsevier. https://doi.org/10.1016/j.dam.2014.02.014

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free