𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the generation of convex polyominoes

✍ Scribed by Massazza, Paolo (author)

Book ID
122170431
Publisher
Elsevier B.V.
Year
2015
Tongue
English
Weight
409 KB
Volume
183
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Generating convex polyominoes at random
Generating convex polyominoes at random
✍ Winfried HochstΓ€ttler; Martin Loebl; Christoph Moll πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 517 KB

We give a new recursion formula for the number of convex polyominoes with fixed perimeter. From this we derive a bijection between an interval of natural numbers and the polyominoes of given perimeter. This provides a possibility to generate such polyominoes at random in polynomial time. Our method

Reconstruction of L-convex Polyominoes
Reconstruction of L-convex Polyominoes
✍ Giusi Castiglione; Antonio Restivo πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 147 KB

We introduce the family of L-convex polyominoes, a subset of convex polyominoes whose elements satisfy a special convexity property. We develop an algorithm that reconstructs an L-convex polyomino from the set of its maximal L-polyominoes.

Maximal superpositions of horizontally c
Maximal superpositions of horizontally convex polyominoes
✍ Gilles d'AndrΓ©a; Christophe Fiorio πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 599 KB

Horizontally convex polyominoes are finite discrete sets of simply connected elementary cells, such that all of their rows are connected. The problem is to find the best matching between two horizontally convex polyominoes. So, we look for a position of the second polyomino relative to the first one