复杂网络可视化是关系图的可视化及其相关作图算法的基础,在处理大规模网络时都会面临性能和可阅读性的问题.定义了“边强度”,提出了基于“边强度”的分裂算法,量化了社团结构,定义了“社团网络”的两个重要属性,并提出了网络分割算法；提出了一种“多级抽象”的思想来降低大规模网络的可视化规模；最后应用经典的“力导引”模型作图算法对不同抽象层次的网络可视化呈现,并提供交互性视图.%The complex network visualization is the foundation of the relationship between the visualization and related graphic chart algorithm. In dealing with large network one would face the problems of network's performance and readability. The"edgc strength" was difined, splitting algorithm was put forward based on the "edge", community structure was quantified, two important attributes of community network were defined, and a network segmentation algorithm was put forward; a multistage abstract thought to reduce the massive network of visual scale was proposed; the application of the classical "force guidance" drawing algorithm model to different level of abstraction network visualization was carried out, and the interactive view was given.
展开▼
