Related Experiment Video
Updated: Jun 5, 2026

The ITS2 Database
Published on: March 12, 2012
Hi-trees and their layout
Kim Marriott1, Peter Sbarski, Tim van Gelder
1Clayton 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.
Related Concept Videos
Phylogenetic Trees
Phylogenetic Trees
Survival Tree
Building a Survival Tree
Constructing a survival tree begins...
Softwoods and Hardwoods
Hybrid Zones
Light Acquisition

