SubLinearForce: Fully Sublinear-Time Force Computation for Large Complex Graph Drawing
IEEE Transactions on Visualization and Computer Graphics（2023）
摘要
Recent works in graph visualization attempt to reduce the runtime of
repulsion
force computation of force-directed algorithms using sampling. However, they fail to reduce the runtime for
attraction
force computation to sublinear in the number of edges. We present the
SubLinearForce
framework for a fully sublinear-time
force computation
algorithm for drawing large complex graphs. More precisely, we present new sublinear-time algorithms for the
attraction force
computation of force-directed algorithms. We then integrate them with sublinear-time repulsion force computation to give a fully sublinear-time force computation. Extensive experiments show that our algorithms compute layouts on average 80% faster than the existing linear-time force computation algorithm, while obtaining significantly better quality metrics such as edge crossing and shape-based metrics.
更多查看译文
关键词
Graph drawing,force-directed algorithms,sublinear-time algorithms
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要