Spring Embedders and Force Directed Graph Drawing Algorithms

2012/01/14 by Kobourov, Stephen G. · 6 citations
#Computational Geometry (cs.CG) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #G.2.2 #H.4.0 #I.3.5

paper · doi:10.48550/arxiv.1201.3011

Abstract

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 the graph 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.

Cited by

• Multi-dimensional Data Analysis and Applications Basing on LLM Agents and Knowledge Graph Interactions
• Chronotome: Real-Time Topic Modeling for Streaming Embedding Spaces
• GRAVITY: A Controversial Graph Representation Learning for Vertex Classification
• Topolow: Force-Directed Euclidean Embedding of Dissimilarity Data with Robustness Against Non-Metricity and Sparsity
• Whole-Brain Connectomic Graph Model Enables Whole-Body Locomotion Control in Fruit Fly
• Lower Ricci Curvature for Hypergraphs

Related

• Graph drawing by force‐directed placement
• A Force-Directed Method for Large Crossing Angle Graph Drawing
• Sync-and-Burst: Force-Directed Graph Drawing with Uniform Force Magnitudes
• A Sparse Stress Model
• Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected Planar Graphs