Name
Abstract | ||
|---|---|---|
Force-directed layout methods constitute the most common approach to draw general graphs. Among them, stress minimization produces layouts of comparatively high quality but also imposes comparatively high computational demands. We propose a speed-up method based on the aggregation of terms in the objective function. It is akin to aggregate repulsion from far-away nodes during spring embedding but transfers the idea from the layout space into a preprocessing phase. An initial experimental study informs a method to select representatives, and subsequent more extensive experiments indicate that our method yields better approximations of minimum-stress layouts in less time than related methods. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-50106-2_2 | GRAPH DRAWING AND NETWORK VISUALIZATION (GD 2016) |
DocType | Volume | Issue |
Conference | 9801 | 5 |
ISSN | Citations | PageRank |
0302-9743 | 7 | 0.46 |
References | Authors | |
11 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mark Ortmann | 1 | 47 | 3.40 |
| Mirza Klimenta | 2 | 13 | 0.91 |
| Ulrik Brandes | 3 | 2308 | 181.69 |