17 search results - page 1 / 4 » Drawing Clustered Graphs in Three Dimensions |
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 ...
GD
2005
Springer
13 years 10 months ago
2005
Springer
This paper presents a new framework for drawing graphs in three dimensions. In general, the new framework uses a divide and conquer approach. More specifically, the framework divi...
COMPGEOM
1996
ACM
13 years 8 months ago
1996
ACM
We provideO(n)-timealgorithmsfor constructingthe following types of drawings of n-vertex 3-connectedplanar graphs: 2D convex grid drawings with (3n) (3n=2) area under the edge L1-...
GD
2005
Springer
13 years 10 months ago
2005
Springer
We give a drawing of Kn in three dimensions in which vertices are placed at integer grid points and edges are drawn crossing-free with at most one bend per edge in a volume bounde...
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...