Faster force-directed graph drawing with the well-separated pair decomposition

DOI10.3390/a9030053zbMath1461.68158MaRDI QIDQ1736822

Fabian Lipp, Alexander Wolff, Johannes Zink

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a9030053

zbMATH Keywords

experiments; number of crossings; runtime; well-separated pair decomposition; deviation of edge lengths; force-directed graph drawing; Fruchterman-Reingold algorithm

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68R10: Graph theory (including graph drawing) in computer science

05C62: Graph representations (geometric and intersection representations, etc.)

Related Items

Layered Drawing of Undirected Graphs with Generalized Port Constraints, Layered drawing of undirected graphs with generalized port constraints

Uses Software

• OGDF
• JUNG

Cites Work

• Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition
• An Experimental Evaluation of Multilevel Layout Methods
• Geometric Spanner Networks
• Rapid Multipole Graph Drawing on the GPU
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• A Multilevel Algorithm for Force-Directed Graph-Drawing
• Drawing Metro Maps Using Bézier Curves
• Large-Graph Layout Algorithms at Work: An Experimental Study
• Graph Drawing
• A fast algorithm for particle simulations