Name
Abstract | ||
|---|---|---|
The crossing resolution of a non-planar drawing of a graph is the value of the minimum angle formed by any pair of crossing edges. Recent experiments have shown that the larger the crossing resolution is, the easier it is to read and interpret a drawing of a graph. However, maximizing the crossing resolution turns out to be an NP-hard problem in general and only heuristic algorithms are known that are mainly based on appropriately adjusting force-directed algorithms.In this paper, we propose a new heuristic algorithm for the crossing resolution maximization problem and we experimentally compare it against the known approaches from the literature. Our experimental evaluation indicates that the new heuristic produces drawings with better crossing resolution, but this comes at the cost of slightly higher aspect ratio, especially when the input graph is large. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-030-04414-5_19 | GRAPH DRAWING AND NETWORK VISUALIZATION, GD 2018 |
DocType | Volume | ISSN |
Conference | 11282 | 0302-9743 |
Citations | PageRank | References |
1 | 0.34 | 22 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael A. Bekos | 1 | 250 | 38.21 |
| Henry Förster | 2 | 3 | 4.40 |
| Christian Geckeler | 3 | 1 | 0.68 |
| Lukas Holländer | 4 | 1 | 0.68 |
| Michael Kaufmann | 5 | 1224 | 107.33 |
| Amadäus M. Spallek | 6 | 1 | 0.68 |
| Jan Splett | 7 | 1 | 0.68 |