Graph Multidrawing: Finding Nice Drawings Without Defining Nice

Biedl, Therese and Marks, Joe and Ryall, Kathy and Whitesides, Sue (1998) Graph Multidrawing: Finding Nice Drawings Without Defining Nice. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998 , pp. 347-355(Official URL: http://dx.doi.org/10.1007/3-540-37623-2_26).

Full text not available from this repository.

Abstract

This paper proposes a multidrawing approach to graph drawing. Current graph-drawing systems typically produce only one drawing of a graph. By contrast, the multidrawing approach calls for systematically producing many drawings of the same graph, where the drawings presented to the user represent a balance between aesthetics and diversity. This addresses a fundamental problem in graph drawing, namely, how to avoid requiring the user to specify formally and precisely all the characteristics of a single “nice” drawing. We present a proof-of-concept implementation with which we produce diverse selections of symmetric-looking drawings for small graphs.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-37623-2_26
Classifications: M Methods > M.999 Others
G Algorithms and Complexity > G.999 Others
D Aesthetics > D.999 Others
P Styles > P.780 Symmetric
URI: http://gdea.informatik.uni-koeln.de/id/eprint/392

Actions (login required)

View Item View Item