An Attribute Graph Grammar Enabling Narrower Drawings of Trees

Visualizing information has been one of the main subjects of study in the computer field. Representing objects with diagrams is one approach to visualizing information and its effectiveness has widely been recognized. Thus far, many graph-drawing algorithms have been proposed. Several authors have studied the problem of producing tidy drawings of binary trees - drawings that are aesthetically pleasing and of minimum width. A number of aesthetics has been proposed. We extend this problem to that of general trees in this paper and give an attribute graph grammar that corresponds to general trees. Finally, we propose an application of this grammar.