A linear algorithm to tile the trapezes with \(h_ m\) and \(v_ n\)

DOI10.1016/0304-3975(94)90076-0zbMath0788.05018OpenAlexW2035022140MaRDI QIDQ1314412

Eric Rémila

Publication date: 30 May 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90076-0

zbMATH Keywords

tilinglinear-time algorithmrectanglestrapezes

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45)

Cites Work

• Unnamed Item
• Tiling with polyominoes and combinatorial group theory
• Conway's Tiling Groups
• The Structure of Periodic Storage Schemes for Parallel Memories
• Notes on a class of tiling problems
• Tiling with sets of polyominoes
• Theoretical Limitations on the Efficient Use of Parallel Memories
• Tiling with polyominoes
• The undecidability of the domino problem

This page was built for publication: A linear algorithm to tile the trapezes with \(h_ m\) and \(v_ n\)