Abstract: | This dissertation describes the design and implementation of an algorithm which uses heuristic search techniques to produce aesthetically pleasing layouts for general directed graphs. Previous work in this field has been based around fairly inflexible algorithms, where the heuristic content is deeply buried within the general mechanism. Such algorithms can not easily be modified to meet differing aesthetic requirements. in contrast, the algorithm presented here provides a flexible framework within which a range of aesthetic requirements can be met.
|