Issue No. 03 - March (2011 vol. 17)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TVCG.2010.45
Kim Marriott , Monash University, Clayton
Peter Sbarski , 1/42 Elizabeth Str, Bentleigh East
Tim van Gelder , Austhink Consulting, Melbourne
Daniel Prager , Austhink Software, Victoria
Andy Bulka , Magian Design Studio, Wyndham Vale
We introduce hi-trees, a new visual representation for hierarchical data in which, depending on the kind of parent node, the child relationship is represented using either containment or links. We give a drawing convention for hi-trees based on the standard layered drawing convention for rooted trees, then show how to extend standard bottom-up tree layout algorithms to draw hi-trees in this convention. We also explore a number of other more compact layout styles for layout of larger hi-trees and give algorithms for computing these. Finally, we describe two applications of hi-trees: argument mapping and business decision support.
Tree layout, hi-tree, argument mapping, decision support, information visualization.
A. Bulka, D. Prager, P. Sbarski, K. Marriott and T. van Gelder, "Hi-Trees and Their Layout," in IEEE Transactions on Visualization & Computer Graphics, vol. 17, no. , pp. 290-304, 2010.