Optimal partial tiling of Manhattan polyominoes

Authors:
Olivier Bodini;Jérémie Lumbroso
Affiliations:
LIP6, UMR, CALSCI department, Université Paris 6, Paris cedex 05, France;LIP6, UMR, CALSCI department, Université Paris 6, Paris cedex 05, France
Venue:
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Year:
2009

Citing 9
Cited 0

Faster scaling algorithms for network problems

SIAM Journal on Computing
Tiling with Polyominoes and Combinatorial Group Theory

Journal of Combinatorial Theory Series A
Conway's tiling groups

American Mathematical Monthly
A note on tiling with integer-sided rectangles

Journal of Combinatorial Theory Series A
Domino tilings on planar regions

Journal of Combinatorial Theory Series A
Tiling pictures of the plane with dominoes

Proceedings of an international symposium on Graphs and combinatorics
An O(n log n)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded

Theoretical Computer Science - Special issue: Tilings of the plane
The lattice structure of the set of domino tilings of a polygon

Theoretical Computer Science - Discrete applied problems, florilegium for E. Goles
Planar dimer tilings

CSR'06 Proceedings of the First international computer science conference on Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

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.