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 insu cient. In this paper, rstly, we describe some two dimensional plane drawing algorithms for 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.
Clustered graph is yet another category of graphs which exhibits recursive clustering structure over the vertices REF .
Multilevel Visualization of Clustered Graphs
Lecture Notes in Computer Science
Lecture Notes in Computer Science
Computer Science