Skip to Main content Skip to Navigation
Conference papers

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].
Complete list of metadata

Cited literature [4 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam <>
Submitted on : Thursday, August 6, 2015 - 10:58:09 AM
Last modification on : Wednesday, November 20, 2019 - 7:50:50 AM
Long-term archiving on: : Friday, May 5, 2017 - 11:11:19 AM


Publisher files allowed on an open archive


  • HAL Id : hal-01182967, version 1



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. ⟨hal-01182967⟩



Record views


Files downloads