GD 1996: Graph Drawing pp 101-112

Multilevel visualization of clustered graphs

  • Peter Eades
  • Qing-Wen Feng
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1190)

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 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.

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Peter Eades
    • 1
  • Qing-Wen Feng
    • 1
  1. 1.Department of Computer Science and Software EngineeringUniversity of NewcastleAustralia

Personalised recommendations