6 search results - page 1 / 2 » Drawing Algorithms for Series-Parallel Digraphs in Two and T... |
GD
1998
Springer
13 years 9 months ago
1998
Springer
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
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 ...
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...
COMPGEOM
2010
ACM
13 years 9 months ago
2010
ACM
Shape completion is an intriguing problem in geometry processing with applications in CAD and graphics. This paper defines a new type of 3D curves, which can be utilized for curv...