A fast three-dimensional multilevel algorithm for drawing large general graphs

被引：0

作者：

Zhou Weihua ^{[1
]}

Huang Jingwei ^{[1
]}

机构：

[1] Wuhan Univ, Comp Sch, Wuhan, Peoples R China

来源：

PROCEEDINGS OF THE INTERNATIONAL CONFERENCE INFORMATION COMPUTING AND AUTOMATION, VOLS 1-3 | 2008年

关键词：

graph drawing; multilevel method; force-directed algorithm;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper presents a fast algorithm for drawing large general graphs with straight-line edges in the three-dimensional space, which employs the multilevel method as the framework of drawing large graphs, and adopts the force-directed algorithm combined with the bary-centralizing method to refine the single-level layouts. Also, two speed-up methods, the constraint-normalization and oct-tree space decomposition are used. Experiments show its fast speed and nice results. It's capable of nicely drawing 10,000 vertex graphs in around 40 seconds. Furthermore, we illustrate its practicality in exploring the large graphs.

引用

页码：856 / 859

页数：4

共 14 条

[1]

[Anonymous], 2001, LNCS

[2]

[Anonymous], LECT NOTES COMPUTER

[3] A HIERARCHICAL O(N-LOG-N) FORCE-CALCULATION ALGORITHM [J].