This paper proposes a new method of drawing and designing weighted arborescence, with emphasis on the well distribution and minimizing intercrossing of branches. The principles of two different algorithms of determining local region are designed and discussed. The whole method of drawing the map with out intercrossing is chosen after analysis and experimental comparisons. The effectiveness of the algorithm is shown in the implementation results.
苏勇 . 信息可视化中赋权树形图的绘制实现方法[J]. 现代图书情报技术, 2006, 1(11): 73-76.
Su Yong . A Method of Drawing Weighted Arborescence in Information Visualization. New Technology of Library and Information Service, 2006, 1(11): 73-76.
1李琦，陈少强．走近信息可视化．中国计算机用户，2003（23）：29
2Analysis and Visualization of Network Data using JUNG. http://jung.sourceforge.net/doc/JUNG_journal.pdf（Accessed Jun.1,2006）
3常艳丽. 可视化引文分析系统研究：［学位论文］. 南京：南京大学， 2006
4梁兴建，王小玲.利用Java Applet 动态绘制树型结构图形. 四川理工学院学报（自然科学版）.2006,19（1）:67-70
5张秀梅，吴巍.科研合作网络的可视化及其在文献检索服务中的应用.情报学报.2006(1):9-15
6Fruchterman T M J, Reingold E M. Graph drawing by force-directed placement. Software-Practice and Experience,1991, 21(11) :1129-1164
7耿学华 傅德胜，可视化数据挖掘技术研究.计算机应用软件，2006(2):85-87
8宋绍成，毕强，杨达．信息可视化的基本过程和主要研究领域．情报科学，2004，22（1）：13-18
