Abstract
Spring algorithms are effective tools for visualizing undirected graphs. One major feature of applying spring algorithms is to display symmetric structures of graphs. This feature has been confirmed by numerous experiments. In this paper, we firstly formalize the concepts of graph symmetries in terms of “reflectional” and “rotational” automorphisms; and characterize the types of symmetries, which can be displayed simultaneously by a graph layout, in terms of “geometric” automorphism groups. We show that our formalization is complete. Secondly, we provide general theoretical evidence of why spring algorithms can display graph symmetry. Finally, the strength of our general theorem is demonstrated from its application to several existing spring algorithms.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. A. Bondy and U. S. R. Murty, Graph theory with application, The Macmilan Press LTD, 1977.
B. Becker and G. Hotz, On the optimal layout of planar graphs with fixed boundary, SIAM J. COMPT. 16(15), 1987.
G. Di Battista, P. Eades and R. Tamassia, Algorithms for drawing graphs: an annotated bibliography, Computational Geometry: Theory and Application, 4, 235–282, 1994.
P. Eades, A heuristic for graph drawing, Congressus Numerantium, 42, 149–160, 1984.
P. Eades and X. Lin, Spring Algorithms and Symmetry, Technical Report, Department of Computer Science, The University of Newcastle, Australia, 1996.
T. Fruchterman and E. Reingold, Graph Drawing by Force-Directed Placement, Software-Practice and Experience, 21, 1129–1164, 1991.
T. Kamada and S. Kawai, An Algorithm for Drawing General Undirected Graphs, Information Processing Letters, 31, 7–15, 1989.
X. Lin, Analysis of Algorithms for Drawing Graphs, PHD thesis, University of Queensland, 1992.
R. Lipton, S. North and J. Sandberg, A Method for Drawing Graphs, Proc. ACM Symp. on Computational Geometry, 153–160, 1985.
J. Manning, Geometric Symmetry in Graphs, PHD thesis, Purdue University, 1990.
G. E. Martin, Transformation Geometry — An Introduction to Symmetry, Springer Verlag, 1982.
F. W. Sears and M. W. Zemansky, University Physics, Addition-Wesley, 1963.
A. E. Taylor, Advanced Calculus, Ginn, 1955.
K. Sugiyama and K. Misue, Graph drawing by the magnetic spring model, Journal of Visual Languages and Computing 6 (3) (1995), 217–232.
D. Tunkelang, A practical approach to drawing undirected graphs, Technical Report, Canegie Mellon University 1994.
W. T. Tutte, How to draw a graph, Proc. London Math. Soc. 13(3), 304–320, 1963.
H. Wielandt, Finite permutation groups, Academic Press Inc., 1964.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eades, P., Lin, X. (1997). Spring algorithms and symmetry. In: Jiang, T., Lee, D.T. (eds) Computing and Combinatorics. COCOON 1997. Lecture Notes in Computer Science, vol 1276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0045087
Download citation
DOI: https://doi.org/10.1007/BFb0045087
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63357-0
Online ISBN: 978-3-540-69522-6
eBook Packages: Springer Book Archive