International Symposium on Graph Drawing

GD 2001: Graph Drawing pp 189-204

Drawing Graphs Symmetrically in Three Dimensions

  • Seok-Hee Hong
Conference paper

DOI: 10.1007/3-540-45848-4_16

Volume 2265 of the book series Lecture Notes in Computer Science (LNCS)
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

Abstract

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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Seok-Hee Hong
    • 1
  1. 1.Basser Department of Computer ScienceUniversity of SydneyAustralia