A construction of the hat tilings by a Markov partition

We present a simple construction of hat tilings. The construction can be carried out by superimposing a triangular grid on a specially colored image and reading off the orientation of the tiles. We show that our construction produces valid hat tilings, and conversely, in an appropriate sense that is made precise in the paper, that every valid hat tiling can be obtained in this way.