Graph visualization efficiency of popular web-based libraries

被引:0
作者
Zhao, Xin [1 ]
Wang, Xuan [1 ]
Zou, Xianzhe [1 ]
Liang, Huiming [1 ]
Bai, Genghuai [1 ]
Zhang, Ning [2 ]
Huang, Xin [2 ]
Zhou, Fangfang [1 ]
Zhao, Ying [1 ]
机构
[1] Cent South Univ, Sch Comp Sci & Engn, Changsha 410083, Hunan, Peoples R China
[2] Qi An Xin Technol Grp Inc, QAX Secur Ctr, Beijing 100044, Peoples R China
基金
中国国家自然科学基金;
关键词
Graph visualization; Node-link diagram; Web-based visualization; Visualization library; LARGE-SCALE GRAPHS; NETWORK; LAYOUT;
D O I
10.1186/s42492-025-00193-y
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Web-based libraries, such as D3.js, ECharts.js, and G6.js, are widely used to generate node-link graph visualizations. These libraries allow users to call application programming interfaces (APIs) without identifying the details of the encapsulated techniques such as graph layout algorithms and graph rendering methods. Efficiency requirements, such as visualizing a graph with 3k nodes and 4k edges within 1 min at a frame rate of 30 fps, are crucial for selecting a proper library because libraries generally present different characteristics owing to the diversity of encapsulated techniques. However, existing studies have mainly focused on verifying the advantages of a new layout algorithm or rendering method from a theoretical viewpoint independent of specific web-based libraries. Their conclusions are difficult for end users to understand and utilize. Therefore, a trial-and-error selection process is required. This study addresses this gap by conducting an empirical experiment to evaluate the performance of web-based libraries. The experiment involves popular libraries and hundreds of graph datasets covering node scales from 100 to 200k and edge-to-node ratios from 1 to 10 (including complete graphs). The experimental results are the time costs and frame rates recorded using the libraries to visualize the datasets. The authors analyze the performance characteristics of each library in depth based on the results and organize the results and findings into application-oriented guidelines. Additionally, they present three usage cases to illustrate how the guidelines can be applied in practice. These guidelines offer user-friendly and reliable recommendations, aiding users in quickly selecting the desired web-based libraries based on their specific efficiency requirements for node-link graph visualizations.
引用
收藏
页数:17
相关论文
共 62 条
[1]  
Angel E., 2017, ACM SIGGRAPH 2017 CO, DOI [DOI 10.1145/3084873.3084875, 10.1145/30848 73.3084875]
[2]   OpenGL ES 1.1 implementation based on OpenGL [J].
Baek, Nakhoon ;
Lee, Hwanyong .
MULTIMEDIA TOOLS AND APPLICATIONS, 2012, 57 (03) :669-685
[3]   Scale-Free Networks: A Decade and Beyond [J].
Barabasi, Albert-Laszlo .
SCIENCE, 2009, 325 (5939) :412-413
[4]   A HIERARCHICAL O(N-LOG-N) FORCE-CALCULATION ALGORITHM [J].
BARNES, J ;
HUT, P .
NATURE, 1986, 324 (6096) :446-449
[5]  
Batagelj V, 2004, MATH VIS, P77
[6]   D3: Data-Driven Documents [J].
Bostock, Michael ;
Ogievetsky, Vadim ;
Heer, Jeffrey .
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2011, 17 (12) :2301-2309
[7]  
Brandes U, 2007, LECT NOTES COMPUT SC, V4372, P42
[8]   Dynamic graph exploration by interactively linked node-link diagrams and matrix visualizations [J].
Burch, Michael ;
ten Brinke, Kiet Bennema ;
Castella, Adrien ;
Peters, Ghassen Karray Sebastiaan ;
Shteriyanov, Vasil ;
Vlasvinkel, Rinse .
VISUAL COMPUTING FOR INDUSTRY BIOMEDICINE AND ART, 2021, 4 (01)
[9]   A survey on visualization approaches for exploring association relationships in graph data [J].
Chen, Yi ;
Guan, Zeli ;
Zhang, Rong ;
Du, Xiaomin ;
Wang, Yunhai .
JOURNAL OF VISUALIZATION, 2019, 22 (03) :625-639
[10]  
Coene JP, 2018, J Open Source Software, V3, P814, DOI [10.21105/joss.00814, DOI 10.21105/JOSS.00814, 10.21105/JOSS.00814]