Angular-Coordinate Driven Radial Tree Drawing

We present a visualization technique for radial drawing of trees consisting of two slightly different algorithms. Both of them make use of node-link diagrams for visual encoding. This visualization creates clear drawings without edge crossing. One of the algorithms is suitable for real-time visualization of large trees, as it requires minimal recalculation of the layout if leaves are inserted or removed from the tree; while the other algorithm makes better utilization of the drawing space. The algorithms are very similar and follow almost the same procedure but with different parameters. Both algorithms assign angular coordinates for all nodes which are then converted into 2D Cartesian coordinates for visualization. We present both algorithms and discuss how they compare to each other.

• Farshad Ghassemi Toosi
• Nikola S. Nikolov

• Radial Tree Drawing
• Real-Time Visualization
• Angular Coordinates
• Large Trees.

<p>[1] Rusu, A., Tree Drawing Algorithms, in Tamassia, R. (ed.): Handbook of Graph Drawing and Visualization. Chapman and Hall/ CRC, 2013, chapter 5, pp. 155–192.
[2] Book, G. and Keshary, N., Radialtree graph drawing algorithm for representing large hierarchies. Technical report, University of Connecticut, 2001.
[3] Alam, Md. J., Samee, Md. A. H., Rabbi, M. and Rahman, Md. S., Upward drawings of trees on the minimum number of layers. WALCOM, 2008, pp.88—99.
[4] Ghassemi Toosi, F., Paulovich, F. V., Hutt, M.-T. and Linsen, L. Projection-based Visualization of Dynamical Processes on Networks. Eurovis 2012, pp. 61--65.
[5] Cox, T.F. and Cox, A. A. Multidimensional Scaling, Second Edition. Chapman & Hall/CRC Monographs on Statics & Applied Probablility. Taylor & Francis, 2010.</p>

<p> </p>