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 suggest 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 a... |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1093/comjnl/bxz133 | The Computer Journal |
Keywords | DocType | Volume |
graph drawing,angular, crossing,total resolution | Journal | 64 |
Issue | ISSN | Citations |
1 | 0010-4620 | 0 |
PageRank | References | Authors |
0.34 | 0 | 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 |