Abstract
The total angular resolution of a straight-line drawing is the minimum angle between two edges of the drawing. It combines two properties contributing to the readability of a drawing: the angular resolution, which is the minimum angle between incident edges, and the crossing resolution, which is the minimum angle between crossing edges. We consider the total angular resolution of a graph, which is the maximum total angular resolution of a straight-line drawing of this graph. We prove that, up to a finite number of well specified exceptions of constant size, the number of edges of a graph with n vertices and a total angular resolution greater than 60° is bounded by 2n−6. This bound is tight. In addition, we show that deciding whether a graph has total angular resolution at least 60° is NP-hard.
| Original language | English |
|---|---|
| Title of host publication | Graph Drawing and Network Visualization |
| Publisher | Springer, Cham |
| Chapter | Quality Metrics |
| Pages | 193-199 |
| Number of pages | 7 |
| ISBN (Electronic) | 978-3-030-35802-0 |
| ISBN (Print) | 978-3-030-35801-3 |
| DOIs | |
| Publication status | Published - 2019 |
| Event | 27th International Symposium on Graph Drawing and Network Visualization: GD 2019 - Hotel Floret, Pruhonice, Czech Republic Duration: 17 Sept 2019 → 20 Sept 2019 https://kam.mff.cuni.cz/gd2019/index.html https://kam.mff.cuni.cz/gd2019/ |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| Publisher | Springer, Cham |
| Number | 11904 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 27th International Symposium on Graph Drawing and Network Visualization |
|---|---|
| Abbreviated title | GD 2019 |
| Country/Territory | Czech Republic |
| City | Pruhonice |
| Period | 17/09/19 → 20/09/19 |
| Internet address |