A Sparse Stress Model
Not on the map. Why?
Abstract (arXiv)
Force-directed layout methods constitute the most common approach to draw general graphs. Among them, stress minimization produces layouts of comparatively high quality but also imposes comparatively high computational demands. We propose a speed-up method based on the aggregation of terms in the objective function. It is akin to aggregate repulsion from far-away nodes during spring embedding but transfers the idea from the layout space into a preprocessing phase. An initial experimental study informs a method to select representatives, and subsequent more extensive experiments indicate that our method yields better approximations of minimum-stress layouts in less time than related methods.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 31 Aug 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 2; 2024: 0; 2025: 1; 2026: 1.
6 papers.
- 2023Balancing between the Local and Global Structures (LGS) in Graph Embeddingcited by 5
- 2023AutoDOViz: Human-Centered Automation for Decision Optimizationcited by 3
- 2022FORBID: Fast Overlap Removal By stochastic gradIent Descent for Graph Drawingcited by 1
- 2025Learning Isometric Embeddings of Road Networks using Multidimensional Scalingcited by 1
- 2022Tired of Over-smoothing? Stress Graph Drawing Is All You Need!cited by 0
- 2026Inductive Graph Layout with Implicit Neural Fieldscited by 0
- 2026Inductive Graph Layout with Implicit Neural Fields9 Aug 2026
- 2025Learning Isometric Embeddings of Road Networks using Multidimensional Scaling24 Apr 2025
- 2023Balancing between the Local and Global Structures (LGS) in Graph Embedding31 Aug 2023
- 2023AutoDOViz: Human-Centered Automation for Decision Optimization19 Feb 2023
- 2022Tired of Over-smoothing? Stress Graph Drawing Is All You Need!19 Nov 2022
- 2022FORBID: Fast Overlap Removal By stochastic gradIent Descent for Graph Drawing19 Aug 2022