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.
Chapter PDF
Similar content being viewed by others
References
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.
G. Di Battista and R. Tamassia. Incremental planarity testing. In Proc. 30th IEEE Symp. on Foundations of Computer Science, pages 436–441, 1989.
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.
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.
Yih-Farn Chen, Leftheris Koutsofios, and David Rosenblum. Intertool connnections. In Balachander Krishnamurthy, editor, Practical Reusable UNIX Software, chapter 11. John Wiley & Sons, 1995.
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.
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.
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.
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.
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.
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.
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.
K. Lyons. Cluster busting in anchored graph drawing. In Proceedings of the 1992 CAS Conference, pages 7–16, 1992.
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.
S. Moen. Drawing dynamic trees. IEEE Software, 7:21–8, 1990.
Stephen C. North. Drawing ranked digraphs with recursive clusters. In Proc. ALCOM Workshop on Graph Drawing '93, September 1993. submitted.
Stephen C. North and Eleftherios Koutsofios. Applications of Graph Visualization. In Graphics Interface '94, pages 235–245, 1994.
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.
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.
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.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
North, S.C. (1996). Incremental layout in DynaDAG. In: Brandenburg, F.J. (eds) Graph Drawing. GD 1995. Lecture Notes in Computer Science, vol 1027. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021824
Download citation
DOI: https://doi.org/10.1007/BFb0021824
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60723-6
Online ISBN: 978-3-540-49351-8
eBook Packages: Springer Book Archive
Keywords
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.
