{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T22:06:55Z","timestamp":1781820415684,"version":"3.54.5"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T00:00:00Z","timestamp":1746662400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T00:00:00Z","timestamp":1746662400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272480, 62472444"],"award-info":[{"award-number":["62272480, 62472444"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Vis. Comput. Ind. Biomed. Art"],"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>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.<\/jats:p>","DOI":"10.1186\/s42492-025-00193-y","type":"journal-article","created":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T08:44:52Z","timestamp":1746693892000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Graph visualization efficiency of popular web-based libraries"],"prefix":"10.1186","volume":"8","author":[{"given":"Xin","family":"Zhao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xianzhe","family":"Zou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huiming","family":"Liang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Genghuai","family":"Bai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ning","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xin","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fangfang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4200-5200","authenticated-orcid":false,"given":"Ying","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,5,8]]},"reference":[{"key":"193_CR1","doi-asserted-by":"publisher","unstructured":"Chen Y, Guan ZL, Zhang R, Du XM, Wang YH (2019) A survey on visualization approaches for exploring association relationships in graph data. J Vis 22(3):625\u201339. https:\/\/doi.org\/10.1007\/s12650-019-00551-y","DOI":"10.1007\/s12650-019-00551-y"},{"key":"193_CR2","doi-asserted-by":"publisher","unstructured":"Zhao Y, Jiang HJ, Chen QA, Qin YQ, Xie HX, Wu YT et al (2021) Preserving minority structures in graph sampling. IEEE Trans Vis Comput Graph 27(2):1698\u2013708. https:\/\/doi.org\/10.1109\/TVCG.2020.3030428","DOI":"10.1109\/TVCG.2020.3030428"},{"key":"193_CR3","doi-asserted-by":"publisher","unstructured":"Zhao Y, Shi JC, Liu JW, Zhao J, Zhou FF, Zhang WZ et al (2022) Evaluating effects of background stories on graph perception. IEEE Trans Vis Comput Graph 28(12):4839\u201354. https:\/\/doi.org\/10.1109\/TVCG.2021.3107297","DOI":"10.1109\/TVCG.2021.3107297"},{"key":"193_CR4","doi-asserted-by":"publisher","unstructured":"Ghoniem M, Fekete JD, Castagliola P (2004) A comparison of the readability of graphs using node-link and matrix-based representations. In: Proceedings of the IEEE symposium on information visualization, IEEE, Austin, 10\u201312. https:\/\/doi.org\/10.1109\/INFVIS.2004.1","DOI":"10.1109\/INFVIS.2004.1"},{"key":"193_CR5","doi-asserted-by":"publisher","unstructured":"Zhou ZG, Shi C, Shen XL, Cai LH, Wang HX, Liu YH et al (2021) Context-aware sampling of large networks via graph representation learning. IEEE Trans Vis Comput Graph 27(2):1709\u201319. https:\/\/doi.org\/10.1109\/TVCG.2020.3030440","DOI":"10.1109\/TVCG.2020.3030440"},{"key":"193_CR6","doi-asserted-by":"publisher","unstructured":"Burch M, Brinke K, Castella A, Peters G, Shteriyanov V, Vlasvinkel R (2021) Dynamic graph exploration by interactively linked node-link diagrams and matrix visualizations. Vis Comput Ind Biomed Art 4(1):23. https:\/\/doi.org\/10.1186\/s42492-021-00088-8","DOI":"10.1186\/s42492-021-00088-8"},{"key":"193_CR7","doi-asserted-by":"publisher","unstructured":"Xiong WL, Yu CJ, Shi C, Zheng YX, Wang XP, Hu YP et al (2024) V4RIN: visual analysis of regional industry network with domain knowledge. Vis Comput Ind Biomed Art 7(1):11. https:\/\/doi.org\/10.1186\/s42492-024-00164-9","DOI":"10.1186\/s42492-024-00164-9"},{"key":"193_CR8","doi-asserted-by":"publisher","unstructured":"Kwon OH, Muelder C, Lee K, Ma KL (2016) A study of layout, rendering, and interaction methods for immersive graph visualization. IEEE Trans Vis Comput Graph 22(7):1802\u201315. https:\/\/doi.org\/10.1109\/TVCG.2016.2520921","DOI":"10.1109\/TVCG.2016.2520921"},{"key":"193_CR9","doi-asserted-by":"publisher","unstructured":"Schulz C, Nocaj A, Goertler J, Deussen O, Brandes U, Weiskopf D (2017) Probabilistic graph layout for uncertain network visualization. IEEE Trans Vis Comput Graph 23(1):531\u201340. https:\/\/doi.org\/10.1109\/TVCG.2016.2598919","DOI":"10.1109\/TVCG.2016.2598919"},{"key":"193_CR10","doi-asserted-by":"publisher","unstructured":"Bostock M, Ogievetsky V, Heer J (2011) D3 data-driven documents. IEEE Trans Vis Comput Graph 17(12):2301\u20139. https:\/\/doi.org\/10.1109\/TVCG.2011.185","DOI":"10.1109\/TVCG.2011.185"},{"key":"193_CR11","doi-asserted-by":"publisher","unstructured":"Wang YY, Bai ZN, Lin ZF, Dong XQ, Feng YCJ, Pan JC (2021) G6: A web-based library for graph visualization. Visual Inf 5(4):49\u201355. https:\/\/doi.org\/10.1016\/j.visinf.2021.12.003","DOI":"10.1016\/j.visinf.2021.12.003"},{"key":"193_CR12","doi-asserted-by":"publisher","unstructured":"Li DQ, Hui MH, Shen Y, Su S, Zhang WL, Wang JT (2018) Echarts: A declarative framework for rapid construction of web-based visualization. Visual Inf 2(2):136\u201346. https:\/\/doi.org\/10.1016\/j.visinf.2018.04.011","DOI":"10.1016\/j.visinf.2018.04.011"},{"key":"193_CR13","doi-asserted-by":"publisher","unstructured":"Shahzad F, Sheltami TR, Shakshuki EM, Shaikh O (2016) A review of latest web tools and libraries for state-of-the-art visualization. Procedia Comput Sci 98:100\u20136. https:\/\/doi.org\/10.1016\/j.procs.2016.09.017","DOI":"10.1016\/j.procs.2016.09.017"},{"key":"193_CR14","doi-asserted-by":"publisher","unstructured":"Han DM, Pan JC, Zhao XD, Chen W (2021) NetV.js: A web-based library for high-efficiency visualization of large-scale graphs and networks. Visual Inf 5(1):61\u20136. https:\/\/doi.org\/10.1016\/j.visinf.2021.01.002","DOI":"10.1016\/j.visinf.2021.01.002"},{"key":"193_CR15","unstructured":"Eades P (1984) A heuristic for graph drawing. Congr Numerantium 42(42):149\u201360"},{"key":"193_CR16","doi-asserted-by":"publisher","unstructured":"Fruchterman TMJ, Reingold EM (1991) Graph drawing by force-directed placement. Softw Pract Exp 21(11):1129\u201364. https:\/\/doi.org\/10.1002\/spe.4380211102","DOI":"10.1002\/spe.4380211102"},{"key":"193_CR17","doi-asserted-by":"publisher","unstructured":"Kobourov SG (2012) Spring embedders and force directed graph drawing algorithms. arXiv:1201.3011 [cs.CG]. https:\/\/doi.org\/10.48550\/arXiv.1201.3011","DOI":"10.48550\/arXiv.1201.3011"},{"key":"193_CR18","doi-asserted-by":"publisher","unstructured":"Jacomy M, Venturini T, Heymann S, Bastian M (2014) Forceatlas2, a continuous graph layout algorithm for handy network visualization designed for the Gephi software. PLoS One 9(6):98679. https:\/\/doi.org\/10.1371\/journal.pone.0098679","DOI":"10.1371\/journal.pone.0098679"},{"key":"193_CR19","doi-asserted-by":"publisher","unstructured":"Herman I, Melancon G, Marshall MS (2000) Graph visualization and navigation in information visualization: a survey. IEEE Trans Vis Comput Graph 6(1):24\u201343. https:\/\/doi.org\/10.1109\/2945.841119","DOI":"10.1109\/2945.841119"},{"key":"193_CR20","doi-asserted-by":"publisher","unstructured":"Funkhouser TA, S\u00e9quin CH (1993) Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments. In: Proceedings of the 20th annual conference on computer graphics and interactive techniques, ACM, Anaheim, 2\u20136. https:\/\/doi.org\/10.1145\/166117.166149","DOI":"10.1145\/166117.166149"},{"key":"193_CR21","doi-asserted-by":"publisher","unstructured":"Pavlopoulos GA, Paez-Espino D, Kyrpides NC, Iliopoulos I (2017) Empirical comparison of visualization tools for larger-scale network analysis. Adv Bioinformatics 2017(1):1278932. https:\/\/doi.org\/10.1155\/2017\/1278932","DOI":"10.1155\/2017\/1278932"},{"key":"193_CR22","doi-asserted-by":"publisher","unstructured":"Lavanya A, Sindhuja S, Gaurav L, Ali W (2023) A comprehensive review of data visualization tools: features, strengths, and weaknesses. Int J Comput Eng Res Trends 1(10):10\u201320. https:\/\/doi.org\/10.22362\/ijcert\/2023\/v10\/i01\/v10i0102","DOI":"10.22362\/ijcert\/2023\/v10\/i01\/v10i0102"},{"key":"193_CR23","doi-asserted-by":"publisher","unstructured":"Gibson H, Faith J, Vickers P (2013) A survey of two-dimensional graph layout techniques for information visualisation. Inf Vis 12(3-4):324\u201357. https:\/\/doi.org\/10.1177\/1473871612455749","DOI":"10.1177\/1473871612455749"},{"key":"193_CR24","doi-asserted-by":"publisher","unstructured":"Leung C, Salga A (2010) Enabling WebGL. In: Proceedings of the 19th international conference on world wide web, ACM, Raleigh, 26\u201330. https:\/\/doi.org\/10.1145\/1772690.1772933","DOI":"10.1145\/1772690.1772933"},{"key":"193_CR25","doi-asserted-by":"publisher","unstructured":"Coene JP (2018) Sigmajs: An R htmlwidget interface to the sigma.js visualization library. J Open Source Software 3(28):814. https:\/\/doi.org\/10.21105\/joss.00814","DOI":"10.21105\/joss.00814"},{"key":"193_CR26","unstructured":"Foundation O (2024) Chart.js documentation.\nhttps:\/\/www.chartjs.org\/docs\/latest. Accessed 12 Apr 2024"},{"key":"193_CR27","unstructured":"SAS L (2024) Linkurious.js. https:\/\/linkurious.com. Accessed 12 Apr 2024"},{"key":"193_CR28","doi-asserted-by":"publisher","unstructured":"Zhou YX, Yang WK, Chen JS, Chen CJ, Shen ZY, Luo XN et al (2024) Cluster-aware grid layout. IEEE Trans Vis Comput Graph 30(1):240\u201350. https:\/\/doi.org\/10.1109\/TVCG.2023.3326934","DOI":"10.1109\/TVCG.2023.3326934"},{"key":"193_CR29","doi-asserted-by":"publisher","unstructured":"Dogrusoz U, Belviranli ME, Dilek A (2013) CiSE: A circular spring embedder layout algorithm. IEEE Trans Vis Comput Graph 19(6):953\u201366. https:\/\/doi.org\/10.1109\/TVCG.2012.178","DOI":"10.1109\/TVCG.2012.178"},{"key":"193_CR30","doi-asserted-by":"publisher","unstructured":"Xu PF, Li YF, Yang ZJ, Shi WR, Fu HB, Huang H (2022) Hierarchical layout blending with recursive optimal correspondence. ACM Trans Graph 41(6):249. https:\/\/doi.org\/10.1145\/3550454.3555446","DOI":"10.1145\/3550454.3555446"},{"key":"193_CR31","doi-asserted-by":"publisher","unstructured":"Harel D, Koren Y (2002) Graph drawing by high-dimensional embedding. In: Goodrich MT, Kobourov SG (eds) Graph Drawing. 10th International Symposium, GD 2002. Lecture Notes in Computer Science, vol 2528. Springer, Berlin, Heidelberg, pp 207\u201319. https:\/\/doi.org\/10.1007\/3-540-36151-0_20","DOI":"10.1007\/3-540-36151-0_20"},{"key":"193_CR32","doi-asserted-by":"publisher","unstructured":"Brandes U, Pich C (2006) Eigensolver methods for progressive multidimensional scaling of large data. In: Kaufmann M, Wagner D (eds) Graph Drawing. 14th International Symposium, GD 2006. Lecture notes in computer science (Theoretical computer science and general issues), vol 4372. Springer, Karlsruhe, pp 42\u201353. https:\/\/doi.org\/10.1007\/978-3-540-70904-6_6","DOI":"10.1007\/978-3-540-70904-6_6"},{"key":"193_CR33","doi-asserted-by":"publisher","unstructured":"Zhu MF, Chen W, Hu YZ, Hou YX, Liu LJ, Zhang KY (2020) DRGraph: An efficient graph layout algorithm for large-scale graphs by dimensionality reduction. IEEE Trans Vis Comput Graph 27(2):1666\u201376. https:\/\/doi.org\/10.1109\/TVCG.2020.3030447","DOI":"10.1109\/TVCG.2020.3030447"},{"key":"193_CR34","doi-asserted-by":"publisher","unstructured":"Zhou FF, Li JC, Huang W, Zhao Y, Yuan XR, Liang X et al (2016) Dimension reconstruction for visual exploration of subspace clusters in high-dimensional data. In: Proceedings of the 2016 IEEE pacific visualization symposium, IEEE, Taipei, China, 19\u201322. https:\/\/doi.org\/10.1109\/PACIFICVIS.2016.7465260","DOI":"10.1109\/PACIFICVIS.2016.7465260"},{"key":"193_CR35","doi-asserted-by":"publisher","unstructured":"Quint A (2003) Scalable vector graphics. IEEE MultiMedia 10(3):99\u2013102. https:\/\/doi.org\/10.1109\/MMUL.2003.1218261","DOI":"10.1109\/MMUL.2003.1218261"},{"key":"193_CR36","doi-asserted-by":"publisher","unstructured":"Fulton S, Fulton J (2013) HTML5 Canvas: Native Interactivity and Animation for the Web, 2nd edn. O\u2019Reilly Media, Inc., Sebastopolhttps:\/\/doi.org\/10.1016\/B978-155860819-1\/50001-7","DOI":"10.1016\/B978-155860819-1\/50001-7"},{"key":"193_CR37","doi-asserted-by":"publisher","unstructured":"Baek N, Lee H (2012) OpenGL ES 1.1 implementation based on OpenGL. Multimed Tools Appl 57(3):669\u201385. https:\/\/doi.org\/10.1007\/s11042-010-0662-4","DOI":"10.1007\/s11042-010-0662-4"},{"key":"193_CR38","doi-asserted-by":"publisher","unstructured":"Li W, Wang SS, Xie WD, Yu K, Feng CL (2023) Large scale medical image online three-dimensional reconstruction based on WebGL using four tier client server architecture. Inf Vis 22(2):100\u201314. https:\/\/doi.org\/10.1177\/14738716221138090","DOI":"10.1177\/14738716221138090"},{"key":"193_CR39","doi-asserted-by":"publisher","unstructured":"Grandhi R, Reddy BVK, Guntupalli V, Natarajan P (2019) WebGL-based game engine. In: Saini HS, Sayal R, Govardhan A, Buyya R (eds) Innovations in Computer Science and Engineering. Proceedings of the Fifth ICICSE 2017. Lecture notes in networks and systems. Springer, Singapore, 32:11\u20137. https:\/\/doi.org\/10.1007\/978-981-10-8201-6_2","DOI":"10.1007\/978-981-10-8201-6_2"},{"key":"193_CR40","doi-asserted-by":"publisher","unstructured":"Zhang YJ (2018) Development of WebGL-based virtual teaching platform for mold design. Int J Emerg Technol Learn 13(6):16\u201328. https:\/\/doi.org\/10.3991\/ijet.v13i06.8581","DOI":"10.3991\/ijet.v13i06.8581"},{"key":"193_CR41","doi-asserted-by":"publisher","unstructured":"Giri P, Chandra S, Chakraborty S, Choudhury PD (2023) Utilization of three.js and unity to make a WebGL API to perform 3D immersiveness in web. Am J Electron Commun 3(4):20\u20133. https:\/\/doi.org\/10.15864\/ajec.3405","DOI":"10.15864\/ajec.3405"},{"key":"193_CR42","doi-asserted-by":"publisher","unstructured":"Lu HL, Wu JX, Liu YS, Wang WQ (2019) Dynamically loading IFC models on a web browser based on spatial semantic partitioning. Vis Comput Ind Biomed Art 2(1):4. https:\/\/doi.org\/10.1186\/s42492-019-0011-z","DOI":"10.1186\/s42492-019-0011-z"},{"key":"193_CR43","doi-asserted-by":"publisher","unstructured":"Gui S, Khan D, Wang Q, Yan DM, L BZ (2018) Frontiers in biomolecular mesh generation and molecular visualization systems. Vis Comput Ind Biomed Art 1(1):7. https:\/\/doi.org\/10.1186\/s42492-018-0007-0","DOI":"10.1186\/s42492-018-0007-0"},{"key":"193_CR44","doi-asserted-by":"publisher","unstructured":"Singh A, Humphries MD (2015) Finding communities in sparse networks. Sci Rep 5:8828. https:\/\/doi.org\/10.1038\/srep08828","DOI":"10.1038\/srep08828"},{"key":"193_CR45","doi-asserted-by":"publisher","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684):440\u20132. https:\/\/doi.org\/10.1038\/30918","DOI":"10.1038\/30918"},{"key":"193_CR46","doi-asserted-by":"publisher","unstructured":"Barab\u00e1si AL (2009) Scale-free networks: a decade and beyond. Science 325(5939):412\u20133. https:\/\/doi.org\/10.1126\/science.1173299","DOI":"10.1126\/science.1173299"},{"key":"193_CR47","doi-asserted-by":"publisher","unstructured":"Melan\u00e7on G (2006) Just how dense are dense graphs in the real world? a methodological note. In: Proceedings of the AVI workshop on BEyond time and errors: novel evaluation methods for information visualization, ACM, Venice, 23. https:\/\/doi.org\/10.1145\/1168149.1168167","DOI":"10.1145\/1168149.1168167"},{"key":"193_CR48","doi-asserted-by":"publisher","unstructured":"Rossi RA, Ahmed NK (2015) The network data repository with interactive graph analytics and visualization. In: Proceedings of the 29th AAAI conference on artificial intelligence, AAAI, Austin, 25\u201330. https:\/\/doi.org\/10.1609\/aaai.v29i1.9277","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"193_CR49","unstructured":"Kelly M, Longjohn R, Nottingham K (2024) Welcome to the UC Irvine Machine Learning Repository. https:\/\/archive.ics.uci.edu. Accessed 12 Apr 2024"},{"key":"193_CR50","doi-asserted-by":"publisher","unstructured":"Batagelj V, Mrvar A (2004) Pajek-analysis and visualization of large networks. In: J\u00fcnger M, Mutzel P (eds) Graph Drawing Software. Mathematics and visualization. Springer, Berlin, Heidelberg, pp 77\u2013103. https:\/\/doi.org\/10.1007\/978-3-642-18638-7_4","DOI":"10.1007\/978-3-642-18638-7_4"},{"key":"193_CR51","doi-asserted-by":"publisher","unstructured":"Leskovec J, Sosi\u010d R (2016) SNAP: a general-purpose network analysis and graph-mining library. ACM Trans Intell Syst Technol 8(1):1. https:\/\/doi.org\/10.1145\/2898361","DOI":"10.1145\/2898361"},{"key":"193_CR52","doi-asserted-by":"publisher","unstructured":"Hagberg AA, Schult DA, Swart PJ (2008) Exploring network structure, dynamics, and function using networkX. In: Proceedings of the 7th Python in science conference, SciPy, California, 19\u201324. https:\/\/doi.org\/10.25080\/TCWV9851","DOI":"10.25080\/TCWV9851"},{"key":"193_CR53","doi-asserted-by":"publisher","unstructured":"Barnes J, Hut P (1986) A hierarchical O(N log N) force-calculation algorithm. Nature 324(6096):446\u20139. https:\/\/doi.org\/10.1038\/324446a0https:\/\/doi.org\/10.1038\/324446a0","DOI":"10.1038\/324446a0"},{"key":"193_CR54","doi-asserted-by":"publisher","unstructured":"Verd\u00fa J, Pajuelo A (2016) Performance scalability analysis of JavaScript applications with web workers. IEEE Comput Archit Lett 15(2):105\u20138. https:\/\/doi.org\/10.1109\/LCA.2015.2494585","DOI":"10.1109\/LCA.2015.2494585"},{"key":"193_CR55","doi-asserted-by":"publisher","unstructured":"Haynes LS, Lau RL, Siewiorek DP, Mizell DW (1982) A survey of highly parallel computing. Computer 15(1):9\u201324. https:\/\/doi.org\/10.1109\/MC.1982.1653823","DOI":"10.1109\/MC.1982.1653823"},{"key":"193_CR56","doi-asserted-by":"publisher","unstructured":"Goldman M, Craft B, Hastie M, Repe\u010dka K, McDade F, Kamath A et al (2020) Visualizing and interpreting cancer genomics data via the Xena platform. Nat Biotechnol 38(6):675\u20138. https:\/\/doi.org\/10.1038\/s41587-020-0546-8","DOI":"10.1038\/s41587-020-0546-8"},{"key":"193_CR57","doi-asserted-by":"publisher","unstructured":"Samek W, Binder A, Montavon G, Lapuschkin S, M\u00fcller KR (2017) Evaluating the visualization of what a deep neural network has learned. IEEE Trans Neural Netw Learn Syst 28(11):2660\u201373. https:\/\/doi.org\/10.1109\/TNNLS.2016.2599820","DOI":"10.1109\/TNNLS.2016.2599820"},{"key":"193_CR58","doi-asserted-by":"publisher","unstructured":"Schall G, Zollmann S, Reitmayr G (2013) Smart Vidente: advances in mobile augmented reality for interactive visualization of underground infrastructure. Personal and Ubiquitous Computing 17(7):1533\u201349. https:\/\/doi.org\/10.1007\/s00779-012-0599-x","DOI":"10.1007\/s00779-012-0599-x"},{"key":"193_CR59","unstructured":"Community V (2024) Vis.js. https:\/\/visjs.org. Accessed 12 Apr 2024"},{"key":"193_CR60","doi-asserted-by":"publisher","unstructured":"Franz M, Lopes CT, Fong D, Kucera M, Cheung M, Siper MC et al (2023) Cytoscape.js 2023 update: a graph theory library for visualization and analysis. Bioinformatics 39(1):031. https:\/\/doi.org\/10.1093\/bioinformatics\/btad031","DOI":"10.1093\/bioinformatics\/btad031"},{"key":"193_CR61","doi-asserted-by":"publisher","unstructured":"Angel E, Haines E (2017) An interactive introduction to WebGL and three.js. In: Proceedings of the ACM SIGGRAPH 2017 courses, ACM, Los Angeles. https:\/\/doi.org\/10.1145\/3084873.3084875","DOI":"10.1145\/3084873.3084875"},{"key":"193_CR62","doi-asserted-by":"publisher","unstructured":"Elzen SVD, Holten D, Blaas J, Van Wijk JJ (2014) Dynamic network visualization with extended massive sequence views. IEEE Trans Vis Comput Graph 20(8):1087\u201399. https:\/\/doi.org\/10.1109\/TVCG.2013.263","DOI":"10.1109\/TVCG.2013.263"}],"container-title":["Visual Computing for Industry, Biomedicine, and Art"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42492-025-00193-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42492-025-00193-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42492-025-00193-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T08:44:56Z","timestamp":1746693896000},"score":1,"resource":{"primary":{"URL":"https:\/\/vciba.springeropen.com\/articles\/10.1186\/s42492-025-00193-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,8]]},"references-count":62,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["193"],"URL":"https:\/\/doi.org\/10.1186\/s42492-025-00193-y","relation":{},"ISSN":["2524-4442"],"issn-type":[{"value":"2524-4442","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,8]]},"assertion":[{"value":"18 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"12"}}