Paper Info
Title
Maximal superposition of horizontally convex polyominoes
Abstract
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.
Year
DOI
Venue
1999
10.1016/S0304-3975(98)00326-0
Theor. Comput. Sci.
Keywords
DocType
Volume
Polyomino,Horizontally convex,maximal superposition,Superposition,convex polyominoes
Journal
218
Issue
ISSN
Citations 
2
Theoretical Computer Science
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Gilles d'Andréa111.11
Christophe Fiorio219723.27