Drawing trees nicely with T2EX
Electronic Publishing—Origination, Dissemination, and Design
A node-positioning algorithm for general trees
Software—Practice & Experience
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
A Technique for Drawing Directed Graphs
IEEE Transactions on Software Engineering
Improving Walker's Algorithm to Run in Linear Time
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
Automated extensible XML tree diagrams
Proceedings of the 9th ACM symposium on Document engineering
| Hi-index | 0.00 |
The standard layered drawing convention for trees in which the vertical placement of a node is given by its level in the tree and each node is centered between its children can lead to drawings which are quite wide. We present two new drawing conventions which reduce the layout width to be less than some maximum width while still maintaining the essential layered drawing convention. These conventions relax the requirement that a parent must be exactly placed midway between its children, and instead make this a preference which can be violated if this is required for the layout to fit into the required width. Both drawing conventions give rise to a simple kind of quadratic programming problem. We give an iterative gradient projection algorithm for solving this kind of problem, and also a linear time heuristic algorithm. Our algorithms are practical: a tree with three thousand nodes can be laid out in less than a hundred milliseconds with either algorithm.