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.

[1]  Ulrik Brandes,et al.  Fast and Simple Horizontal Coordinate Assignment , 2001, GD.

[2]  Roberto Tamassia,et al.  GIOTTO3D: A System for Visualizing Hierarchical Structures in 3D , 1996, GD.

[3]  Colin Ware,et al.  Viewing a graph in a virtual reality display is three times as good as a 2D diagram , 1994, Proceedings of 1994 IEEE Symposium on Visual Languages.

[4]  Mitsuhiko Toda,et al.  Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[5]  Nikola S. Nikolov,et al.  Graph layering by promotion of nodes , 2006, Discret. Appl. Math..

[6]  Diethelm Ostry,et al.  Some Three-Dimensional Graph Drawing Algorithms , 1996 .

[7]  Seok-Hee Hong,et al.  Layered Drawings of Directed Graphs in Three Dimensions , 2005, APVIS.

[8]  Xuemin Lin,et al.  How to draw a directed graph , 1989, [Proceedings] 1989 IEEE Workshop on Visual Languages.

[9]  Giuseppe Liotta,et al.  An Experimental Comparison of Four Graph Drawing Algorithms , 1997, Comput. Geom..

[10]  Ioannis G. Tollis,et al.  Graph Drawing , 1994, Lecture Notes in Computer Science.