| Title: |
Graph Tiles |
| Authors: |
Aichholzer, Oswin; Ganian, Robert; Keldenich, Phillip; Löffler, Maarten; Meijer, Gert; Weinberger, Alexandra; Wenk, Carola; Sub Geometric Computing; Dujmovic, Vida; Montecchiani, Fabrizio |
| Publication Year: |
2025 |
| Subject Terms: |
graph tiles; Software |
| Description: |
We define a graph tile to be a unit square (or more generally, a polygon) on which a piece of a graph has been drawn/embedded; in particular, it may have vertices in its interior, edges connecting those vertices, or half-edges that extend to the boundary of the tile. In a graph tiling problem, we are given as input a set of graph tiles, with multiplicities, and the output is an arrangement of those tiles forming a graph of larger area. We focus on a simple tile set: unit square tiles with a central vertex and either a half-edge or no half-edge on each side. Up to symmetry this gives us six different types. We characterize which multiplicities are compatible for sets of at most three different tiles. |
| Document Type: |
book part |
| File Description: |
application/pdf |
| Language: |
English |
| ISSN: |
1868-8969 |
| Relation: |
https://dspace.library.uu.nl/handle/1874/483524 |
| Availability: |
https://dspace.library.uu.nl/handle/1874/483524 |
| Rights: |
info:eu-repo/semantics/OpenAccess |
| Accession Number: |
edsbas.281CEC3D |
| Database: |
BASE |