Lecture Notes in Computer Science Volume 2265, 2002, pp 189-204
Date: 21 Feb 2002

Drawing Graphs Symmetrically in Three Dimensions

* Final gross prices may vary according to local VAT.

Get Access


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.

In this extended abstract, many proofs are omitted. This research has been supported by a grant from the Australian Research Council. Three dimensional drawings are available from http://www.cs.usyd.edu.au/shhong/research7.htm.