Algorithmica

, Volume 36, Issue 2, pp 153–178 | Cite as

Drawing Trees Symmetrically in Three Dimensions

  • Hong
  • Eades
Article

Abstract

Symmetric graph drawing enables a clear understanding of the structure of the graph. Previous work on symmetric graph drawing has focused on two dimensions. Symmetry in three dimensions is much richer than that of two dimensions. This is the first paper to extend symmetric graph drawing into three dimensions. More specifically, the paper investigates the problem of drawing trees symmetrically in three dimensions. First, we suggest a model for drawing trees symmetrically in three dimensions. Based on this model, we present a linear time algorithm for finding the maximum number of three-dimensional symmetries in trees. We also present a three-dimensional symmetric drawing algorithm for trees.

Keywords

Graph drawing Symmetry Tree Three dimensions Geometric automorphism 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York Inc. 2003

Authors and Affiliations

  • Hong
    • 1
  • Eades
    • 1
  1. 1.School of Information Technologies, University of SydneySydneyAustralia

Personalised recommendations