Tilings of a Domain on a Hexagon Mesh with Balanced 3-Tiles - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2001

Tilings of a Domain on a Hexagon Mesh with Balanced 3-Tiles

Abstract

In this article, we study the question of tilings on a hexagon mesh with balanced 3-tiles. This problem has been studied by Conway and Lagarias in [CL90], by studying the tiling groups, in fact a group containing the tiling-groups, and their Cayley graphs. We will use two different approaches. The first one is based on matchings in bipartite graphs, which in this case are in correspondance with tilings of domains by lozenges, and thus can be efficiently studied, using Thurston's algorithm (see [Thu90]). The second one is based on a color and balancing approach of Thurston's algorithm, exposed in [Fou96].
Fichier principal
Vignette du fichier
dmAA0121.pdf (114.34 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01182967 , version 1 (06-08-2015)

Identifiers

Cite

Gilles Radenne. Tilings of a Domain on a Hexagon Mesh with Balanced 3-Tiles. Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001, 2001, Paris, France. pp.287-300, ⟨10.46298/dmtcs.2287⟩. ⟨hal-01182967⟩
71 View
568 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More