Force-Directed Graph Layouts Revisited: A New Force Based on the T-Distribution
- 23 January 2023
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 30 (7) , 3650-3663
Abstract
In this paper, we propose the t-FDP model, a force-directed placement method based on a novel bounded short-range force (t-force) defined by Student’s t-distribution. Our formulation is flexible, exerts limited repulsive forces for nearby nodes and can be adapted separately in its short- and long-range effects. Using such forces in force-directed graph layouts yields better neighborhood preservation than current methods, while maintaining low stress errors. Our efficient implementation using a Fast Fourier Transform is one order of magnitude faster than state-of-the-art methods and two orders faster on the GPU, enabling us to perform parameter tuning by globally and locally adjusting the t-force in real-time for complex graphs. We demonstrate the quality of our approach by numerical evaluation against state-of-the-art approaches and extensions for interactive exploration.Keywords
All Related Versions
Funding Information
- National Key Research & Development Plan of China (2019YFB1704201)
- Natural Science Foundation of Shandong Province (ZR2022JQ32)
- National Natural Science Foundation of China (62132017, 62141217)
- Deutsche Forschungsgemeinschaft (EXC 2117 - 422037984)
This publication has 38 references indexed in Scilit:
- A survey on visualization approaches for exploring association relationships in graph dataJournal of Visualization, 2019
- The Binary Stress Model for Graph DrawingLecture Notes in Computer Science, 2009
- Eigensolver Methods for Progressive Multidimensional Scaling of Large Data2007
- Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm2005
- Metrics for Graph Drawing AestheticsJournal of Visual Languages & Computing, 2002
- Graphviz— Open Source Graph Drawing Tools2002
- A Multilevel Algorithm for Force-Directed Graph Drawing2001
- A better heuristic for orthogonal graph drawingsComputational Geometry, 1998
- Graph drawing by force‐directed placementSoftware: Practice and Experience, 1991
- An algorithm for drawing general undirected graphsInformation Processing Letters, 1989