Force-Directed Graph Layouts Revisited: A New Force Based on the T-Distribution
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 5 Mar 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 2; 2025: 1; 2026: 2.
5 papers.
- 2024Graph Learning with Distributional Edge Layoutscited by 2
- 2025Node Embeddings via Neighbor Embeddingscited by 1
- 2024Lens functions for exploring UMAP Projections with Domain Knowledgecited by 0
- 2026TopoAlign: Topology-Aware Visual Representation Alignmentcited by 0
- 2026ibUMAP: Coherent and Scalable Field Evaluation for UMAP Optimizationcited by 0
- 2026ibUMAP: Coherent and Scalable Field Evaluation for UMAP Optimization1 Oct 2026
- 2026TopoAlign: Topology-Aware Visual Representation Alignment25 May 2026
- 2025Node Embeddings via Neighbor Embeddings31 Mar 2025
- 2024Lens functions for exploring UMAP Projections with Domain Knowledge15 May 2024
- 2024Graph Learning with Distributional Edge Layouts26 Feb 2024