Three Dimensional Drawings of Bounded Degree Trees

Frati, Fabrizio and Di Battista, Giuseppe (2007) Three Dimensional Drawings of Bounded Degree Trees. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006 , pp. 89-94(Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_10).

Full text not available from this repository.

Abstract

We show an algorithm for constructing 3D straight-line drawings of balanced constant degree trees. The drawings have linear volume and optimal aspect ratio. As a side effect, we also give an algorithm for constructing 2D drawings of balanced constant degree trees in linear area, with optimal aspect ratio and with better angular resolution with respect to the one of [8]. Further, we present an algorithm for constructing 3D poly-line drawings of trees whose degree is bounded by n^{1/3} in linear volume and with optimal aspect ratio.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-540-70904-6_10
Classifications: M Methods > M.900 Tree
P Styles > P.060 3D
URI: http://gdea.informatik.uni-koeln.de/id/eprint/764

Actions (login required)

View Item View Item