Abstract
We present an algorithm which produces circular-shape layouts of trees by simulating synchronisation dynamics on the tree. Our approach consists of evolving scalar dynamical values assigned to the nodes. Then the dissimilarities between the values of each pair of nodes are utilised to calculate the coordinates of the nodes by using a lower bound on dissimilarities and scaling up the lower bound per iteration.
Original language | English |
---|---|
Pages (from-to) | 511-512 |
Number of pages | 2 |
Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Volume | 8871 |
Publication status | Published - 2014 |