A linear time algorithm for constructing maximally symmetric straight-line drawings of planar graphs

Authors:
Seok-Hee Hong;Peter Eades
Affiliations:
National ICT Australia/ School of Information Technologies, University of Sydney, Australia;National ICT Australia/ School of Information Technologies, University of Sydney, Australia
Venue:
GD'04 Proceedings of the 12th international conference on Graph Drawing
Year:
2004

Citing 8
Cited 2

Geometric symmetry in graphs

Geometric symmetry in graphs
Automorphism groups, isomorphism, reconstruction

Handbook of combinatorics (vol. 2)
On-Line Planarity Testing

SIAM Journal on Computing
Drawing series parallel digraphs symmetrically

Computational Geometry: Theory and Applications
Spring algorithms and symmetry

Theoretical Computer Science - computing and combinatorics
Symmetric drawings of triconnected planar graphs

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Finding Planar Geometric Automorphisms in Planar Graphs

ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a linear time algorithm for constructing maximally symmetric straight-line drawings of biconnected and one-connected planar graphs.