Journal of Information Processing
An experimental comparison of four graph drawing algorithms
Computational Geometry: Theory and Applications
GIOTTO3D: A System for Visualizing Hierarchical Structures in 3D
GD '96 Proceedings of the Symposium on Graph Drawing
Fast and Simple Horizontal Coordinate Assignment
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Layered drawings of directed graphs in three dimensions
APVis '05 proceedings of the 2005 Asia-Pacific symposium on Information visualisation - Volume 45
Graph layering by promotion of nodes
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
MultiPlane: a new framework for drawing graphs in three dimensions
GD'05 Proceedings of the 13th international conference on Graph Drawing
| Hi-index | 0.00 |
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.