Name
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 speed up this computation by using an approximation based on the 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 then a hundred vertices--without a significant influence on the quality of the drawings in terms of number of crossings and deviation in edge lengths. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.3390/a9030053 | Algorithms |
Keywords | DocType | Volume |
force-directed graph drawing,well-separated pair decomposition,Fruchterman-Reingold algorithm,experiments,number of crossings,deviation of edge lengths,runtime | Journal | 9 |
Issue | Citations | PageRank |
3 | 0 | 0.34 |
References | Authors | |
5 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fabian Lipp | 1 | 14 | 4.44 |
| Alexander Wolff | 2 | 43 | 6.65 |
| Johannes Zink | 3 | 1 | 1.35 |