2007 | OriginalPaper | Chapter
Three-Dimensional Drawings of Bounded Degree Trees
Authors : Fabrizio Frati, Giuseppe Di Battista
Published in: Graph Drawing
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We show an algorithm for constructing 3
D
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 2
D
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 3
D
poly-line drawings of trees whose degree is bounded by
n
1/3
in linear volume and with optimal aspect ratio.