Algorithms 2016, 9(3), 53; doi:10.3390/a9030053
Faster Force-Directed Graph Drawing with the Well-Separated Pair Decompositionâ€
Lehrstuhl für Informatik I, Julius-Maximilians-Universität Würzburg, Am Hubland, 97074 Würzburg, Germany
â€
This paper is an extended version of our paper published in Proceedings of the 23rd International Symposium on Graph Drawing and Network Visualization (GD 2015), Los Angeles, CA, USA, 24–26 September 2015.
*
Author to whom correspondence should be addressed.
Academic Editor: Maurizio Patrignani
Received: 24 December 2015 / Revised: 15 July 2016 / Accepted: 15 July 2016 / Published: 4 August 2016
(This article belongs to the Special Issue Graph Drawing and Experimental Algorithms)
Abstract
The force-directed paradigm is one of the few generic approaches to drawing graphs. Since force-directed algorithms can be extended easily, they are used frequently. Most of these algorithms are, however, quite slow on large graphs, as they compute a quadratic number of forces in each iteration. We give a new algorithm that takes onlyKeywords:
force-directed graph drawing; well-separated pair decomposition; Fruchterman–Reingold algorithm; experiments; number of crossings; deviation of edge lengths; runtime
▼
Figures
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Lipp, F.; Wolff, A.; Zink, J. Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. Algorithms 2016, 9, 53.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
Related Articles
Article Metrics
Comments
[Return to top]
Algorithms
EISSN 1999-4893
Published by MDPI AG, Basel, Switzerland
RSS
E-Mail Table of Contents Alert