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
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Finding Planar Geometric Automorphisms in Planar Graphs
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Spring Algorithms and Symmetry
COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
An Heuristic for Graph Symmetry Detection
GD '99 Proceedings of the 7th 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
| Hi-index | 0.00 |
Symmetry is one of the most important aesthetic criteria which clearly reveals the structure of the graph. However, previous work on symmetric graph drawing has focused on two dimensions. In this paper, we extend symmetric graph drawing into three dimensions. Symmetry in three dimensions is much richer than that of two dimensions. We present a linear time algorithm for finding maximum number of three dimensional symmetries in series parallel digraphs.