Research Output

Exploring multiple trees through DAG representations.

  We present a Directed Acyclic Graph visualisation designed to allow interaction with a set of multiple classification trees, specifically to find overlaps and differences between groups of trees and individual trees. The work is motivated by the need to find a representation for multiple trees that has the space-saving property of a general graph representation and the intuitive parent-child direction cues present in individual representation of trees. Using example taxonomic data sets, we describe augmentations to the common barycenter DAG layout method that reveal shared sets of child nodes between common parents in a clearer manner. Other interactions such as displaying the multiple ancestor paths of a node when it occurs in several trees, and revealing intersecting sibling sets within the context of a single DAG representation are also discussed.

  • Type:

    Article

  • Date:

    31 October 2007

  • Publication Status:

    Published

  • DOI:

    10.1109/TVCG.2007.70556

  • ISSN:

    1077-2626

  • Library of Congress:

    QA75 Electronic computers. Computer science

  • Dewey Decimal Classification:

    004 Data processing & computer science

Citation

Graham, M. & Kennedy, J. (2007). Exploring multiple trees through DAG representations. IEEE Transactions on Visualization and Computer Graphics. 13, 1294-1301. doi:10.1109/TVCG.2007.70556. ISSN 1077-2626

Authors

Keywords

Computer programming; Program architecture; Multiple trees; Taxonomy; Visualisation; Directed Acyclic Graph.

Available Documents