Drawing graphs with attribute graph grammars

Abstract

We address the problem of automatically generating layouts for graphs using graph grammars. The central idea of our approach to graph layout is viewing layout algorithms as attribute evaiuators of attribute graph grammars, thus a layout algorithm is an attribute scheme plus an attribute evaluator. The main advantages are that we make use of the intrinsic structure of graphs to subdivide the layout problem and that different layouts can be specified simply with different attribute schemes for the same graph grammar.