0000−0001−9926−058X] , Jeff Meder 1[0000−0002−2360−8487] , Emmanuel Kieffer 2[0000−0002−5530−8577] , Raphaël Bleuse 1[0000−0002−6728−2132] , Martin Rosalie 2[0000−0003−3676−120X] , Grégoire Danoy 1[0000−0001−9419−4210] , and Pascal Bouvry 1,2[0000−0001−9338−2834]Abstract. Chaotic attractors are solutions of deterministic processes, of which the topology can be described by templates. We consider templates of chaotic attractors bounded by a genus-1 torus described by a linking matrix. This article introduces a novel and unique tool to validate a linking matrix, to optimize the compactness of the corresponding template and to draw this template. The article provides a detailed description of the different validation steps and the extraction of an order of crossings from the linking matrix leading to a template of minimal height. Finally, the drawing process of the template corresponding to the matrix is saved in a Scalable Vector Graphics (SVG) file.