By Topic

A Practical Algorithm for Planar Straight-line Grid Drawings of General Trees with Linear Area and Arbitrary Aspect Ratio

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Rusu, A. ; Rowan Univ., Glassboro ; Santiago, C.

Trees are usually drawn using planar straight-line drawings. [2] presented an algorithm for constructing a planar straight-line grid drawing of a degree-d (general) tree with area 0(eta) and any pre-specified aspect ratio in the range [eta-alpha,eta alpha], where 0 < alpha < 1 is any constant, in O(etalogeta) time. Unfortunately, the algorithm of [2] is not suitable for practical use. The main problem is that the constant hidden in the "Oh " notation for area is quite large (for binary trees was 3900). In this paper, we have made several improvements to the algorithm, which make it suitable for practical use. We have also conducted an experiment on this newer version of the algorithm for randomly-generated general trees with up to 50,000 nodes. Our experiment shows that it constructs area-efficient drawings in practice, with area at most 19 times the number of nodes.

Published in:

Information Visualization, 2007. IV '07. 11th International Conference

Date of Conference:

4-6 July 2007