Advertisement

Graph Multidrawing: Finding Nice Drawings Without Defining Nice

  • Therese Biedl
  • Joe Marks
  • Kathy Ryall
  • Sue Whitesides
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1547)

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.

Keywords

Input Graph Petersen Graph Layout Algorithm Edge Crossing Candidate Member 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [1]
    H. Alt and L. Guibas. Resemblance of geometric objects. In Handbook for Computational Geometry. North Holland, Amsterdam, to appear.Google Scholar
  2. [2]
    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, Lecture Notes in Computer Science #1353. Springer-Verlag, pp. 322–329, 1998.Google Scholar
  3. [3]
    S. Bridgeman and R. Tamassia. Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms. In this volume.Google Scholar
  4. [4]
    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.Google Scholar
  5. [5]
    X. Lin. Analysis of Algorithms for Drawing Graphs. Ph.D. thesis, Dept. of Computer Science, Univ. of Queensland, Australia, 1992.Google Scholar
  6. [6]
    R. J. Lipton, S. C. North and J. S. Sandberg. A method for drawing graphs. Proc. 1st Annu. ACM Symp. Comp. Geom., pp. 153–160, 1985.Google Scholar
  7. [7]
    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, Aug. 1997.Google Scholar
  8. [8]
    J. Manning, Geometric Symmetry in Graphs. Ph.D. thesis, Dept. of Computer Science, Purdue Univ., 1990.Google Scholar
  9. [9]
    J. Manning, Computational complexity of geometric symmetry detection in graphs. Computing in the 90’s (Kalamazoo, MI, 1989), Lecture Notes in Computer Science, #507. Springer-Verlag, pp. 1–7, 1991.Google Scholar
  10. [10]
    H. Purchase. Which aesthetic has the greatest effect on human understanding? In G. Di Battista, editor. Symposium on Graph Drawing 97, volume 1353 of Lecture Notes in Computer Science. Springer-Verlag, pp. 248–261, 1998.CrossRefGoogle Scholar
  11. [11]
    K. Ryall, J. Marks, and S. Shieber. An Interactive Constraint-Based System for Drawing Graphs. Proc. of the 10th Annu. Symp. on User Interface Software and Technology (UIST 97), Banff, Alberta, pp. 97–104.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Therese Biedl
    • 1
  • Joe Marks
    • 2
  • Kathy Ryall
    • 3
  • Sue Whitesides
    • 1
  1. 1.School of Computer ScienceMcGill UniversityMontrealCanada
  2. 2.MERL—A Mitsubishi Electric Research LaboratoryCambridgeUSA
  3. 3.Department of Computer ScienceUniversity of VirginiaCharlottesvilleUSA

Personalised recommendations