Bounded Wang tilings with integer programming and graph-based heuristics
Abstract 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...
Main Authors: | Marek Tyburec, Jan Zeman |
---|---|
Format: | Article |
Language: | English |
Published: |
Nature Portfolio
2023-03-01
|
Series: | Scientific Reports |
Online Access: | https://doi.org/10.1038/s41598-023-31786-3 |
Similar Items
-
Tile-based Lightweight Integer Compression in GPU
by: Shanbhag, Anil, et al.
Published: (2022) -
Heuristic Methods of Integer Programming and Its Applications in Economics
by: Dominika Crnjac Milić, et al.
Published: (2010-12-01) -
Combinatorial and harmonic-analytic methods for integer tilings
by: Izabella Łaba, et al.
Published: (2022-01-01) -
Tabu Search-Based Heuristic Solver for General Integer Linear Programming Problems
by: Yuji Koguma
Published: (2024-01-01) -
A Parallelizable Integer Linear Programming Approach for Tiling Finite Regions of the Plane with Polyominoes
by: Marcus R. Garvie, et al.
Published: (2022-05-01)