2007 6th International Asia-Pacific Symposium on Visualization最新文献

筛选

英文中文

Efficiently drawing a significant spanning tree of a directed graph 有效地绘制有向图的有效生成树

2007 6th International Asia-Pacific Symposium on Visualization Pub Date : 2007-10-15 DOI: 10.1109/APVIS.2007.329275

Martin Harrigan, P. Healy

{"title":"Efficiently drawing a significant spanning tree of a directed graph","authors":"Martin Harrigan, P. Healy","doi":"10.1109/APVIS.2007.329275","DOIUrl":"https://doi.org/10.1109/APVIS.2007.329275","url":null,"abstract":"A directed graph can model any ordered relationship between objects. However, visualizing such graphs can be a challenging task. If the graph is undirected, a popular strategy is to choose a significant spanning tree, nominate a vertex as the root, for example the vertex whose distance from all other vertices is minimal, hang the significant spanning subtrees from this root and add in the remaining edges in some unobtrusive manner. In the directed case the spanning tree is a tree DAG (a directed graph without any undirected cycles) and not simply a directed tree with one appropriate root. It may have multiple sources (vertices with indegree equal to zero) that all warrant root status and so the undirected approach must be modified somewhat. In this paper, we present a method of drawing directed graphs that emphasizes a significant spanning tree. It can be considered a variation of the Sugiyama framework in that it combines two steps of the framework (leveling and crossing minimisation) by finding, in linear time, a leveling of the graph that is level planar with respect to some spanning tree and restricting the permutations of the vertices on each level to those that constitute a level planar embedding of this subgraph. The edges of the spanning tree will therefore not cross each other. Using the globally oriented Fiedler vector we choose permutations of the vertices on each level that reduce the number of crossings between the remaining edges.","PeriodicalId":136557,"journal":{"name":"2007 6th International Asia-Pacific Symposium on Visualization","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121599744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Directed graphs and rectangular layouts 有向图和矩形布局

2007 6th International Asia-Pacific Symposium on Visualization Pub Date : 2007-10-15 DOI: 10.1109/APVIS.2007.329276

A. Buchsbaum, E. Gansner, Suresh Venkatasubramanian

引用次数: 0

Force-directed drawing method for intersecting clustered graphs 聚类相交图的力定向绘制方法

2007 6th International Asia-Pacific Symposium on Visualization Pub Date : 2007-10-15 DOI: 10.1109/APVIS.2007.329280

H. Omote, Kozo Sugiyama

引用次数: 15

首页上一页