Abstract
Wang Tiles are constructed from four texture samples, arranged so they can always match a choice of other tiles at two edges. Because they are precomputed, Wang Tiles are a very efficient way to generate textures on the fly. But matching problems occur within tiles and at the corners of adjacent tiles. By replacing the edge-matching texture samples with a new sample in the center of the tile, and using the graph cut path-finding algorithm, we overcome these problems and introduce additional texture diversity. Our s-Wang Tiles are a stricter interpretation of the original Wang Tile design, and our tile set is also smaller than that required by ω-Tiles: only eight different tiles are required for a non-repetitive titling.
| Original language | English |
|---|---|
| Pages (from-to) | 43-56 |
| Number of pages | 14 |
| Journal | Graphical Models |
| Volume | 70 |
| Issue number | 3 |
| DOIs | |
| State | Published - May 2008 |
| Externally published | Yes |
Keywords
- Graph cut
- Texture synthesis
- Tiling
- Wang Tile