Abstract
The VCG tool allows to visualize graphs that occur typically as data structures in programs. We describe the functionality of the VCG tool, its layout algorithm and its heuristics. Our main emphasis in the selection of methods is to achieve a very good performance for the layout of large graphs. The tool supports the partitioning of edges and nodes into edge classes and nested subgraphs, the folding of regions, and the management of priorities of edges. The algorithm produces good drawings and runs reasonably fast even on very large graphs.
The full article is available as Technical Report A03/94, Universität des Saarlandes, FB 14 Informatik, 1994, and via ftp from ftp.cs.uni-sb.de (134.96.7.254), file /pub/graphics/vcg/doc/tr-A03-94.ps.gz.
This work is supported by the ESPRIT Project #5399 COMPARE
Chapter PDF
Similar content being viewed by others
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.
References
Alt, M.; Aßmann, U; Someren, H: Cosy Compiler Phase Embedding with the CoSy Compiler Model, in Fritzson, P.A.: Compiler Construction, 5th International Conference, CC '94, Proceedings, Lecture Notes in Computer Science 786, pp. 278–293, Springer Verlag 1994
Battista, G.D.; Eades, P.; Tamassia, R.: Algorithms for Drawing Graphs: An Annotated Bibliography, avail. ftp at wilma.cs.brown.edu, /pub/gdbiblio.tex 1993; a prev. version was avail. as technical report CS-89-09, Brown University, Department of Computer Science, Providence RI, Oct. 1989
Bentley, J.L.; Ottmann, T.A.: Algorithms for Reporting and Counting Geometric Intersections, IEEE Trans. on Computers, Vol. C 28, No. 9, pp. 643–647, 1979
Brandenburg, F.J.: Nice Drawings of Graphs are Computationally Hard, Visualization in Human Computer Interaction, Lecture Notes in Computer Science 439, pp. 1–15, Springer Verlag 1990
Eades, P.; Wormald N.: The median heuristic for drawing 2-layers networks, technical report 69, Department of Computer Science, University of Queensland, 1986
Eades, P.; McKay B.; Wormald N.: On an edge crossing problem, Proc. 9th Australian Computer Science Conf., pp. 327–334, 1986
Fruchterman, T.M.J.; Reingold, E.M.: Graph drawing by forcedirected placement, Software — Practice and Experience, Vol. 21, pp. 1129–1164, 1991
Gansner, E.R.; Koutsofios, E.; North, S.C.; Vo, K.: A Technique for Drawing Directed Graphs, IEEE Trans. on Software Engineering, Vol. 19, No. 3, pp. 214–230, March, 1993
Heckmann, R.; Sander, G.: TrafoLa-H Reference Manual, in Hoffmann, Berthold; Krieg-Brückner, Bernd, Editors: Program Development by Specification and Transformation, Lecture Notes in Computer Science 680, Springer Verlag 1993
Kamada, T.; Kawai, S.: An algorithm for drawing general undirected graphs, Information Processing Letters 31, pp. 7–15, 1989
Lemke, I: Entwicklung und Implementierung eines Visualisierungswerkzeuges für Anwendungen im Übersetzerbau, Universität des Saarlandes, Saarbrücken, Germany, Fachbereich 14 Informatik, (to appear, in German) 1994
Paulisch, F.N.; Tichy, W.F.: EDGE: An Extendible Graph Editor, Software —Practice and Experience, Vol. 20, No. S1, pp. 63–88, June 1990
Sugiyama, K.; Tagawa, S.; Toda, M.: Methods for visual understanding of hierarchical system structures, IEEE Trans. on Systems, Man, and Cybernetics SMC-11, No. 2, pp. 109–125, Feb. 1981
Warfield, N.J.: Crossing theory and hierarchy mapping, IEEE Trans. on Systems, Man, and Cybernetics SMC-7, No. 7, pp. 505–523, Feb. 1977
Wilhelm, Reinhard; Maurer, Dieter: Übersetzerbau: Theory, Konstruktion, Generierung, Springer Verlag 1992, English Version to appear with Addison Wesley
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sander, G. (1995). Graph layout through the VCG tool. In: Tamassia, R., Tollis, I.G. (eds) Graph Drawing. GD 1994. Lecture Notes in Computer Science, vol 894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58950-3_371
Download citation
DOI: https://doi.org/10.1007/3-540-58950-3_371
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58950-1
Online ISBN: 978-3-540-49155-2
eBook Packages: Springer Book Archive