Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition

DOI10.1007/978-3-319-27261-0_5MaRDI QIDQ2959742zbMATH OpenOpenAlexFDO

Authors Fabian Lipp, Alexander Wolff, Johannes Zink

Publication date 10 February 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-27261-0_5

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Faster force-directed graph drawing with the well-separated pair decomposition
• scientific article; zbMATH DE number 2080097
• A Multilevel Algorithm for Force-Directed Graph-Drawing
• A fast successive over-relaxation algorithm for force-directed network graph drawing
• A force-directed algorithm for drawing directed graphs symmetrically
• Graph Drawing
• scientific article; zbMATH DE number 2080098
• A Fast Multi-Scale Method for Drawing Large Graphs

Cited in

(4)

• Faster force-directed graph drawing with the well-separated pair decomposition
• Multipole-Based Force Approximation Revisited – A Simple but Fast Implementation Using a Dynamized Enclosing-Circle-Enhanced k-d-Tree
• A fast successive over-relaxation algorithm for force-directed network graph drawing
• Maxent-stress optimization of 3D biomolecular models

This page was built for publication: Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2959742)