Tiling groups: New applications in the triangular lattice

E. Rémila
1998 Discrete & Computational Geometry  
We first give a new presentation of an algorithm, from W. Thurston, to tile polygons with "calissons" (i.e., lozenges formed from two cells of the triangular lattice A). Afterward, we use a similar method to get a linear algorithm to tile polygons with m-leaning bars (parallelograms of length m formed from 2m cells of A) and equilateral triangles (whose sides have length m) and we produce a quadratic algorithm to tile polygons with m-leaning bars.
doi:10.1007/pl00009382 fatcat:6oyff6wblfbpjpz7ikhwfn7qti