Drawing non‐layered tidy trees in linear time. (19th July 2013)

• Record Type: Journal Article
• Authors: van der Ploeg, Atze
• Is Part Of: Software, practice & experience. Volume 44:Number 12(2014)
• Page Start: 1467
• Page End: 1484
• Publication Date: 2013-07-19
• Subjects: Computer software -- Periodicals; Computer programming -- Periodicals; Computer programs -- Periodicals; 005.3
• DOI: 10.1002/spe.2213
• Languages: English
• ISSNs: 0038-0644

Abstract

<abstract abstract-type="main" id="spe2213-abs-0001"> <title>SUMMARY</title> <p id="spe2213-para-0001">The well‐known Reingold–Tilford algorithm produces tidy‐<italic>layered</italic> drawings of trees: drawings where all nodes at the same depth are vertically aligned. However, when nodes have varying heights, layered drawing may use more vertical space than necessary. A <italic>non‐layered</italic> drawing of a tree places children at a fixed distance from the parent, thereby giving a more vertically compact drawing. Moreover, non‐layered drawings can also be used to draw trees where the vertical position of each node is given, by adding dummy nodes. In this paper, we present the first linear‐time algorithm for producing non‐layered drawings. Our algorithm is a modification of the Reingold–Tilford algorithm, but the original complexity proof of the Reingold–Tilford algorithm uses an invariant that does not hold for the non‐layered case. We give an alternative proof of the algorithm and its extension to non‐layered drawings. To improve drawings of trees of unbounded degree, extensions to the Reingold–Tilford algorithm have been proposed. These extensions also work in the non‐layered case, but we show that they then cause a <italic>O</italic>(<italic>n</italic>²) run‐time. We then propose a modification to these extensions that restores the <italic>O</italic>(<italic>n</italic>) run‐time. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p> </abstract>