An Algorithm for Drawing Compound Graphs
We present a new algorithm, called Nuage, for drawing graphs with both adjacency and inclusion relationships between nodes, that is, compound graphs. Compound graphs are more general than classical graph models or clustered graphs. Nuage can be applied to both directed and undirected compound graphs. It can be parameterized by classical graph drawing algorithms. Nuage can be viewed as a method for unifying several classical algorithms within the same drawing by using the structure of the compound graph. Additionally, we present a refinement technique that can be used in conjunction with Nuage to reduce the number of edge crossings.
- 2.P. D. Eades and Q.-W. Feng. Multilevel visualisation of clustered graphs. In S. North, editor, Graph drawing, volume 1190, pages 101–111, Berkeley (USA), 1996. Springer Verlag.Google Scholar
- 3.P. D. Eades, Q.-W. Feng, and X. Lin. Straight-line drawing algorithms for hierarchical graphs and clustered graphs. In S. North, editor, Graph drawing, volume 1190, pages 113–127, Berkeley (USA), 1996. Springer Verlag.Google Scholar
- 6.S. C. North. Drawing ranked digraphs with recursive clusters. ALCOM Workshop on Graph Drawing 93, 1993.Google Scholar