Logo

Login | Create Account

Hierarchical Layouts of Directed Graphs in Three Dimensions

Hong, Seok-Hee and Nikolov, Nikola S. (2006) Hierarchical Layouts of Directed Graphs in Three Dimensions. [Conference Paper]

Full text not available from this repository.

Abstract

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.

Item Type:Conference Paper
Classifications:M Methods > M.500 Layered
P Styles > P.480 Layered
P Styles > P.060 3D
ID Code:695
Deposited By:GDEA, Administration
Deposited On:22 Feb 2006
Last Modified:18 Sep 2008 13:08
Alternative Locations:http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=3843&spage=251

Repository Staff Only: item control page

References

U. Brandes and B. Köpf.: Fast and simple horizontal coordinate assignment. P. Mutzel, M. Jüunger, and S. Leipert, editors, Graph Drawing: Proceedings of 9th International Symposium, GD 2001, volume 2265 of Lecture Notes in Computer Science, pages 31--44. Springer-Verlag, 2002.

G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis.: Graph Drawing. Prentice Hall, 1999.

G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. Computational Geometry: Theory and Applications, 7:303--316, 1997.

P. Eades and K. Sugiyama.: How to draw a directed graph. Journal of Information Processing, 13(4):424--437, 1990.

A. Garg and R. Tamassia.: GIOTTO: A system for visualizing hierarchical structures in 3D. S. North, editor, Graph Drawing: Symposium on Graph Drawing, GD '96, volume 1190 of Lecture Notes in Computer Science, pages 193--200. Springer-Verlag, 1997.

S.-H. Hong and N. S. Nikolov.: Layered drawings of directed graphs in three dimensions. S.-H. Hong, editor, Information Visualisation 2005: Asia-Pacific Symposium on Information Visualisation (APVIS2005), volume 45, pages 69--74. CRPIT, 2005.

N. S. Nikolov and A. Tarassov.: Graph layering by promotion of nodes. Special issue of Discrete Applied Mathematics associated with the IV ALIO/EURO Workshop on Applied Combinatorial Optimization, to appear.

D. Ostry.: Some three-dimensional graph drawing algorithms.

Master's thesis, University of Newcastle, 1996.

K. Sugiyama, S. Tagawa, and M. Toda.: Methods for visual understanding of hierarchical system structures. IEEE Transaction on Systems, Man, and Cybernetics, 11(2):109--125, February 1981.

C. Ware and G. Franck.: Viewing a graph in a virtual reality display is three times as good as a 2D diagram. IEEE Conference on Visual Languages, pages 182--183, 1994.

GDEA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.