Optimal Partial Tiling of Manhattan Polyominoes

DOI10.1007/978-3-642-04397-0_8zbMath1260.05034OpenAlexW2103301526MaRDI QIDQ3648774

Olivier Bodini, Jérémie Lumbroso

Publication date: 1 December 2009

Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04397-0_8

zbMATH Keywords

optimal partial tiling algorithmtiling of Manhattan polyominoes

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorial aspects of tessellation and tiling problems (05B45) Polyominoes (05B50)

Cites Work

• Unnamed Item
• Tiling pictures of the plane with dominoes
• An \(O(n \log n)\)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded.
• Tiling with polyominoes and combinatorial group theory
• The lattice structure of the set of domino tilings of a polygon
• A note on tiling with integer-sided rectangles
• Domino tilings on planar regions
• Conway's Tiling Groups
• Maximal Flow Through a Network
• Planar Dimer Tilings
• Faster Scaling Algorithms for Network Problems
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs