Minimax geometric fitting of two corresponding sets of points
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Geometric symmetry in graphs
Design galleries: a general approach to setting parameters for computer graphics and animation
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
An interactive constraint-based system for drawing graphs
Proceedings of the 10th annual ACM symposium on User interface software and technology
SCG '85 Proceedings of the first annual symposium on Computational geometry
Computational Complexity of Geometric Symmetry Detection in Graphs
Proceedings of the The First Great Lakes Computer Science Conference on Computing in the 90's
Which Aesthetic has the Greatest Effect on Human Understanding?
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Design Gallery Browsers Based on 2D and 3D Graph Drawing
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
A User Study in Similarity Measures for Graph Drawing
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Computing and Drawing Isomorphic Subgraphs
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
The aesthetics of graph visualization
Computational Aesthetics'07 Proceedings of the Third Eurographics conference on Computational Aesthetics in Graphics, Visualization and Imaging
Interactive random graph generation with evolutionary algorithms
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.00 |
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.