Drawing Graphs Symmetrically in Three Dimensions
- First Online:
- Cite this paper as:
- Hong SH. (2002) Drawing Graphs Symmetrically in Three Dimensions. In: Mutzel P., Jünger M., Leipert S. (eds) Graph Drawing. GD 2001. Lecture Notes in Computer Science, vol 2265. Springer, Berlin, Heidelberg
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.