Home | Issues | About JGAA | Instructions for Authors |
Special Issue on Selected Papers from the Thirteenth International Symposium on Graph Drawing, GD 2005
DOI: 10.7155/jgaa.00151
A 2.5D Hierarchical Drawing of Directed Graphs
Vol. 11, no. 2, pp. 371-396, 2007. Regular paper.
Abstract We introduce a new graph drawing convention for 2.5D hierarchical
drawings of directed graphs. The vertex set is partitioned both into
layers of vertices drawn in parallel planes and into k ≥ 2
subsets, called walls, and also drawn in parallel planes. The planes
of the walls are perpendicular to the planes of the layers. We
present a method for computing such layouts and introduce five
alternative algorithms for partitioning the vertex set into walls
which correspond to different aesthetic requirements. We evaluate our
method with an extensive computational study.1
1An online gallery with examples of our 2.5D hierarchical layouts is available at http://www.cs.usyd.edu.au/∼visual/valacon/gallery/3DHL. |
Journal Supporters
|