Circular Tree Drawing by Simulating Network Synchronisation Dynamics and Scaling

Ghassemi Toosi, Farshad and Nikolov, Nikola S. (2014) Circular Tree Drawing by Simulating Network Synchronisation Dynamics and Scaling. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014, Würzburg, Germany , pp. 511-512 .

Full text not available from this repository.

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.

Item Type:Conference Poster
Classifications:G Algorithms and Complexity > G.420 Crossings
M Methods > M.900 Tree
P Styles > P.120 Circular
ID Code:1461

Repository Staff Only: item control page

References

Arenas, A., Daz-Guilera, A., Prez-Vincente, C.J.: Synchronization reveals topological scales in the compley networks. Phys. Rev. Lett. 96(11), 114102-1-11402-4 (2006)

Bannister, M.J., Eppstein, D., Goodrich, M.T., Trott, L.: Force-directed graph drawing using social gravity and scaling. In: Didimo, W., Patrignani, M. (eds) GD 2012. LNCS, vol. 7704, pp. 414-425. Springer, Heidelberg (2013)