On the generation of 2-polyominoes

DOI10.1007/978-3-319-94631-3_9MaRDI QIDQ777992zbMATH OpenOpenAlexFDO

Authors Enrico Formenti, P. Massazza

Publication date 30 June 2020

Full work available at URL https://hal.inria.fr/hal-01905637/file/470153_1_En_9_Chapter.pdf

Mathematics Subject Classification ID

Polyominoes (05B50) Analysis of algorithms (68W40)

Recommendations

• A Dynamical System Approach to Polyominoes Generation*
• On the generation of convex polyominoes
• From Tetris to polyominoes generation
• Exhaustive generation of gominoes
• Two generalizations of column-convex polygons

Cited in

(10)

• Polyominoes defined by two vectors
• From Tetris to polyominoes generation
• Algorithms for polyominoes based on the discrete Green theorem
• Partially directed animals with a bounded number of holes
• Exhaustive generation of gominoes
• On the exhaustive generation of discrete figures with connectivity constraints
• A Dynamical System Approach to Polyominoes Generation*
• On the exhaustive generation of \(k\)-convex polyominoes
• On the generation of discrete figures with connectivity constraints
• Efficient counting of k-convex polyominoes

This page was built for publication: On the generation of 2-polyominoes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777992)