Format

Send to

Choose Destination
IEEE Trans Vis Comput Graph. 2011 Mar;17(3):290-304. doi: 10.1109/TVCG.2010.45.

Hi-trees and their layout.

Author information

1
Clayton School of IT, Monash University, Wellington Rd, Clayton, Vic 3800, Australia. kim.marriott@infotech.monash.edu.au

Abstract

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.

PMID:
21233514
DOI:
10.1109/TVCG.2010.45
[Indexed for MEDLINE]

Supplemental Content

Full text links

Icon for IEEE Engineering in Medicine and Biology Society
Loading ...
Support Center