Hierarchical Layouts of Directed Graphs in Three Dimensions
We introduce a new graph drawing convention for 3D hierarchical drawings of directed graphs. The vertex set is partitioned into layers of vertices drawn in parallel planes. The vertex set is further partitioned into k ≥ 2 subsets, called walls. The layout consists of a set of parallel walls which are perpendicular to the set of parallel planes of the layers. We also outline a method for computing such layouts and introduce four alternative algorithms for partitioning the vertex set into walls which address different aesthetic requirements.
- 5.Garg, A., Tamassia, R.: GIOTTO: A system for visualizing hierarchical structures in 3D. In: North, S.C. (ed.) GD 1996. LNCS, vol. 1190, pp. 193–200. Springer, Heidelberg (1997)Google Scholar
- 6.Hong, S.-H., Nikolov, N.S.: Layered drawings of directed graphs in three dimensions. In: Hong, S.-H. (ed.) Information Visualisation 2005: Asia-Pacific Symposium on Information Visualisation (APVIS 2005), vol. 45, pp. 69–74. CRPIT (2005)Google Scholar
- 7.Nikolov, N.S., Tarassov, A.: Graph layering by promotion of nodes. In: Special issue of Discrete Applied Mathematics associated with the IV ALIO/EURO Workshop on Applied Combinatorial Optimization (to appear)Google Scholar
- 8.Ostry, D.: Some three-dimensional graph drawing algorithms. Master’s thesis, University of Newcastle (1996)Google Scholar
- 10.Ware, C., Franck, G.: Viewing a graph in a virtual reality display is three times as good as a 2D diagram. In: IEEE Conference on Visual Languages, pp. 182–183 (1994)Google Scholar