Sciweavers

11 search results - page 1 / 3
» A 2.5D Hierarchical Drawing of Directed Graphs
Sort
View
JGAA
2007
87views more  JGAA 2007»
13 years 4 months ago
A 2.5D Hierarchical Drawing of Directed Graphs
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 ...
Seok-Hee Hong, Nikola S. Nikolov, Alexandre Tarass...
GD
2005
Springer
13 years 10 months ago
Hierarchical Layouts of Directed Graphs in Three Dimensions
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 plane...
Seok-Hee Hong, Nikola S. Nikolov
GD
2008
Springer
13 years 5 months ago
Cyclic Leveling of Directed Graphs
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...
Christian Bachmaier, Franz-Josef Brandenburg, Wolf...
INFOVIS
1997
IEEE
13 years 9 months ago
H3: laying out large directed graphs in 3D hyperbolic space
We present the H3 layout technique for drawing large directed graphs as node-link diagrams in 3D hyperbolic space. We can lay out much larger structures than can be handled using ...
Tamara Munzner
COMGEO
2004
ACM
13 years 4 months ago
A multi-dimensional approach to force-directed layouts of large graphs
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
Pawel Gajer, Michael T. Goodrich, Stephen G. Kobou...