Architecture and applications of the Hy+ visualization system
IBM Systems Journal
Improving Walker's Algorithm to Run in Linear Time
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
AdaptiviTree: Adaptive Tree Visualization for Tournament-Style Brackets
IEEE Transactions on Visualization and Computer Graphics
An environment for supporting active learning in courses on language processing
Proceedings of the 13th annual conference on Innovation and technology in computer science education
Visualizing Argument Structure
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing
An improved generalized tree layout algorithm
CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 2
Drawing trees with perfect angular resolution and polynomial area
GD'10 Proceedings of the 18th international conference on Graph drawing
GD'05 Proceedings of the 13th international conference on Graph Drawing
The aesthetics of graph visualization
Computational Aesthetics'07 Proceedings of the Third Eurographics conference on Computational Aesthetics in Graphics, Visualization and Imaging
The aesthetics of rapidly-exploring random trees
Proceedings of the Symposium on Computational Aesthetics
| Hi-index | 0.00 |
Trees are extremely common data structures, both as internal objects and as models for program output. But it is unusual to see a program actually draw trees for visual inspection. Although part of the difficulty lies in programming graphics devices, most of the problem arises because naive algorithms to draw trees use too much drawing space and sophisticated algorithms are not obvious. We survey two naive tree drawers, formalize aesthetics for tidy trees, and descnbe two algorithms which draw tidy trees. One of the algorithms may be shown to require the minimum possible paper width. Along with the algorithms proper, we discuss the reasoning behind the algorithm development.