Spring Embedders and Force Directed Graph Drawing Algorithms
By Stephen G. Kobourov. arXiv.org, 2012
297 citations recorded by the source corpus.
Force-directed algorithms are among the most flexible methods for calculating layouts of simple undirected graphs. Also known as spring embedders, such algorithms calculate the layout of a graph using only information contained within the structure of th eg raph itself, rather than relying on domain-specific knowledge. Graphs drawn with these algorithms tend to be aesthetically pleasing, exhibit symmetries, and tend to produce crossing-free layouts for planar graphs. In this survey we consider several classical algorithms, starting from Tutte’s 1963 barycentric method, and including recent scalable multiscale methods for large and dynamic graphs.
View Paper: https://www.semanticscholar.org/paper/8894a05393ad9cc9184998d153c3b659ff937cf7
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Ailin Deng
- Anastasia Baryshnikova
- Bryan Hooi
- Jiehui Xu
- Kukjin Choi
- Shreshth Tuli
- Yiyuan Yang
- Maxat Kulmanov
Citations in the corpus
- Bibliometric Methods in Management and Organization (2015, unknown): “Both are members of the spring-embedder family of algorithms (Kobourov, 2012).”
- Systematic Functional Annotation and Visualization of Biological Networks (2016, methodology): “This map can be produced using a network layout algorithm that embeds the network in two-or three-dimensional space and positions all nodes based on their connectivity (Kobourov, 2012).”
- Graph Neural Network-Based Anomaly Detection in Multivariate Time Series (2021, methodology): “Figure 3 (left) shows the learned graph of sensors, with edges weighted by their attention weights, and plotted using a force-directed layout(Kobourov 2012).”