Abstract
Modelling of the growth of a decagonal Cartwheel-type tiling is not described well enough by the well known matching rules of Penrose tiles. This paper presents a deterministic algorithm which allows the calculation of a perfect Cartwheel-type tiling by the successive transfer of recursive values out of each cluster cell, Q, to its neighbour cells.