We present a new algorithm, called Nuage, for drawing gra- phs 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 unify- ing several classical algorithms within the same drawing by using the structure of the compound graph. Additionally, we present a renement technique that can be used in conjunction with Nuage to reduce the number of edge crossings.
['François Bertault', 'Mirka Miller']
An Algorithm for Drawing Compound Graphs