57 search results - page 2 / 12 » Directed graphs and rectangular layouts |
GD
2006
Springer
14 years 5 days ago
2006
Springer
Abstract. The typical use of force-directed layout is to create organiclooking, straight-edge drawings of large graphs while combinatorial techniques are generally preferred for hi...
APVIS
2004
13 years 10 months ago
2004
The visualisation pipeline approach is a flexible and extensible technique for generating visualisations. The basic pipeline functions involve the capture and representation of da...
GD
2005
Springer
14 years 2 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...
GD
2004
Springer
14 years 1 months ago
2004
Springer
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
GD
1995
Springer
14 years 2 days ago
1995
Springer
Abstract. Generating incrementally stable layouts is important for visualizing dynamic graphs in many applications. This paper describes DynaDAG, a new heuristic for incremental la...