Cargando…
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 v...
Autores principales: | Tyburec, Marek, Zeman, Jan |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10039085/ https://www.ncbi.nlm.nih.gov/pubmed/36964189 http://dx.doi.org/10.1038/s41598-023-31786-3 |
Ejemplares similares
-
Wang Tiles in Computer Graphics
por: Lagae, Ares
Publicado: (2009) -
Decomposition techniques with mixed integer programming and heuristics for home healthcare planning
por: Laesanklang, Wasakorn, et al.
Publicado: (2016) -
Integer groups of coinvariants associated to octagonal tilings
por: Kellendonk, J
Publicado: (1995) -
Integer division by constants: optimal bounds
por: Lemire, Daniel, et al.
Publicado: (2021) -
Faster heuristics for graph burning
por: Gautam, Rahul Kumar, et al.
Publicado: (2021)