39 search results - page 1 / 8 » Hierarchical Layouts of Directed Graphs in Three Dimensions |
GD
2005
Springer
13 years 10 months ago
2005
Springer
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...
COMGEO
2004
ACM
13 years 4 months ago
2004
ACM
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...
GD
2005
Springer
13 years 10 months ago
2005
Springer
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
APVIS
2007
13 years 6 months ago
2007
In this paper, we consider the problem of navigating graphs drawn in 2.5 dimensions. First, we define criteria for good navigation and then present various methods to satisfy som...
JGAA
2007
13 years 4 months ago
2007
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 ...