On 3D visibility representations of graphs with few crossings per edge☆,☆☆
Under an Elsevier user license
open archive
Keywords
Visibility Representations
k-Planar Graphs
Graph Drawing
Cited by (0)
- ☆
A preliminary extended abstract of the results contained in this paper has been presented at the 25th International Symposium on Graph Drawing and Network Visualization, GD 2017 [1].
- ☆☆
Research partially supported by the DFG grant Ka812/17-1 and by the project “Algoritmi e sistemi di analisi visuale di reti complesse e di grandi dimensioni” - Ricerca di Base 2018, Department of Engineering, University of Perugia.
© 2019 Elsevier B.V.