Smoother transitions between breadth-first-spanning-tree-based drawings

Homan, Christopher and Pavlo, Andrew and Schull, Jonathan (2007) Smoother transitions between breadth-first-spanning-tree-based drawings. In: Graph Drawing 13th International Symposium, GD 2005, September 18-20, 2006, Karlsruhe, Germany , pp. 442-444 (Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_43).

Full text not available from this repository.

Abstract

We demonstrate a collection of techniques that seek to make the transition between drawings based on two topologically distinct spanning trees of the same graph as clear as possible.

Item Type:Conference Poster
Additional Information:10.1007/978-3-540-70904-6_43
Classifications:A General Literature > A.001 Introductory and Survey
ID Code:800

Repository Staff Only: item control page

References

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

J. Carrire and R. Kazman. Research report: Interacting with huge hierarchies: Beyond cone trees. In Proceedings of the IEEE Symposium on Information Visualization, pages 74-81, 1995.

Peter Eades. Drawing free trees. Bulletin of the Institute of Combinatorics and its Applications, 5:10-36, 1992.

S. Grivet, D. Auber, J.P. Domenger, and G. Melancon. Bubble tree drawing algorithm. In International Conference on Computer Vision and Graphics, pages 633-641, 2004. Herman, G. Melanžcon, and M. S. Marshall. Graph visualization and navigation in information visualization: A survey. IEEE Transactions on Visualization and Computer Graphics, 6(1):24-43, 2000.

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

Pourang Irani and Colin Ware. Diagramming information structures using 3d perceptual primitives. ACM Transactions on Computer-Human Interaction, 10(1):1-19, 2003.

Chang-Sung Jeong and Alex Pang. Reconfigurable disc trees for visualizing large hierarchical information space. In Proceedings of the IEEE Symposium on Information Visualization, pages 19-25, 1998.

John Lamping, Ramana Rao, and Peter Pirolli. 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, pages 401-408, New York, NY, USA, 1995 ACM Press/Addison-Wesley Publishing Co.

Chun-Cheng Lin and Hsu-Chun Yen. On balloon drawings of rooted trees. In GD '05: Revised Papers from the 13th International Symposium on Graph Drawing, pages 285-296, London, UK, 2005. Springer-Verlag.

Guy Melancon and Ivan Herman. Circular drawings of rooted trees. Technical Report INS-R9817, CWI (Centre for Mathematics and Computer Science), Amsterdam, The Netherlands, 1998.

Tamara Munzner. H3: Laying out large directed graphs in 3d hyperbolic space. In Proceedings of the IEEE Symposium on Information Visualization, pages 2-10, 1997.

Andrew Pavlo, Christopher M. Homan, and Jonathan Schull. A parentcentered radial layout algorithm for interactive graph visualization and animation. Technical Report http://arxiv.org/abs/cs/0606007, arXiv.org, 2006.

Edward M. Reingold and John S. Tilford. Tidier drawings of trees. IEEE Transactions on Software Engineering, 7(2):223-228, 1981.

Soon Tee Teoh and Kwan-Liu Ma. Rings: A technique for visualizing large hierarchies. In GD '02: Revised Papers from the 10th International Symposium on Graph Drawing, pages 268-275, London, UK, 2002. Springer-Verlag.

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

Ka-Ping Yee, Danyel Fisher, Rachna Dhamija, and Marti A. Hearst. Animated exploration of dynamic graphs with radial layout. In Proceedings of the IEEE Symposium on Information Visualization, pages 43-50, 2001.