Abstract
The class of 2-polyominoes contains all polyominoes P such that for any integer i, the first i columns of P consist of at most 2 polyominoes. We provide a decomposition that allows us to exploit suitable discrete dynamical systems to define an algorithm for generating all 2-polyominoes of area n in constant amortized time and space O(n).
Cite
CITATION STYLE
APA
Formenti, E., & Massazza, P. (2018). On the generation of 2-polyominoes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10952 LNCS, pp. 101–113). Springer Verlag. https://doi.org/10.1007/978-3-319-94631-3_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free