A Fast Three-dimensional Multilevel Algorithm for Drawing Large General Graphs
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.
graph drawing multilevel method force-directed algorithm
Zhou Weihua Huang Jingwei
国际会议
The International Conference Information Computing and Automation(2007国际信息计算与自动化会议)
成都
英文
856-859
2007-12-19（万方平台首次上网日期，不代表论文的发表时间）