\n \n \n \n \n \n \n
Figure 1: Progressive community layouts of an Orkut network.
\nSNAP-tFDP accelerates force-directed graph drawing with sampled repulsion and degree-aware weighting. Bounded forces based on a t-distribution help distinguish tightly connected groups. Sampling around edges avoids expensive auxiliary structures, while a parallel update strategy reduces synchronization overhead. The evaluation compares layout quality, runtime, and memory use on large networks, including CPU and GPU implementations. The results demonstrate that sparse updates can retain useful neighborhood and community structure while handling graphs with millions of nodes.
\n\n \n \n 
\n \n
\n \n \n \n
\nFigure 2: Comparing force models and weighting choices.
\n\n \n \n 
\n \n
Figure 3: Balancing forces between nodes of different degrees.
\n\n \n \n \n
\nFigure 4: Checking sampled optimization against the full objective.
\n\n \n \n 
\n \n
Figure 5: How sampling frequency affects speed and quality.
\n\n \n \n 
\n \n
Figure 6: Convergence and intermediate layouts during parallel execution.
\n\n \n \n \n
\nFigure 7: Quality measurements across algorithms and datasets.
\n\n \n \n 
\n \n
Figure 8: Aircraft-network layouts and execution times.
\n\n \n \n 
\n \n
Figure 9: Quality and speed of parallel implementations.
\n\n \n \n 
\n \n
Figure 10: Runtime comparisons including GPU implementations.
\n\n \n \n \n
\nFigure 11: A layout of the large Friendster network.
","frontmatter":{"title":"SNAP-tFDP: Massively Scalable Graph Layouts via Sparse Negative Sampling","year":"2026","authors":["Xin Chen","Shuowei Hou","Yifan Wang","Mingliang Xue","Zezheng Feng","Oliver Deussen","Weidong Huang","Yunhai Wang"],"publication":"IEEE Transactions on Visualization and Computer Graphics (Proc. IEEE VIS 2026), 2026"}}},"pageContext":{"id":"f9282ccc-6778-567b-855f-b7256c1938c1"}},"staticQueryHashes":["63159454"]}