Spring algorithms and symmetry
Spring algorithms are regarded as effective tools for visualizing undirected graphs. One major feature of applying spring algorithms is to display symmetric properties of graphs. This feature has been confirmed by numerous experiments. In this paper, firstly we formalize the concepts of graph symmet...
Saved in:
| Published in: | Theoretical computer science Vol. 240; no. 2; pp. 379 - 405 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
17.06.2000
|
| ISSN: | 0304-3975, 1879-2294 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Spring algorithms are regarded as effective tools for visualizing undirected graphs. One major feature of applying spring algorithms is to display symmetric properties of graphs. This feature has been confirmed by numerous experiments. In this paper, firstly we 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 many spring algorithms can display graph symmetry. Finally, the strength of our general theorem is demonstrated from its application to several existing spring algorithms. |
|---|---|
| ISSN: | 0304-3975 1879-2294 |
| DOI: | 10.1016/S0304-3975(99)00239-X |