### 抜粋

The Wang tiling is a classical problem in combinatorics. A major theoretical question is to find a (small) set of tiles which tiles the plane only aperiodically. In this case, resulting tilings are rather restrictive. On the other hand, Wang tiles are used as a tool to generate textures and patterns in computer graphics. In these applications, a set of tiles is normally chosen so that it tiles the plane or its sub-regions easily in many different ways. With computer graphics applications in mind, we introduce a class of such tileset, which we call sequentially permissive tilesets, and consider tiling problems with constrained boundary. We apply our methodology to a special set of Wang tiles, called Brick Wang tiles, introduced by Derouet-Jourdan et al. in 2016 to model wall patterns. We generalise their result by providing a linear algorithm to decide and solve the tiling problem for arbitrary planar regions with holes.

元の言語 | 英語 |
---|---|

ページ（範囲） | 749-761 |

ページ数 | 13 |

ジャーナル | Japan Journal of Industrial and Applied Mathematics |

巻 | 36 |

発行部数 | 3 |

DOI | |

出版物ステータス | 出版済み - 9 1 2019 |

### All Science Journal Classification (ASJC) codes

- Engineering(all)
- Applied Mathematics

## フィンガープリント A linear algorithm for Brick Wang tiling' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

## これを引用

*Japan Journal of Industrial and Applied Mathematics*,

*36*(3), 749-761. https://doi.org/10.1007/s13160-019-00369-z