𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Reconstruction of L-convex Polyominoes

✍ Scribed by Giusi Castiglione; Antonio Restivo

Book ID
104444371
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
147 KB
Volume
12
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ 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

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