Pierre-Yves Koenig, G. Melançon, C. Bohan, B. Gautier
{"title":"Combining DagMaps and Sugiyama Layout for the Navigation of Hierarchical Data","authors":"Pierre-Yves Koenig, G. Melançon, C. Bohan, B. Gautier","doi":"10.1109/IV.2007.36","DOIUrl":null,"url":null,"abstract":"This paper presents a novel technique for exploring and navigating large hierarchies, not restricted to trees but to directed acyclic graphs (DAGs). The technique combines two different visualizations emphasizing different points of view the user can adopt when analyzing the content of the hierarchy. Usual hierarchical (node-link) layout reflect the relative position of nodes in the hierarchy while a variation of a treemap emphasizes node attributes. The classical treemap algorithm has been adapted in order to deal with DAGs. Linking the two views enables the user to visually and interactively explore elements of the hierarchy with respect to selected attributes, while being able to locate the node in the DAG.","PeriodicalId":177429,"journal":{"name":"2007 11th International Conference Information Visualization (IV '07)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 11th International Conference Information Visualization (IV '07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IV.2007.36","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13
Abstract
This paper presents a novel technique for exploring and navigating large hierarchies, not restricted to trees but to directed acyclic graphs (DAGs). The technique combines two different visualizations emphasizing different points of view the user can adopt when analyzing the content of the hierarchy. Usual hierarchical (node-link) layout reflect the relative position of nodes in the hierarchy while a variation of a treemap emphasizes node attributes. The classical treemap algorithm has been adapted in order to deal with DAGs. Linking the two views enables the user to visually and interactively explore elements of the hierarchy with respect to selected attributes, while being able to locate the node in the DAG.