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 , pp. 492-502(Official URL: http://dx.doi.org/10.1007/11618058_44).

Full text not available from this repository.


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
URI: http://gdea.informatik.uni-koeln.de/id/eprint/715

Actions (login required)

View Item View Item