Sublinear Time Force Computation for Big Complex Network Visualization. (18th July 2020)

• Record Type: Journal Article
• Authors: Meidiana, Amyra; Hong, Seok‐Hee; Torkel, Marnijati; Cai, Shijun; Eades, Peter
• Is Part Of: Computer graphics forum. Volume 39:Number 3(2020)
• Page Start: 579
• Page End: 591
• Publication Date: 2020-07-18
• Subjects: Computer graphics -- Periodicals; 006.605
• DOI: 10.1111/cgf.14003
• Languages: English
• ISSNs: 0167-7055

Abstract

Abstract: In this paper, we present a new framework for sublinear time force computation for visualization of big complex graphs. Our algorithm is based on the sampling of vertices for computing repulsion forces and edge sparsification for attraction force computation. More specifically, for vertex sampling, we present three types of sampling algorithms, including random sampling, geometric sampling, and combinatorial sampling, to reduce the repulsion force computation to sublinear in the number of vertices. We utilize a spectral sparsification approach to reduce the number of attraction force computations to sublinear in the number of edges for dense graphs. We also present a smart initialization method based on radial tree drawing of the BFS spanning tree rooted at the center. Experiments show that our new sublinear time force computation algorithms run quite fast, while producing good visualization of large and complex networks, with significant improvements in quality metrics such as shape‐based and edge crossing metrics.