2018/01/01 by Maya Olszewski, J.F. Méder, Jeff Meder +5
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Artificial intelligence #Attractor #Cellular Automata and Applications #Chaos control and synchronization #Chaotic #Computer graphics (images) #Computer science #Database #Graphics #Mathematical Dynamics and Fractals #Mathematics #Matrix (chemical analysis) #Programming language #Scalability #Scalable Vector Graphics #Template #Theoretical computer science #Topology (electrical circuits) #World Wide Web #nlin.CD
paper · pdf · doi:10.1007/978-3-030-04414-5_8
Appears in the Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018)
openalex publication_date 2018/01/01 · arxiv created 2018/09/10 · arxiv updated 2021/06/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
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.