Next Article in Journal
Control for Ship Course-Keeping Using Optimized Support Vector Machines
Previous Article in Journal
A Multi-Objective Harmony Search Algorithm for Sustainable Design of Floating Settlements
Previous Article in Special Issue
Modifying Orthogonal Drawings for Label Placement
Article Menu

Export Article

Open AccessArticle
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)
View Full-Text   |   Download PDF [14805 KB, uploaded 4 August 2016]   |  

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 only O ( m + n log n ) time per iteration when laying out a graph with n vertices and m edges. Our algorithm approximates the true forces using the so-called well-separated pair decomposition. We perform experiments on a large number of graphs and show that we can strongly reduce the runtime, even on graphs with less than a hundred vertices, without a significant influence on the quality of the drawings (in terms of the number of crossings and deviation in edge lengths). View Full-Text
Keywords: force-directed graph drawing; well-separated pair decomposition; Fruchterman–Reingold algorithm; experiments; number of crossings; deviation of edge lengths; runtime 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).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed 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.

Show more citation formats Show less citations formats

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

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top