Name
Abstract | ||
|---|---|---|
Reducing the number of edge crossings is considered one of the most important graph drawing aesthetics. While real-world graphs tend to be large and dense, most of the earlier work on evaluating the impact of edge crossings utilizes relatively small graphs that are manually generated and manipulated. We study the effect on task performance of increased edge crossings in automatically generated layouts for graphs, from different datasets, with different sizes, and with different densities. The results indicate that increasing the number of crossings negatively impacts accuracy and performance time and that impact is significant for small graphs but not significant for large graphs. We also quantitatively evaluate the impact of edge crossings on crossing angles and stress in automatically constructed graph layouts. We find a moderate correlation between minimizing stress and the minimizing the number of crossings. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-662-45803-7_20 | GRAPH DRAWING (GD 2014) |
Field | DocType | Volume |
Graph drawing,Discrete mathematics,Graph,Combinatorics,Computer science | Conference | 8871 |
ISSN | Citations | PageRank |
0302-9743 | 14 | 0.61 |
References | Authors | |
23 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stephen G. Kobourov | 1 | 1440 | 122.20 |
| Sergey Pupyrev | 2 | 148 | 17.77 |
| Bahador Saket | 3 | 140 | 11.70 |