Smoother Transitions Between Breadth-First-Spanning-Tree-Based Drawings

1. Bierderman, I.: Recognition-by-components: A theory of human image understanding. Psychological Review 94(2), 115–147 (1987)

   Article  Google Scholar 

2. Carrire, J., Kazman, R.: Research report: Interacting with huge hierarchies: Beyond cone trees. In: Proceedings of the IEEE Symposium on Information Visualization, pp. 74–81. IEEE Computer Society Press, Los Alamitos (1995)

   Google Scholar 

3. Eades, P.: Drawing free trees. Bulletin of the Institute of Combinatorics and its Applications 5, 10–36 (1992)

   MATH  MathSciNet  Google Scholar 

4. Grivet, S., Auber, D., Domenger, J.P., Melançon, G.: Bubble tree drawing algorithm. In: International Conference on Computer Vision and Graphics, pp. 633–641 (2004)

   Google Scholar 

5. Herman, I., Melançon, G., Marshall, M.S.: Graph visualization and navigation in information visualization: A survey. IEEE Transactions on Visualization and Computer Graphics 6(1), 24–43 (2000)

   Article  Google Scholar 

6. Walker II., J.Q.: A node-positioning algorithm for general trees. Software: Practice and Experience 20(7), 685–705 (1990)

   Article  Google Scholar 

7. Irani, P., Ware, C.: Diagramming information structures using 3d perceptual primitives. ACM Transactions on Computer-Human Interaction 10(1), 1–19 (2003)

   Article  Google Scholar 

8. Jeong, C.-S., Pang, A.: Reconfigurable disc trees for visualizing large hierarchical information space. In: Proceedings of the IEEE Symposium on Information Visualization, pp. 19–25. IEEE Computer Society Press, Los Alamitos (1998)

   Google Scholar 

9. Lamping, J., Rao, R., Pirolli, P.: The hyperbolic browser: A focus+context technique based on hyperbolic geometry for visualizing large hierarchies. In: CHI ’95: Proceedings of the SIGCHI conference on Human factors in computing systems, Denver, Colorado, United States, pp. 401–408. ACM Press, New York (1995), doi:10.1145/223904.223956

   Google Scholar 

10. Lin, C.-C., Yen, H.-C.: On balloon drawings of rooted trees. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 285–296. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

11. Melançon, G., Herman, I.: Circular drawings of rooted trees. Technical Report INS-R9817, CWI (Centre for Mathematics and Computer Science), Amsterdam, The Netherlands (1998)

    Google Scholar 

12. Munzner, T.: H3: Laying out large directed graphs in 3d hyperbolic space. In: Proceedings of the IEEE Symposium on Information Visualization, pp. 2–10. IEEE Computer Society Press, Los Alamitos (1997)

    Google Scholar 

13. Pavlo, A., Homan, C.M., Schull, J.: A parent-centered radial layout algorithm for interactive graph visualization and animation. Technical Report (2006), http://arxiv.org/abs/cs/0606007

14. Reingold, E.M., Tilford, J.S.: Tidier drawings of trees. IEEE Transactions on Software Engineering 7(2), 223–228 (1981)

    Article  Google Scholar 

15. Teoh, S.T., Ma, K.-L.: Rings: A technique for visualizing large hierarchies. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 268–275. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

16. Wills, G.J.: NicheWorks — interactive visualization of very large graphs. Journal of Computational and Graphical Statistics 8(2), 190–212 (1999)

    Article  Google Scholar 

17. Yee, K.-P., Fisher, D., Dhamija, R., Hearst, M.A.: Animated exploration of dynamic graphs with radial layout. In: Proceedings of the IEEE Symposium on Information Visualization, pp. 43–50. IEEE Computer Society Press, Los Alamitos (2001), citeseer.ist.psu.edu/article/yee01animated.html

    Google Scholar 

Download references