User Hints for Directed Graph Drawing

  • Hugo A. D. Nascimento
  • Peter Eades
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2265)

Abstract

This paper investigates an interactive approach where users can help a system to produce nice drawings of directed graphs by giving hints to graph drawing algorithms. Hints can be three kinds of operations: focus on a specific part of the drawing that needs improvement, insertion of layout constraints, and manual changes of the drawing. These hints help the system to escape from local minima, reduce the size of the solution space to be explored, and input domain knowledge. The overall aim is to produce high quality drawings. We present a system based on this approach and a pilot study involving human tests.

References

  1. 1.
    G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph drawing: algorithms for the visualization of graphs. New Jersey: Prentice-Hall, 1999.MATHGoogle Scholar
  2. 2.
    K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Trans. Syst. Man Cybern., SMC-11(2):109–125, 1981.CrossRefMathSciNetGoogle Scholar
  3. 3.
    R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern., SMC-18(1):61–79, 1988.CrossRefGoogle Scholar
  4. 4.
    K. Sugiyama and K. Misue. Visualization of structural information: Automatic drawing of compound digraphs. IEEE Trans. Softw. Eng., 21(4):876–892, 1991.MathSciNetGoogle Scholar
  5. 7.
    R. Davidson and D. Harel. Drawing graphs nicely using simulated annealing. Technical report, Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, 1989.Google Scholar
  6. 8.
    J. Utech, J. Branke, H. Schmeck, and P. Eades. An evolutionary algorithm for drawing directed graphs. In Proc. of The International Conference on Imaging Science, Systems, and Technology (CISST’98), pp. 154–160, Las Vegas, Nevada: CSREA Press, July 6-9, 1998.Google Scholar
  7. 9.
    H. A. D. do Nascimento, P. Eades and C. F. Xavier de Mendonca Neto. A multiagent approach using A-Teams for Graph Drawing. In Proceedings of the 9th International Conference on Intelligent Systems, Louisville, Kentucky-USA, June 15-16, 2000, pag 39–42.Google Scholar
  8. 10.
    D. Andersen, M. Andersen, M. Lesh, J. Marks, B. Mirtich, D. Ratajczac and K. Ryall, Human guided simple search, to appear in the proceedings of the annual conference of the American Association for Artificial Intelligent, 2000.Google Scholar
  9. 11.
    N. Lesh, J. Marks, and M. Patrigname. Interactive Partitioning. Graph Drawing Conference, 2000.Google Scholar
  10. 12.
    K. Ryall, J. Marks, S. Shieber. An interactive constraint-based system for drawing graphs. In Proc. of the ACM Symposium on User interface Software and Technology (UIST’ 97), pages 97–104, Oct. 1997, Ban., Alberta.Google Scholar
  11. 13.
    T. M. J. Fruchterman and E. M. Reingold. Graph drawing by force-directed placement. Software-Practice and Experience, vol. 21, no. 11, 1129–1164, 1991.CrossRefGoogle Scholar
  12. 14.
    K. Dauner. “Ein interaktiver Genetischer Algorithmus fur das Zeichnen von Graphen”.(“Interactive genetic algorithm for graph drawing”). Diplomarbeit (Master Thesis), Institute AIFB, University of Karlsruhe, 76128 Karlsruhe, Germany, 1997.Google Scholar
  13. 15.
    A. E. Jacobsen. “Interaktion und Lernverfahren beim Zeichnen von Graphen mit Hilfe evolutionarer Algorithmen” (“Interaction and learning methods for graph layouts with the help of evolutionary algorithms”). Diplomarbeit (Master Thesis), Institute AIFB, University of Karlsruhe, 76128 Karlsruhe, Germany, 2001.Google Scholar
  14. 16.
    E. Koutsofios and S. North. Drawings graphs with dot. Technical Report, AT&T Bell Laboratoties, Murray Hill, NJ, USA, Sep 1991.Google Scholar
  15. 17.
    K.-F. Böhringer and F. N. Paulisch. Using constraints to achieve stability in automatic graph layout algorithms. Conference proceedings on Empowering people: Human factors in computing system: special issue of the SIGCHI Bulletin, pages 43–51,1990.Google Scholar
  16. 18.
    P. Eades. A Heuristics for Graph Drawing. Congr. Numer., 42, 149–160, 1984.MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Hugo A. D. Nascimento
    • 1
  • Peter Eades
    • 1
  1. 1.Basser Department of Computer ScienceThe University of SydneyAustralia

Personalised recommendations