Bounded Wang tilings with integer programming and graph-based heuristics
Bounded Wang tilings with integer programming and graph-based heuristics
Wang tiles enable efficient pattern compression while avoiding the periodicity in tile distribution via programmable matching rules. However, most research in Wang tilings has considered tiling the infinite plane. Motivated by emerging applications in materials engineering, we consider the bounded version of the tiling problem and offer four integer programming …