Tiling a simply connected figure with bars of length 2 or 3

DOI10.1016/0012-365X(96)00158-6zbMath0878.05023MaRDI QIDQ1126294

Eric Rémila

Publication date: 5 January 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

tilinglinear-time algorithmpeakplanar square latticerectangular barssimply connected figure

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Related Items (2)

Tiling with bars and satisfaction of boolean formulas ⋮ Complexity of tiling a polygon with trominoes or bars

Cites Work

• A polyomino tiling problem of Thurston and its configurational entropy
• Tiling with polyominoes and combinatorial group theory
• Perfect matchings in the triangular lattice
• Conway's Tiling Groups
• Unnamed Item

This page was built for publication: Tiling a simply connected figure with bars of length 2 or 3