An Algorithm for Finding Three Dimensional Symmetry in Trees

Hong, Seok-Hee and Eades, Peter (2001) An Algorithm for Finding Three Dimensional Symmetry in Trees. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000 , pp. 360-371(Official URL: http://dx.doi.org/10.1007/3-540-44541-2_34).

Full text not available from this repository.

Abstract

This paper presents a model for drawing trees symmetrically in three dimensions and a linear time algorithm for finding maximum number of three dimensional symmetries in trees.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-44541-2_34
Classifications: G Algorithms and Complexity > G.910 Symmetries
G Algorithms and Complexity > G.999 Others
M Methods > M.900 Tree
URI: http://gdea.informatik.uni-koeln.de/id/eprint/431

Actions (login required)

View Item View Item