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.
Supported by ANR contract GAMMA, “Génération Aléatoire Modèles, Méthodes et Algorithmes”, BLAN07-2 195422.
Chapter PDF
References
Bodini, O., Latapy, M.: Generalized Tilings with Height Functions. Morfismos 7 3 (2003)
Bougé, L., Cosnard, M.: Recouvrement d’une pièce trapézoidale par des dominos, C. R. Académie des Sciences Paris 315, Série I, pp. 221–226 (1992)
Bodini, O., Fernique, T.: Planar Tilings. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol. 3967, pp. 104–113. Springer, Heidelberg (2006)
Conway, J.H., Lagarias, J.C.: Tiling with polyominoes and combinatorial group theory. JCT Series A 53, pp. 183–208 (1990)
Ford, L.R., Fulkerson, D.R.: Maximal Flow through a Network. Canadian Journal of Mathematics, 399 (1956)
Fournier, J.C.: Tiling pictures of the plane with dominoes. Discrete Mathematics 165/166, 313–320 (1997)
Gabow, H.N., Tarjan, R.E.: Faster scaling algorithms for network problems. SIAM J. Comput. 18(5), 1013–1036 (1989)
Hopcroft, J.E., Karp, R.M.: An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225–231 (1973)
Ito, K.: Domino tilings on planar regions. J.C.T. Series A 75, pp. 173–186 (1996)
Kenyon, R.: A note on tiling with integer-sided rectangles. JCT Series A 74, pp. 321–332 (1996)
Rémila, E.: The lattice structure of the set of domino tilings of a polygon. Theoretical Computer Science 322(2), 409–422 (2004)
Thiant, N.: An O (n log n)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded. Theoretical Computer Science 303(2-3), 353–374 (2003)
Thurston, W.P.: Conway’s tiling groups. American Mathematics Monthly 95, 757–773 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bodini, O., Lumbroso, J. (2009). Optimal Partial Tiling of Manhattan Polyominoes. In: Brlek, S., Reutenauer, C., Provençal, X. (eds) Discrete Geometry for Computer Imagery. DGCI 2009. Lecture Notes in Computer Science, vol 5810. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04397-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-04397-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04396-3
Online ISBN: 978-3-642-04397-0
eBook Packages: Computer ScienceComputer Science (R0)