Drawing Clustered Graphs in Three Dimensions

Ho, Joshua and Hong, Seok-Hee (2006) Drawing Clustered Graphs in Three Dimensions. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005, Limerick, Ireland , pp. 492-502 (Official URL: http://dx.doi.org/10.1007/11618058_44).

Full text not available from this repository.

Abstract

Clustered graphs are very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a divide and conquer approach. More specifically, it draws each cluster in a 2D plane to minimise occlusion and ease navigation. Then a 3D drawing of the whole graph is constructed by combining these 2D drawings. Our main contribution is to develop three linear time weighted tree drawing algorithms in three dimensions for clustered graph layout. Further, we have implemented a series of six different layouts for clustered graphs by combining three 3D tree layouts and two 2D graph layouts. The experimental results with metabolic pathways show that our method can produce a nice drawing of a clustered graph which clearly shows visual separation of the clusters, as well as highlighting the relationships between the clusters. Sample drawings are available from http://www.cs.usyd.edu.au/~visual/valacon/gallery/C3D/

Item Type:Conference Paper
Additional Information:10.1007/11618058_44
Classifications:P Styles > P.180 Cluster
P Styles > P.060 3D
ID Code:715

Repository Staff Only: item control page

References

A. Ahmed, T. Dwyer, M. Forster, X. Fu, J. Ho, S. Hong, D. Koschützki,C. Murray, N. Nikolov, A. Tarassov, R. Taib and K. Xu: GEOMI: GEOmetry for MAximum Insight, Proceedings of Graph Drawing 2005, 2005.

F. Brandenburg, M. Forster, A. Pick, M. Raitner and F. Schreiber, BioPath, Proceedings of Graph Drawing 2001, pp. 455-456, 2001.

U. Brandes, T. Dwyer, and F. Schreiber, Visualization of Related Metabolic Pathways in Two and a Half Dimensions, Proceedings of Graph Drawing 2003, pp.111-121, 2003.

J. Carriere and R. Kazman, Visualization of Huge Hierarchies: Beyond Cone Trees, Proceedings of IEEE Symposium on Information Visualization 1995, pp. 74-81, 1995.

G. Di Battista, P. Eades, R. Tamassia and I. G. Tollis: Graph Drawing: Algorithms for the Visualization of Graphs, Prentice-Hall, 1998.

P. Eades and Q. Feng: Multilevel Visualization of Clustered Graphs, Proceedings of Graph Drawing 1996, pp. 101-112, 1996.

Y. Frishman and A. Tal: Dynamic Drawing of Clustered Graphs, Proceedings of IEEE Symposium on Information Visualization 2004, pp. 191-198, 2004.

B. Genc and U. Dogrusoz, A Constrained, Force-Directed Layout Algorithm for Biological Pathways, Proceedings of Graph Drawing 2003, pp. 314-319, 2003.

F. van Ham, H. van de Wetering and J. can Wijk: Visualization of State Transition Graph, Proceedings of IEEE Symposium on Information Visualization 2001, pp. 59-63, 2003.

M. Himsolt, GML: Graph Modelling Language. Report, University of Passau, Germany, December 1996. http://www.uni-passau.de/

S. Hong and P. Eades, Drawing Trees Symmetrically in Three Dimensions, Algorithmica, 36(2), pp. 153-178, 2003.

G. Robertson, J. Mackinkay, and S. Card: Cone Trees: Animated 3D Visualizations of Hierarchical Information, Proceedings of CHI'91, pp. 189-194, 1991.

C. Ware and G. Franck: Viewing a Graph in a Virtual Reality Display is Three Times as Good as a 2-D Diagram, IEEE Conference on Visual Languages, pp. 182-183, 1994.

C. Ware: Designing with a 2 1/2D Attitude, Information Design Journal 10 (3), pp. 171-182, 2001.