Optimal Partial Tiling of Manhattan Polyominoes

Olivier Bodini (1) , Jérémie Lumbroso (1)

1 APR - Algorithmes, Programmes et Résolution

Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we give an algorithm linear in the number of columns. Some techniques are borrowed from traditional graph optimisation problems.

Mots clés: domino; tiling; flow networks

Domaines: Mathématique discrète [cs.DM]; Combinatoire [math.CO]; Algorithme et structure de données [cs.DS]

Olivier Bodini, Jérémie Lumbroso. Optimal Partial Tiling of Manhattan Polyominoes. DGCI 2009 - 15th IAPR International Conference on Discrete Geometry for Computer Imagery, Sep 2009, Montreal, Canada. pp.79-91, ⟨10.1007/978-3-642-04397-0_8⟩. ⟨hal-00432217⟩