Symmetric Drawings of Planar Graphs in Three Dimensions


Seok-Hee Hong, Drawing Graphs Symmetrically in Three Dimensions, Proceeding of GD01, LNCS 2265, Springer Verlag, pp. 189-204, 2002.

In this paper, we investigate symmetric graph drawing in three dimensions. We show that the problem of drawing a graph with a maximum number of symmetries in three dimensions is NP-hard. Then we present a polynomial time algorithm for finding maximum number of three dimensional symmetries in planar graphs.


For Viewing large drawings, pls click the drawings.


 
R-node: Fig1 (a)
Animated Gif
 
S-node: Fig1 (b)
Animated Gif
 
P-node: Fig2 (a)
Animated Gif
 
Special case: Fig2 (b)
Animated Gif
 
B-center: Fig3 (a)
Animated Gif
AVI
 
c-center: Fig3 (b)
Animated Gif
AVI
 
B-center
Animated Gif
AVI
 
c-cente
Animated Gif
 
Icosahedron