Incremental layout in DynaDAG

  • Stephen C. North
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1027)

Abstract

Graph drawings are a basic component of user interfaces that display relationships between objects. Generating incrementally stable layouts is important for many applications. This paper describes DynaDAG, a new heuristic for incremental layout of directed acyclic graphs drawn as hierarchies, and its application in the DynaGraph system.

References

  1. 1.
    G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis. Algorithms for drawing graphs: An annotated bibliography. Computation Geometry: Theory and Applications, 4(5):235–282, 1994. Available at ftp.cs.brown.edu in /pub/compgeo/gdbiblio.tex.Z.Google Scholar
  2. 2.
    G. Di Battista and R. Tamassia. Incremental planarity testing. In Proc. 30th IEEE Symp. on Foundations of Computer Science, pages 436–441, 1989.Google Scholar
  3. 3.
    K. Bohringer and F. Newbery Paulisch. Using constraints to acheive stability in automatic graph layout algorithms. In Proceedings of ACM CHI 90, pages 43–51., 1990.Google Scholar
  4. 4.
    Yih-Farn Chen, Glenn S. Fowler, David G. Korn, Eleftherios Koutsofios, Stephen C. North, David S. Rosenblum, and Kiem-Phong Vo. Intertool connections. In B. Krishnamurthy, editor, Practical Reusable UNIX Software, chapter 11. Wiley, 1995. To appear January 1995.Google Scholar
  5. 5.
    Yih-Farn Chen, Leftheris Koutsofios, and David Rosenblum. Intertool connnections. In Balachander Krishnamurthy, editor, Practical Reusable UNIX Software, chapter 11. John Wiley & Sons, 1995.Google Scholar
  6. 6.
    Yih-Farn Chen, Michael Nishimoto, and C. V. Ramamoorthy. The C Information Abstraction System. IEEE Transactions on Software Engineering, 16(3):325–334, March 1990.CrossRefGoogle Scholar
  7. 7.
    Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, and Ionnis G. Tollis. Dynamic graph drawings: Trees, series-parallel digraphs, and planar st-digraphs. In Proc. Symposium on Computational Geometry, pages 261–270, 1992. to appear in SIAM J. Computing.Google Scholar
  8. 8.
    P. Eades, W. Lai, K. Misue, and K. Sugiyama. Preserving the mental map of a diagram. In Proceedings of Compugraphics 91, pages 24–33, 1991.Google Scholar
  9. 9.
    E.R.Gansner, E. Koutsofios, S.C. North, and K.-P. Vo. A technique for drawing directed graphs. IEEE Trans. on Soft. Eng., 19(3):214–230, 1993.CrossRefGoogle Scholar
  10. 10.
    C. Kosak, J. Marks, and S. Shieber. Automatic the layout of network diagrams with specific visual organization. IEEE Transactions on Systems, Man and Cybernetics, SMC-24(3):440–454, 1994.Google Scholar
  11. 11.
    B. Krishnamurthy and N. Barghouti. Provence: A Process Visualization and Enactment Environment. In Proc. of the Fourth European Conference on Software Engineering, pages 151–160, Garmisch-Partenkirchen, Germany, September 1993. Springer-Verlag. Published as Lecture Notes in Computer Science no. 717.Google Scholar
  12. 12.
    Panagiotis Linos, Vaclav Rajlich, and Bogdan Korel. Layout heuristics for graphical representations of programs. In Proc. IEEE Conf. on Systems, Man and Cybernetics, pages 1127–1131, 1991.Google Scholar
  13. 13.
    K. Lyons. Cluster busting in anchored graph drawing. In Proceedings of the 1992 CAS Conference, pages 7–16, 1992.Google Scholar
  14. 14.
    Kanth Miriyala, Scot W. Hornick, and Roberto Tamassia. An incremental approach to aesthetic graph layout. In Proc. Sixth International Workshop on Computer-Aided Software Engineering, pages 297–308. IEEE Computer Society, July 1993.Google Scholar
  15. 15.
    S. Moen. Drawing dynamic trees. IEEE Software, 7:21–8, 1990.CrossRefGoogle Scholar
  16. 16.
    Stephen C. North. Drawing ranked digraphs with recursive clusters. In Proc. ALCOM Workshop on Graph Drawing '93, September 1993. submitted.Google Scholar
  17. 17.
    Stephen C. North and Eleftherios Koutsofios. Applications of Graph Visualization. In Graphics Interface '94, pages 235–245, 1994.Google Scholar
  18. 18.
    F. Newbery Paulish and W.F. Tichy. Edge: An extendible graph editor. Software — Practice and Experience, 20(S1):1/63–S1/88, 1990. also as Technical Report 8/88, Fakultat fur Informatik, Univ. of Karlsruhe, 1988.Google Scholar
  19. 19.
    L.A. Rowe, M. Davis, E. Messinger, C. Meyer, C. Spirakis, and A. Tuan. A browser for directed graphs. Software — Practice and Experience, 17(1):61–76, 1987.Google Scholar
  20. 20.
    K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Transactions on Systems, Man and Cybernetics, SMC-11(2):109–125, 1981.Google Scholar
  21. 21.
    K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Transactions on Systems, Man and Cybernetics, SMC-11(2):109–125, 1981.Google Scholar

Copyright information

© Springer-Verlag 1996

Authors and Affiliations

  • Stephen C. North
    • 1
  1. 1.Software and Systems Research CenterAT&T Bell LaboratoriesMurray HillUSA

Personalised recommendations