SeokHee Hong and Peter Eades, Drawing Trees Symmetrically in Three Dimensions, Algorithmica, Vol. 36, No. 2, pp. 153178, 2003.
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 threedimensional symmetries in trees. We also present a threedimensional symmetric drawing algorithm for trees. 
SeokHee Hong and Peter Eades, An Algorithm for Finding Three Dimensional Symmetry in Trees, Proceeding of Graph Drawing 2000, Lecture Notes in Computer Science 1984, Springer, pp. 360371, 2000.
This paper presents a model for drawing trees symmetrically
in three dimensions and a linear time algorithm for nding maximum
number of three dimensional symmetries in trees.
