ECO method and the exhaustive generation of convex polyominoes

Authors:
Alberto Del Lungo;Andrea Frosini;Simone Rinaldi
Affiliations:
Dipartimento di Scienze Matematiche ed Informatiche, Siena, Italy;Dipartimento di Scienze Matematiche ed Informatiche, Siena, Italy;Dipartimento di Scienze Matematiche ed Informatiche, Siena, Italy
Venue:
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Year:
2003

Citing 4
Cited 1

Tiling with Polyominoes and Combinatorial Group Theory

Journal of Combinatorial Theory Series A
Generating convex polyominoes at random

FPSAC '93 Proceedings of the 5th conference on Formal power series and algebraic combinatorics
Reconstructing convex polyominoes from horizontal and vertical projections

Theoretical Computer Science
Random generation of trees and other combinatorial objects

Theoretical Computer Science - Special issue on Caen '97

Efficient iteration in admissible combinatorial classes

Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)

Quantified Score

Hi-index	0.00

Visualization

Abstract

ECO is a method for the enumeration of classes of combinatorial objects based on recursive constructions of such classes. In this paper we use the ECO method and the concept of succession rule to develop an algorithm for the exhaustive generation of convex polyominoes. Then we prove that this algorithm runs in constant amortized time.