Drawing Clustered Graphs in Three Dimensions
نویسندگان
چکیده
Clustered graph is a 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/
منابع مشابه
MultiPlane: A New Framework for Drawing Graphs in Three Dimensions
This poster presents a new framework for drawing graphs in three dimensions, which can be used effectively to visualise large and complex real world networks. The new framework uses a divide and conquer approach. More specifically, the framework divides a graph into a set of smaller subgraphs, and then draws each subgraph in a 2D plane using well-known 2D drawing algorithms. Finally, a 3D drawi...
متن کاملConvex drawings of hierarchical planar graphs and clustered planar graphs
Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, software visualisation and visualisation of social networks and biological networks. Straight-line drawing algorithms for hierarchical graphs and clustered graphs have been presented in [P. Eades, Q. Feng, X. Lin and H. Nag...
متن کاملDrawing Planar Clustered Graphs in 2.5 Dimensions
Clustering techniques have proven to be useful in reducing the complexity of large networks. We present a method for drawing a clustered graph in 2.5D, given the clusters of the graph are connected in a planar way. The main contribution is to develop a weighted version of the well known 2D straight line drawing algorithm of de Fraysseix, Pach and Pollack [5] for planar graphs. This version allo...
متن کاملTreetopes and their Graphs
We define treetopes, a generalization of the threedimensional roofless polyhedra (Halin graphs) to arbitrary dimensions. Like roofless polyhedra, treetopes have a designated base facet such that every face of dimension greater than one intersects the base in more than one point. We prove an equivalent characterization of the 4-treetopes using the concept of clustered planarity from graph drawin...
متن کاملDrawing Graphs Symmetrically in Three Dimensions
In this paper, we investigate symmetric graph drawing in three dimensions. We show that the problem of drawing a graph with a maximum number of symmetries in three dimensions is NP-hard. Then we present a polynomial time algorithm for finding maximum number of three dimensional symmetries in planar graphs.
متن کامل