Skip to Main content Skip to Navigation
Conference papers

Optimal Partial Tiling of Manhattan Polyominoes

Olivier Bodini 1 Jérémie Lumbroso 1
1 APR - Algorithmes, Programmes et Résolution
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : 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.
Complete list of metadata
Contributor : Olivier Bodini Connect in order to contact the contributor
Submitted on : Saturday, November 14, 2009 - 9:30:31 PM
Last modification on : Friday, January 8, 2021 - 5:32:06 PM
Long-term archiving on: : Thursday, June 17, 2010 - 8:22:10 PM


Files produced by the author(s)



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⟩



Les métriques sont temporairement indisponibles