PLANET: A radial layout algorithm for network visualization
PLANET: A radial layout algorithm for network visualization
复制标题
PLANET：一种用于网络可视化的径向布局算法
DOI：
10.1016/j.physa.2019.122948
复制
发表时间：
2020-02-01
影响因子：
3.3
通讯作者：
Lu，Xin
中科院分区：
文献类型：
--
作者：
Huang，Ge;Li，Yong;Lu，Xin
树布局是网络可视化的关键方法之一，对于探索网络的层次结构特别重要。然而，整体网络结构及其层次关系的可视化很少能同时优化。本文提出了一种称为PLANET的放射状布局算法，使用户能够从根节点探索网络结构，同时保持可读性。为了均匀分布节点并最大限度地减少边缘交叉，我们定义了一系列显示子节点的角度分配规则，可以自动最大化父节点和子节点之间的可调角度，并均匀划分子节点的角度。使用这些规则，可以适当地传达网络的结构属性，例如枢纽，并且可以保证远离根的节点的可读性。我们的实验结果表明，PLANET是类似的算法在执行时间方面，并提供更好的性能，在节点分布，方差的边长度和边交叉的数量，这些优势变得更大的网络与大直径。
Tree layouts are among the key approaches for network visualization, and are of particular importance for exploring the hierarchical structure of networks. However, visualizations of the overall network structure and its hierarchical relationships can rarely be optimized simultaneously. This paper presents a radial layout algorithm called PLANET that enables users to explore the network structure from a root node, while maintaining readability. In order to distribute the nodes evenly and minimize edge crossings, we define a list of angle assignment rules for displaying child nodes which can automatically maximize the tunable angles between parent and child nodes, and to uniformly divide the angles of child nodes. Using these rules, the structural properties of the network such as hubs can be properly conveyed, and the readability of nodes that are far from the root can be guaranteed. Our experimental results show that PLANET is comparable to similar algorithms in terms of execution time, and gives better performance in terms of node distribution, variance of edge length and number of edge crossing; these advantages become greater for networks with large diameters.