Symmetric drawings of triconnected planar graphs

Authors:
Seok-Hee Hong;Brendan McKay;Peter Eades
Affiliations:
University of Sydney, Australia;Australian National University, Australia;University of Sydney, Australia
Venue:
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2002

Citing 8
Cited 7

Geometric symmetry in graphs

Geometric symmetry in graphs
Fast detection and display of symmetry in outerplanar graphs

Discrete Applied Mathematics
Automorphism groups, isomorphism, reconstruction

Handbook of combinatorics (vol. 2)
Drawing series parallel digraphs symmetrically

Computational Geometry: Theory and Applications
Spring algorithms and symmetry

Theoretical Computer Science - computing and combinatorics
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
Which Aesthetic has the Greatest Effect on Human Understanding?

GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Drawing Graphs Symmetrically in Three Dimensions

GD '01 Revised Papers from the 9th International Symposium on Graph Drawing

Crossing Minimization for Symmetries

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Computing and Drawing Isomorphic Subgraphs

GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Linkless symmetric drawings of series parallel digraphs

Computational Geometry: Theory and Applications
Puzzle generators and symmetric puzzle layout

APVis '05 proceedings of the 2005 Asia-Pacific symposium on Information visualisation - Volume 45
Geometric automorphism groups of graphs

Discrete Applied Mathematics
Generating unlabeled connected cubic planar graphs uniformly at random

Random Structures & Algorithms
A linear time algorithm for constructing maximally symmetric straight-line drawings of planar graphs

GD'04 Proceedings of the 12th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Symmetry is one of the most important aesthetic criteria in graph drawing because it reveals structure in the graph. To draw graphs symmetrically, we need two steps. The first step is to find appropriate automorphisms. The second step is to draw the graph to display the automorphisms. Our aim in this paper is to construct maximally symmetric straight-line drawings of triconnected planar graphs in linear time. Previously known algorithms run in quadratic time. We show that an algorithm of Fontet can be used to find an embedding in the plane with the maximum number of symmetries, and present a new algorithm for finding a straight line drawing that achieves that maximum. Both algorithms run in linear time.