Linkless symmetric drawings of series parallel digraphs

Authors:
Seok-Hee Hong;Peter Eades;Jonathan Hillman
Affiliations:
NICTA (National ICT Australia), School of Information Technologies, University of Sydney, Australia;NICTA (National ICT Australia), School of Information Technologies, University of Sydney, Australia;School of Mathematics and Statistics, University of Sydney, Australia
Venue:
Computational Geometry: Theory and Applications
Year:
2004

Citing 20
Cited 3

Geometric symmetry in graphs

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

Discrete Applied Mathematics
Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs

SIAM Journal on Computing
Sachs' linkless embedding conjecture

Journal of Combinatorial Theory Series B
Three-dimensional orthogonal graph drawing algorithms

Discrete Applied Mathematics
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
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Which Aesthetic has the Greatest Effect on Human Understanding?

GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions

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

GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing

GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions

GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Detecting Symmetries by Branch & Cut

GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs

GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
A Group-Theoretic Method for Drawing Graphs Symmetrically

GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs

GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Three-dimensional Grid Drawings of Graphs

GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Optimal three-dimensional orthogonal graph drawing in the general position model

Theoretical Computer Science

National ICT Australia (NICTA)

ACM SIGCOMM Computer Communication Review
Geometric automorphism groups of graphs

Discrete Applied Mathematics
Graph drawing algorithms

Algorithms and theory of computation handbook

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a linear time algorithm for constructing linkless drawings of series parallel digraphs with maximum number of symmetries. Linkless drawing in three dimensions is a natural extension to planar drawing in two dimensions. Symmetry is one of the most important aesthetic criteria in graph drawing. More specifically, we present two algorithms: a symmetry finding algorithm which finds maximum number of three dimensional symmetries, and a drawing algorithm which constructs linkless symmetric drawings of series parallel digraphs in three dimensions.