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 convex polyominoes
✍ Scribed by Gilles d'Andréa; Christophe Fiorio
- Book ID
- 104326635
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 599 KB
- Volume
- 218
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
✦ Synopsis
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, called a translation, such that the overlapping surface of the two polyominoes is maximal. In this paper, we present an optimal algorithm computing the overlapping surface for all possible translations. Then, we can exhibit the maximal superposition and the related translations.
📜 SIMILAR VOLUMES
We present a fairly general method for constructing classes of functions of finite scale-sensitive dimension (the scale-sensitive dimension is a generalization of the Vapnik Chervonenkis dimension to realvalued functions). The construction is as follows: start from a class F of functions of finite V
An elementary proof is given for the number of convex polyominos of perimeter 2m =t 4. ## Let +4 denote the number of nonisomo perimeter 2m + 4, m 3 2. elest and Viennot olyominos with P h+4 = (2nr + 7)2ti-4 -4(2ne -3,(ZJ.