title: Hi-trees and their layout.
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.
authors.affiliation: Clayton School of IT, Monash University, Wellington Rd, Clayton, Vic 3800, Australia. kim.marriott@infotech.monash.edu.au
authors.forename: Kim
authors.initials: K
authors.lastname: Marriott
authors.forename: Peter
authors.initials: P
authors.lastname: Sbarski
authors.forename: Tim
authors.initials: T
authors.lastname: van Gelder
authors.forename: Daniel
authors.initials: D
authors.lastname: Prager
authors.forename: Andy
authors.initials: A
authors.lastname: Bulka
mesh_terms: D000465:Algorithms; D019295:Computational Biology / Q000379:methods*; D003663:Decision Trees