Abstract
We initiate the study of the following problem: Given a non-planar graph G and a planar subgraph S of G, does there exist a straight-line drawing Γ of G in the plane such that the edges of S are not crossed in Γ? We give positive and negative results for different kinds of spanning subgraphs S of G. Moreover, in order to enlarge the subset of instances that admit a solution, we consider the possibility of bending the edges of G \ S; in this setting different trade-offs between number of bends and drawing area are given. © 2013 Springer International Publishing Switzerland.
Cite
CITATION STYLE
Angelini, P., Binucci, C., Da Lozzo, G., Didimo, W., Grilli, L., Montecchiani, F., … Tollis, I. G. (2013). Drawing non-planar graphs with crossing-free subgraphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8242 LNCS, pp. 292–303). Springer Verlag. https://doi.org/10.1007/978-3-319-03841-4_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
