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, Montréal, Canada , pp. 347-355 (Official URL:

Full text not available from this repository.


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
ID Code:392

Repository Staff Only: item control page


H. Alt and L. Guibas. Resemblance of geometric objects. In Handbook for Computational Geometry. North Holland, Amsterdam, to appear.

B. Andalman, K. Ryall, W. Ruml, J. Marks, and S. Shieber. Design Gallery Browsers Based on 2D and 3D Graph Drawing (Demo). Symp. on Graph Drawing 97, vol. 1353 of LNCS. Springer-Verlag, pp. 322-329, 1998.

S. Bridgeman and R. Tamassia. Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms. In this volume.

K. Imai, S. Sumino and H. Imai. Minimax geometric fitting of two corresponding sets of points. Proc. 5th Annu. ACM Sympos. Comput. Geom. , pp. 266-275, 1989.

X. Lin. Analysis of Algorithms for Drawing Graphs. PhD. thesis, Dept. of Comp. Sci. University Queensland, Australia, 1992.

R.J. Lipton, S.C. North, and J.S. Sandberg. A method for drawing graphs. In 'proc. 1st Annu ACM Sympos. Comput. Geom., pages 153-160, 1985.

J. Marks, B. Andalman, P. Beardsley, W. Freeman, S. Gibson, J. Hodgins, T. Kang, B. Mirtich, H. Pfister, W. Ruml, K. Ryall, J. Seims, and S. Shieber. Design Galleries: A General Approach to Setting Parameters for Computer Graphics and Animation. Proc. SIGGRAPH '97, Los Angeles, CA, pp. 389-400, August 1997.

J. Manning. Geometric Symmetry in graphs. PhD thesis, Purdue University, 1990.

J. Manning. Computational complexity of geometric symmetry detection in graphs. Computing in the 90's (Kalamazoo, MI, 1989), vol. 507 of LNCS, Springer-Verlag, pp. 1-7, 1991.

H. Purchase. Which aesthetichas the greatest effect on human understanding? In G. Di Battista, ed., Proc. of the Symp. on Graph Drawing, GD'97, vol. 1353 of LNCS, pages 248-261. Springer Verlag, 1997.

K. Ryall, J. Marks, and S. Shieber. An interactive constraint-based system for graph drawings. Proc. of the 10th Annu. Symp. on User Interface Software and Technology (UIST '97), Banff, Alberta, pp. 97-104.