Multilevel Visualization of Clustered Graphs

Eades, Peter and Feng, Qing-Wen (1997) Multilevel Visualization of Clustered Graphs. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996 , pp. 101-112(Official URL: http://dx.doi.org/10.1007/3-540-62495-3_41).

Full text not available from this repository.

Abstract

Clustered graphs are graphs with recursive clustering structures over the vertices. This type of structure appears in many systems. Examples include CASE tools, management information systems, VLSI design tools, and reverse engineering systems. Existing layout algorithms represent the clustering structure as recursively nested regions in the plane. However, as the structure becomes more and more complex, two dimensional plane representations tend to be insufficient. In this paper, firstly, we describe some two dimensional plane drawing algorithmsfor clustered graphs; then we show how to extend two dimensional plane drawings to three dimensional multilevel drawings. We consider two conventions: straight-line convex drawings and orthogonal rectangular drawings; and we show some examples.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-62495-3_41
Classifications: P Styles > P.720 Straight-line
P Styles > P.180 Cluster
P Styles > P.600 Poly-line > P.600.700 Orthogonal
P Styles > P.060 3D
G Algorithms and Complexity > G.350 Clusters
URI: http://gdea.informatik.uni-koeln.de/id/eprint/106

Actions (login required)

View Item View Item