Abstract
Graph drawing beyond planarity focuses on drawings of high visual quality for non-planar graphs which are characterized by certain forbidden edge configurations. A natural criterion for the quality of a drawing is the number of edge crossings. The question then arises whether beyond-planar drawings have a significantly larger crossing number than unrestricted drawings. Chimani et al. [GD’19] gave bounds for the ratio between the crossing number of three classes of beyond-planar graphs and the unrestricted crossing number. In this paper we extend their results to the main currently known classes of beyond-planar graphs characterized by forbidden edge configurations and answer several of their open questions.
| Original language | English |
|---|---|
| Pages | 36:1-36:7 |
| Number of pages | 7 |
| Publication status | Published - 7 Apr 2021 |
| Event | 37th European Workshop on Computational Geometry (EuroCG 2021) - Online, Saint Petersburg, Russian Federation Duration: 7 Apr 2021 → 9 Apr 2021 Conference number: 37 |
Workshop
| Workshop | 37th European Workshop on Computational Geometry (EuroCG 2021) |
|---|---|
| Abbreviated title | EuroCG 2021 |
| Country/Territory | Russian Federation |
| City | Saint Petersburg |
| Period | 7/04/21 → 9/04/21 |
Fingerprint
Dive into the research topics of 'Crossing Numbers of Beyond-Planar Graphs Revisited'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver