1 Introduction
A fundamental result in graph drawing is the socalled “stretchability theorem” [12, 16, 17]: Every planar simple topological graph admits a straightline drawing that preserves its topology. One may ask whether a similar theorem holds for nonplanar simple topological graphs. Motivated by the fact that a straightline drawing may not be possible even for a planar graph plus an edge [10], we allow bends along the edges and measure the quality of the computed drawings in terms of their curve complexity, defined as the maximum number of bends per edge.
Let be a simple topological graph and let be a polyline drawing of . (Note that, by definition of simple topological graph, has neither multiple edges nor selfloops; see also Section 2 for formal definitions.) Drawing fully preserves the topology of if the planarization of (i.e., the planar simple topological graph obtained from by replacing crossings with dummy vertices) and the planarization of have the same planar embedding. Eppstein et al. [11] prove the existence of a simple arrangement of pseudolines that, when drawn with polylines, it requires at least one pseudoline to have bends. It is not hard to see that the result by Eppstein et al. implies the existence of an vertex simple topological graph such that any polyline drawing that fully preserves its topology has curve complexity (see Corollary 1 in Section 2). This lower bound naturally suggests two research directions: (i) “Trade” curve complexity for accuracy in the preservation of the topology and (ii) Describe families of simple topological graphs for which polyline drawings that fully preserve their topologies and that have low curve complexity can be computed.
Concerning the first research direction, we consider the following relaxation of topology preserving drawing. A polyline drawing of a simple topological graph partially preserves the topology of if it has the same rotation system, the same external boundary, and the same set of crossings as , while it may not preserve the order of the crossings along an edge. It may be worth recalling that some (weaker) notions of topological equivalence between graphs have been already considered in the literature. For example, Kynčl [14, 15] and Aichholzer et al. [1, 2] study weakly isomorphic simple topological graphs: Two simple topological graphs are weakly isomorphic if they have the same set of vertices, the same set of edges, and the same set of edge crossings. Note that a drawing that partially preserves the topology of a simple toplogical graph is weakly isomorphic to and, in addition, it has the same rotation system and the same external boundary as . Also, Kratochvíl, Lubiw, and Nešetřil [13] define the notion of abstract topological graph as a pair , where is a graph and is a set of pairs of crossing edges; a strong realization of is a drawing of such that two edges of cross if and only if they belong to . The problem of computing a drawing that partially preserves a topology may be rephrased as the problem of computing a strong realization of an abstract topological graph for which a rotation system and an external boundary are given in input. A different relaxation of the topology preservation is studied by Durocher and Mondal, who proved bounds on the curve complexity of drawings that preserve the thickness of the input graph [9].
Concerning the second research direction, we investigate the curve complexity of polyline drawings that fully preserve the topology of meaningful families of beyondplanar graphs, that are families of nonplanar graphs for which some crossing configurations are forbidden (see, e.g., [4, 8] for surveys and special issues on beyondplanar graph drawing). In particular, we focus on graphs with skewness , i.e., nonplanar graphs that can be made planar by removing at most edges, and on plane graphs, i.e., nonplanar graphs for which any edge is crossed at most twice. Note that a characterization of those graphs with skewness one having a straightline drawing that fully preserves the topology is presented in [10]. Also, all plane graphs (every edge can be crossed at most once) admit a polyline drawing with curve complexity one that fully preserves the topology and such that any crossing angle is [6].
Our results can be listed as follows. Let be a simple topological graph.

If the subgraph of formed by the uncrossed edges and all vertices of , called planar skeleton, is connected, then admits a polyline drawing with curve complexity three that partially preserves its topology. If the planar skeleton is biconnected the curve complexity can be reduced to one, which is worstcase optimal (Section 3).

For the case that the planar skeleton of is not connected, we prove that the curve complexity may be (Section 3).

If has skewness , then admits a polyline drawing with curve complexity that fully preserves its topology. When , the curve complexity can be reduced to one, which is worstcase optimal (Section 4).

If is optimal 2plane (i.e., it is plane and it has edges), then admits a drawing that fully preserves its topology and with two bends in total, and a drawing that fully preserves its topology, with at most two bends per edge, and with optimal crossing angle resolution. The number of bends per edge can be reduced to one while maintaining the crossing angles arbitrarily close to (Section 4).
We conclude the introduction with an example about the difference between a drawing that fully preserves and one that partially preserves a given topology. Figure 1 shows a simple topological graph for which every polyline drawing fully preserving its topology has at least one bend on some edge. Figure 1 shows a drawing of the same graph that partially preserve its topology and has no bends.
2 Preliminaries
A simple topological graph is a drawing of a graph in the plane such that: (i) vertices are distinct points, (ii) edges are Jordan arcs that connect their endvertices and do not pass through other vertices, (iii) any two edges intersect at most once by either making a proper crossing or by sharing a common endvertex, and (iv) no three edges pass through the same crossing. A simple topological graph has neither multiple edges (otherwise there would be two edges intersecting twice), nor selfloops (because the endpoints of a Jordan arc do not coincide). A simple topological graph is planar if no two of its edges cross. A planar simple topological graph partitions the plane into topological connected regions, called faces of . The unbounded face is called the external face. The planar embedding of a simple planar topological graph fixes the rotation system of , defined as the clockwise circular order of the edges around each vertex, and the external face of . The planar skeleton of a simple topological graph is the subgraph of that contains all vertices and only the uncrossed edges of . A simple topological graph obtained from by adding uncrossed edges (possibly none) is called a planar augmentation of .
Let be an arrangement of pseudolines; a polyline realization of represents each pseudoline as a polygonal chain while preserving the topology of . The curve complexity of is the maximum number of bends per pseudoline in . The curve complexity of is the minimum curve complexity over all polyline realizations of . The graph associated with is a simple topological graph defined as follows. Let be a circle of sufficiently large radius such that all crossings of are inside and every pseudoline intersects the boundary of exactly twice. Replace each crossing between and a pseudoline with a vertex, remove the portions of each pseudoline that are outside , add an apex vertex outside , and connect to the vertices of with crossingfree edges. See Fig. 2 for an example.
Lemma 1.
Let be an arrangement of pseudolines and let be the simple topological graph associated with . Every polyline drawing of that fully preserves its topology has curve complexity if and only if has curve complexity .
Proof.
Assume that every polyline drawing of that fully preserves its topology has curve complexity and suppose, as a contradiction, that has a polyline representation with bends. We draw a circle on so that all crossings and bends are inside . We place a vertex at each crossing between and a pseudoline of and remove the portions of each pseudolines that are outside . We obtain a drawing of except for the apex vertex and its incident edges. We place outside sufficiently far so that it is possible to connect it to all the other vertices by drawing each edge with at most bend. The resulting drawing is a drawing of with curve complexity , a contradiction.
Assume now that every polyline representation of has curve complexity and suppose that admits a polyline drawing whose curve complexity is . For each pseudoline we have two vertices and on and therefore three edges in : , , and , where is the apex vertex of . Each of these three edges has at most bends and therefore their union is a closed curve with at most bends. Let be the point representing in . Suppose first that there exists a halfline with origin that does not intersect except at . It is possible to choose a set of lines parallel to and sufficiently close to it so that each curve can be cut in a neighborhood of and extended to infinity by using two of the parallel lines (see Fig. 3). The resulting drawing is a polyline realization of with curve complexity , a contradiction. If the halfline does not exist, starting from and following the boundary of the external face, we can draw a polyline with at most bends that reaches a point for which the halfline exists and use to extend to infinity the polylines representing the pseudolines. The final drawing has curve complexity , again a contradiction. ∎
Lemma 1 and the result of Eppstein et al. [11] proving the existence of an arrangement of pseudolines with curve complexity imply the following.
Corollary 1.
There exists a simple topological graph with vertices such that any drawing that fully preserves its topology has curve complexity .
In the next section we study a relaxation of the concept of topology preservation by which we derive constant upper bounds on the curve complexity.
3 Polyline Drawings that Partially Preserve the Topology
A polygon is starshaped if there exists a set of points, called the kernel of , such that for every point in this set and for each point of on the boundary of , the segment lies entirely within . A simple topological graph is outer if all its vertices are on the external boundary and all the edges of the external boundary are uncrossed. Let be an outer simple topological graph with vertices and let be a starshaped gon. A drawing of that extends is such that the vertices of are placed at the corners of , and every edge of is drawn either as a side of or inside .
Lemma 2.
Let be an outer simple topological graph with vertices and let be a starshaped gon. There exists a polyline drawing of with curve complexity at most one that partially preserves the topology of and that extends .
Proof.
We explain how to compute a drawing with the desired properties for the complete graph . Clearly a drawing of can be obtained by removing the missing edges. Identify each vertex of with a distinct corner of , and let be the vertices of in the clockwise circular order they appear along the boundary of . Note that every edge , for (indices taken modulo ), coincides with a side of and hence it is drawn as a straightline segment. We now show how to draw all the edges between vertices at distance greater than one. The distance between two vertices and is the number of vertices encountered along when walking clockwise from (excluded) to (included). We orient each edge from to if the distance between and is smaller than or equal to the distance between and . The span of an oriented edge is equal to the distance between and . We add all oriented edges by increasing value of the span. Let be an interior point of the kernel, for example its centroid. For any pair of vertices and , let be the bisector of the angle swept by when rotated clockwise around until it overlaps with . We denote by the drawing after the addition of the first edges and maintain the following invariant for .

For each oriented edge not yet in , there is a point on such that can be drawn with a bend at any point of the segment intersecting any edge of at most once (either at a crossing or at a common endpoint).
We will refer to the segment described in the invariant as the free segment of . Since is starshaped, the invariant holds for ; in particular the free segment of every is the intersection of with the kernel.
Let be the th edge to be added and assume that the invariant holds for . We place the bend point of at any point of the segment . By the invariant, the resulting edge intersects any other existing edge at most once. We now prove that the invariant is maintained. The drawing of the edge divides the polygon in two subpolygons (see Fig. 4). We denote by the one that contains the portion of the boundary of that is traversed when going clockwise from to , and by the other one. Notice that the point is contained in . Let be any oriented edge not in . Before the addition of , by the invariant there was a free segment for . By construction, intersects at most once. If and intersect in a point , let be any point between and on and let ; if they do not intersect let . In both cases is completely contained in . We claim that is a free segment for . Because of the order used to add the edges, the span of is at least the span of . This implies that and cannot both belong to (as otherwise the span of would be smaller than the span of ). We distinguish two cases.
 Case 1:

Both and belong to (possibly coinciding with or ). Refer to Fig. 4. For any point of , the polyline consisting of the two segments and is completely contained in and therefore does not intersects the edge (except possibly at a common endvertex if or coincide with or ). By the invariant, intersects any other existing edge at most once. Thus, is a free segment.
 Case 2:

One between and belongs to and the other one belongs to . Refer to Fig. 4. For any point of , the polyline consisting of the two segments and intersects the edge exactly once. By the invariant, intersects any other existing edge at most once. Thus, is a free segment.
From the argument above we obtain that the final drawing of has curve complexity one and extends . By removing the edges of not in , we obtain a polyline drawing of with curve complexity one that extends . Moreover, partially preserves the topology of . Namely, the circular order of the edges around each vertex and the external boundary are preserved by construction. Furthermore, since is outer, any two of its edges cross if and only if their four endvertices appear interleaved when walking along its external boundary. This property is preserved in , because the order of the vertices along is the same as the order of the vertices along the external boundary of , and because any two edges cross at most once (either at a crossing or at a common endpoint). ∎
We now show how to exploit Lemma 2 to compute a polyline drawing with constant curve complexity for any simple topological graph that has a biconnected planar skeleton .
Theorem 1.
Let be a simple topological graph that admits a planar augmentation whose planar skeleton is biconnected. Then has a polyline drawing with curve complexity at most one that partially preserves its topology. The curve complexity is worstcase optimal.
Proof.
Let be a planar augmentation of whose planar skeleton is biconnected. Each edge of is inside one face of . Thus, our approach is to compute a drawing of where each face is drawn as a starshaped polygon and then to add the missing edges inside each face by using Lemma 2. Since the technique of Lemma 2 has to be slightly adapted to be applied to the external face, we assume first than no edge of is embedded inside the external face of . We augment to a suitable planar triangulation by adding a vertex inside each nontriangular internal face and by connecting it to all the vertices in the boundary of in a planar way. Computing a straightline drawing of the augmented graph and removing the dummy vertices and edges, we obtain the desired drawing whose internal faces are drawn as a startshaped polygons. Let be a face of , let be the subgraph of consisting of the edges of plus the edges that are inside , and let be the starshaped polygon representing in . By Lemma 2, admits a polyline drawing with curve complexity that weakly preserves the topology of and that extends . By computing such a drawing for all faces of we obtain a polyline drawing of with curve complexity . We now prove that partially preserves the topology of . The drawing fully preserves the topology of . Since all edges not in are added inside the face of in which they are embedded in , the only case in which the rotation system or the set of crossings could not be preserved is for edges that do not belong to and that are embedded inside the same face of . By Lemma 2 however the drawing of the graph consisting of the edges of each face plus the edges inside partially preserves the topology of . Thus partially preserves the topology of and removing the edges of we obtain a drawing of that weakly preserves the topology of .
The argument above assumes that no edge of is embedded inside the external face of . If there are some edges embedded inside the external face of , we proceed as follows. When triangulating to obtain a drawing with starshaped faces, we also triangulate (since there are crossing edges embedded inside , it must have degree larger than three). When dummy vertices ad edges are removed from the straightline drawing of the augmented triangulated graph, we remove all dummy vertices ad edges except those that belong to the external boundary of the augmented graph (they are one vertex and two edges). In this way the resulting drawing has one dummy internal face whose boundary contains all the vertices of (and the only dummy vertex not removed). Face is also starshaped and thus we can draw inside all the edges that are embedded inside in using Lemma 2. Removing the dummy vertex and the dummy edges we obtain a drawing where the edges of are drawn inside .
Finally, we show that curve complexity one is optimal in the worst case. The graph of Fig. 5 has a triconnected planar skeleton, and it is immediate to see that it does not admit a straightline drawing that partially preserves its topology. ∎
If is connected, we can draw with three bends per edge.
Theorem 2.
Let be a simple topological graph that admits a planar augmentation whose planar skeleton is connected. Then has a polyline drawing with curve complexity at most three that partially preserves its topology.
Proof.
Let be a planar augmentation of whose planar skeleton is connected. The idea is to add a set of edges to make biconnected and then use Theorem 1. For each face (possibly including the external one) whose boundary contains at least one cutvertex we execute the following procedure. Walk clockwise along the boundary of and let be the sequence of vertices in the order they are encountered during this walk, where the vertices that are encountered more than once (i.e. the cutvertices) appear in the sequence only when they are encountered for the first time. For each pair of consecutive vertices and (for ) in the above sequence, if and are not adjacent in , add to the edge . See Fig. 6 and 6 for an example.
With the addition of the edges of , becomes biconnected (the boundary of each face is a simple cycle). In particular every added edge connects vertices of two different biconnected components, and for every pair of biconnected components there is at most one edge of that connects them.
If we add the edges of to (embedded in the same way with respect to ), we obtain a new topological graph such that the edges of cross the edges of (see Fig. 6). In particular, the edges of that are crossed by the edges of are those incident to the cutvertices of . Let be one such edge and suppose that is a cutvertex. In the circular order of the edges around , the edge appears between two different biconnected components of sharing ; if contains an edge connecting these two components, then crosses . Notice that can be embedded in such a way that the crossing between and is the first one encountered along when going from to . In other words, the portion of from to is not crossed. Since both endvertices of an edge can be cutvertices, each edge of is crossed by the edges of at most twice. Replacing each of the crossings created by the addition of with dummy vertices, we obtain a new topological graph whose planar skeleton is biconnected. By Theorem 1 admits a drawing that partially preserves its topology and such that each edge has at most one bend. Replacing dummy vertices with bends, we obtain a drawing of that partially preserves its topology. We now show that the number of bends per edge is at most . Let be any edge of . As described above, is crossed at most twice by the edges of and therefore is split in at most three “pieces” in . The two “pieces” that are incident to the original vertices are not crossed in and therefore they belong to and are drawn without bends. The third “piece” is not in and is drawn with at most one bend. Thus, has at most three bends. ∎
Theorems 1 and 2 show that constant curve complexity is sufficient for drawings that partially preserve the topology of graphs whose planar skeleton is connected. It is worth remarking that a drawing that fully preserves the topology may require curve complexity even if the planar skeleton is connected. Namely, the planar skeleton of the graphs associated with arrangements of pseudolines is always biconnected and, by Corollary 1, there exists one such graph that has curve complexity.
One may wonder whether the constant curve complexity bound of Theorems 1 and 2 can be extended to the case of nonconnected planar skeletons. This question is answered in the negative by the next theorem.
Theorem 3.
There exists a simple topological graph with vertices such that any drawing that partially preserves its topology has curve complexity .
Proof.
Let be an arrangement of pseudolines and let be the graph associated with . By Lemma 1 any drawing that fully preserves the topology of cannot have a better curve complexity than . On the other hand if we only want to partially preserve the topology, can be realized without bends (see Fig. 7 for a straightline drawing of the graph of Fig. 2). We now describe how to construct a supergraph of , such that in any drawing of that partially preserves its topology, the topology of the subgraph is fully preserved. Refer to Fig. 7 for an illustration concering the graph of Fig. 2. The set of crossing edges of form a set of cells inside the cycle of (these cells correspond to the faces of the planarization of that have at least one dummy vertex). For each of these cells, we add a vertex inside the cell and we connect two such vertices if the corresponding cells share a side. For those cells that have as a side an edge of we add an edge between the vertex added inside that cell and the two endvertices of . Let be the resulting topological graph and let be a drawing that partially preserves the topology of . We claim that the subdrawing of representing fully preserves the topology of . If we remove the edges in , we obtain a planar subgraph whose subdrawing in is planar. By construction, any two faces of share at most one edge or at most one vertex. By Barnette’s Theorem [3] is triconnected and therefore it has only one planar embedding, which is the one defined by . Let be an edge of . In (and therefore in ) there exists two paths and from to with the edges for every . In the edge crosses the edges in this order and it crosses no other edge. Since the set of crossings is preserved in and there is no way for to cross the edges in a different order without creating another crossing, then cross in in the same order as in . This is true for every edge of , which implies that also the crossings between the edges of are preserved in the same order and that is a drawing that fully preserves the topology of .
Denote by the arrangement of pseudolines defined by Eppstein et al. [11]. By the argument above, any polyline drawing that partially preserves the topology of the graph contains a subdrawing of that fully preserves its topology and that therefore has curve complexity by Lemma 1. The number of vertices of is and the number of cells is . This implies that the number of vertices of is . Thus, any drawing that partially preserves the topology of has curve complexity . ∎
Based on Theorem 3 one may wonder whether curve complexity is sufficient when the skeleton is not connected. The following theorem states a preliminary result in this direction, extending Theorem 2 to the case that the planar skeleton consists of at most connected components.
Theorem 4.
Let be a simple topological graph that admits a planar augmentation whose planar skeleton has connected components. Then has a polyline drawing with curve complexity at most that partially preserves its topology.
Proof.
We can assume that is connected. If not we can compute a drawing for each connected component. Let be a planar augmentation of whose planar skeleton has connected components. Since is connected, there exists a set of edges of that can be added to to make it connected. In particular, we can choose a set with of these edges. Denote by the graph obtained by adding the edges of to . The edges of can cross each other. If this is the case we replace each crossing between two edges of with a dummy vertex, thus obtaining a new graph . Denote by the set of edges obtained by the subdivision of the edges in . Since each edge of is crossed at most times, the set has at most edges. We now use the sleeve method (see Section 4): we put a sleeve around each edge of . Let be the resulting graph. The planar skeleton of is connected since it contains all the edges of the original skeleton and all edges of the sleeves, which connected the different connected components of . By Theorem 2 admits a polyline drawing with curve complexity three that partially preserves its topology. Replacing the dummy vertices with bends and removing the dummy edges of the sleeves we obtain a drawing of that partially preserves its topology. We claim that the curve complexity of this drawing is at most . Let be an edge of . If is an edge of is drawn without bends. If , then is split in in at most “pieces”. Each “piece” has at most one bend and at most additional bends are created by the dummy vertices that split , thus the total number of bends is . If does not belong to nor to , let be the number of sleeves traversed by . Then is subdivided in “pieces” (one for each sleeve and outside the sleeves). There is one bend for each “piece” plus one for each dummy vertex splitting , thus the number of bends is . According to the technique of Theorem 2, edge can be split by two additional dummy vertices at each end if it is incident to two cutvertices of the planar skeleton, thus the number of bends is at most . The number of sleeves is at most (i.e., the size of ), but the edge can traverse at most of them, because it crosses each edge of at most once; thus and therefore the curve complexity is at most .∎
4 Polyline Drawings that Fully Preserve the Topology
In this section we study polyline drawings of constant curve complexity for two meaningful families of beyondplanar graphs. Namely, we consider skew graphs and plane graphs. A simple topological graph is skew if there is a set of edges such that does not contain crossings. A simple topological graph is plane if every edge is crossed by at most two other edges. A plane graph with vertices can have at most edges and it is called optimal plane if it has exactly edges. We prove that the graphs belonging to these two families admit a polyline drawing that fully preserves the topology and has constant curve complexity. A tool that we are going to use is the algorithm of Chiba et al. [7] that receives as input a connected plane graph whose external face has vertices, and a convex polygon with corners. The algorithm computes a straightline drawing of that fully preserves the topology of , it has polygon as its external face, and all internal faces are convex. Moreover, if three consecutive vertices belong to a same face and are collinear in the computed drawing, we can slightly perturb one of them without destroying the convexity of the other faces. Thus, we can assume that all faces of are strictly convex.
4.1 skew Topological Graphs
We first show that a skew topological graph admits a polyline drawing that fully preserves the topology of and has at most bends per edge. The technique is based on an approach that we call the sleeve method and that is illustrated in the following.
The sleeve method. Suppose that is a topological graph such that the removal of the edge makes without crossings such as in Fig. 8.
Let be the set of edges that cross and suppose that is a crossing between edges and in . If the clockwise order of the vertices around is , then is a left vertex and is a right
vertex (with respect to the ordered pair
and the crossing ). This is illustrated in Fig. 8: left vertices are coloured red, and right vertices are coloured blue. We add a “sleeve” around , as follows (refer to Fig. 8). Number the edges of in the order of their crossings along , so that crosses at , is left, and is right. We subdivide each edge with dummy vertices and so that the edge becomes a path with the crossing point in between and . Note that after this subdivision, is left and is right, and and are neither left nor right. Next we add a path that begins at and visits each of the left dummy vertices in the order , and ends at . Similarly we add a path that visits , all the right vertices, and then . This is illustrated in Fig. 8. We call the cycle formed by and a sleeve. Note that the interior of the sleeve contains the edges and the edge , but no other vertices or edges (Fig. 8). The next theorem explains how to draw skew graphs with curve complexity .Theorem 5.
Every skew simple topological graph admits a polyline drawing with curve complexity at most that fully preserves its topology.
Proof.
Suppose that is a topological graph and there is a set of edges such that deleting all the edges in from gives a planar topological graph. An example with is in Fig. 9.
Replace each crossing between a pair of edges in with a dummy vertex, and let be the resulting graph. In there is a set of edges such that no two edges in cross, and deleting all the edges in from gives a planar topological graph. Here , where is the number of crossings between edges in . Also, note that the number of such crossings on each edge in is at most . Now add a sleeve around each edge using the sleeve method, and let be the resulting graph (see Fig. 9). Note that two such sleeves do not share any edge, and they share at most one vertex. Delete the interior of each sleeve in to give a planar topological graph . Note that each sleeve of gives a face of . Now triangulate except for the faces of formed by the sleeves (see Fig. 9).
The resulting graph is triconnected by Barnette’s Theorem [3], since two faces share at most one edge or at most one vertex. We can construct a planar drawing of using the convex drawing algorithm of Chiba et al. [7]. Each face of is convex, including each face that comes from a sleeve. Drawing the edges of inside each sleeve as straightline segments gives a straightline drawing of .
Deleting the dummy edges of the sleeves, and replacing the dummy vertices of the sleeves by bends, we have a polyline drawing of that fully preserves the embedding of . The only bends are (1) at the crossing points between edges of , and (2) at the dummy vertices of the sleeves. Let be an edge of . If , then crosses at most edges (those in ) and each of these crossings creates two dummy vertices in a sleeve of , thus resulting in bends. If , then it has bends at the crossings with other edges of , which are at most . An example of this procedure is depicted in Fig. 10. ∎
By Theorem 5 we can draw a skew topological graph with two bends per edge. We now prove that these graphs can be drawn using only one bend per edge. To this aim we first recall some results from [10]. We say that a vertex is inconsistent with respect to the edge if it is both left and right with respect to , and consistent otherwise. For example, the graph in Fig. 11 has an inconsistent vertex.
Observe that in a straightline drawing of a topological graph, an inconsistent vertex would have to be both left and right of the straight line through and . This gives the following necessary condition.
Lemma 3.
[10] A 1skew simple topological graph with an inconsistent vertex has no straightline drawing that fully preserves its topology.
Without additional assumptions, the converse of Lemma 3 is false. For an example, consider Fig. 11; this graph has no straightline drawing, even though all vertices are consistent. The problem is that the internal face has both left and right vertices; as such, this face is inconsistent. To explore the converse of Lemma 3, we can assume that the topological graph is maximal 1skew (that is, no edge can be added while retaining the property of being 1skew). Namely, it has been proven that every 1skew simple topological graph with no inconsistent vertices can be augmented with dummy edges so that the resulting graph has no inconsistent vertices, it is maximal skew, and it fully preserves the topology of its subgraph [10] . Note that both the simple topological graphs in Fig. 11 are maximal 1skew. We denote the set of left (resp. right) vertices of a 1skew topological graph by (resp. ), the subgraph of induced by (resp. ) by (resp. ), the union of and by . Note that and are induced subgraphs, but is not necessarily induced as a subgraph of . The following is proved in [10].
Lemma 4.
[10] Let be a maximal 1skew graph with all vertices consistent. Then: (a) has exactly one inconsistent face, and this face contains both and ; and (b) has a straightline drawing that fully preserves its topology if and only if the inconsistent face of is the external face (of ).
Let be the edge of whose removal makes planar. It is clear that after adding a sleeve around edge , the conditions of Lemma 4 are satisfied and thus, we can compute a straightline drawing, which after removing the dummy vertices of the sleeve, gives rise to a drawing with at most two bends per edge. To prove that one bend per edge suffices, we need a more subtle argument.
Theorem 6.
Every skew simple topological graph admits a polyline drawing with curve complexity at most one that fully preserves its topology. The curve complexity is worstcase optimal.
Proof.
Instead of placing a sleeve around the edge , we use a “halfsleeve”, as follows. Again let be the set of edges that cross . We 1subdivide each edge with a dummy vertex on the left side of the crossing that makes with , then add a path that begins at and visits each of the left dummy vertices in the order that there incident edges cross , and ends at . Denote the graph obtained from by adding this “left halfsleeve” as above by . Similarly, we could add a “right halfsleeve” to obtain a topological graph . It is clear that every vertex in both and is consistent. Note also that we have only added one dummy vertex on each edge ; we aim to draw each of these edges with only one bend per edge. However, it is not clear that the internal faces of and are consistent. Consider, for example, the graph in Fig. 11(b). For this graph, Fig 12 shows , , and . Note that has an internal inconsistent face, while does not.
In order to prove that at most one of the graphs and has an internal inconsistent face, suppose that the inconsistent face of is internal. Note that all the left vertices of lie on the path , and so forms part of the boundary of . Thus consists of , then a walk of right vertices that begins at and ends at . If we traverse in a clockwise direction, the interior is on the right of each edge. Note that the edge lies outside this face. Further, an edge from that crosses has a left vertex on the left and a right vertex on the right; this is illustrated in Fig. 13.
Now the walk may not be a simple path, but it contains a simple path ; concatenating with gives a simple cycle. Note that in , every vertex that is a left vertex in is inside this cycle in . Thus in , every vertex that is a left vertex in is inside the cycle formed by and the edge . This is illustrated in Fig. 13. It follows that every path of left vertices from to lies inside the cycle formed by and the edge . Now consider the graph . The inconsistent face of consists of the path , plus a path of vertices that are left in . It is clear that this is the outside face of ; see Fig. 13. This concludes the proof. ∎
4.2 Optimal plane Graphs
Let be a simple optimal plane graph with vertices. Bekos et al. [5] proved that the planar skeleton of is a pentangulation with vertices, i.e., each face of is a simple cycle, which we call pentagon, and spans all the vertices of . See, for example, Fig. 14. Moreover, each face of has five crossing edges in its interior, which we call chords in the following. Bekos et al. proved that is always connected; we can prove that it is actually connected.
Lemma 5.
Every optimal plane graph has a polyline drawing that fully preserves its topology and with two bends in total.
Proof.
We first prove that the planar skeleton of an optimal plane graph is connected. Suppose, for a contradiction, that contains a separation pair such that its removal disconnects into components, for some . Then there are (at least) distinct faces of , such that both and are incident to these faces (each of these faces is shared by two of the components). Since each face of contains five chords in its interior, it follows that contains (at least) parallel edges having and as endvertices, which contradicts the assumption that is simple.
Let be the five vertices of the external face of in the order they appear when walking clockwise along its boundary. Let be the graph obtained by adding the chord to . We use the algorithm by Chiba et al. [7] to compute a drawing of such that the external face is an equilateral triangle. Note that all the inner faces of are pentagons, except for the cycle . Let be any pentagon of , since it is drawn strictly convex in , its five chords can be drawn with straightline segments such that each segment is entirely contained in (except for its endpoints). Now we aim at drawing the four remaining chords of the external face of (the chord is already drawn) with two bends in total. Since the triangle is equilateral and the cycle is strictly convex, such a drawing can be obtained by representing edges and with straightline segments and edges and with one bend each, as shown in Fig. 14. ∎
Lemma 6.
Every optimal plane graph has a polyline drawing with curve complexity one that fully preserves its topology and such that every crossing angle is at least , for any given .
Proof.
We use again the result by Chiba et al. [7]. This time, we use it to compute a drawing of such that the outer face is as convex polygon having all its corners along an monotone curve; see Fig. 15 for an illustration. Let be an inner face of , which is drawn strictly convex in . Let be the longest among the chords of ; we shall assume that is drawn horizontal, up to a rotation of the drawing. The boundary of is formed by two paths that connect and , one consisting of two edges and the other consisting of three edges. We denote by the vertex in the shorter path, and by and the two vertices in the other path. By possibly mirroring the drawing we can assume that is above and that is to the left of ; see Fig. 15. Consider the vertical halfline starting at . Since is the longest chord of , the crossing point of with is inside , as otherwise would be a chord of longer than . Then we place the bend point on slightly above . The edge is drawn analogously, so these two chords both cross orthogonally. The bend of the edge is placed below and to the right of the crossing point between and ; by choosing the bend point arbitrarily close to we obtain that is formed by a segment whose slope is arbitrarily close to vertical and by a segment whose slope is arbitrarily close to horizontal. Similarly, the bend of the edge is placed below and to the left of the crossing point between and . In addition, the bend point of is placed sufficiently below so that the almost horizontal segment of intersect the almost vertical segment of and the vertical segment of . A suitable choice of the bend points of and of allow us to fix the smallest crossing angle to be arbitrarily close to . Concerning the outer face, since all vertices are placed along an monotone path, it is immediate to see that we can draw all its chords with one bend and such that each segment is either arbitrarily close to vertical or arbitrarily close to horizontal, as shown in Fig. 15. ∎
Lemma 7.
Every optimal plane graph has a polyline drawing with curve complexity two that fully preserves its topology and such that every crossing angle is .
Proof.
We use again the algorithm by Chiba et al. [7]. This time, we use it to to compute a drawing of such that the outer face is a regular gon. Let be an inner face of , which is drawn strictly convex in . Note that each of the five chords in is crossed twice, and hence we can assign each crossing to one of its two involved chords such that each crossing is assigned to one chord and each chord is assigned with exactly one crossing. We then draw the chords as straightline segments and then locally modify the drawing of each chord in correspondence with the assigned crossing. Refer to Fig. 16. Let and be two chords that cross and let be the edge assigned with this crossing. Moreover let and be the two segments obtained from by removing from it a short segment that contains the crossing point. In particular, let be the segment that does not contain the second crossing of the edge . We replace the removed segment with another segment having as an endpoint and such that it cross forming a right angle. Then we slightly change the slope of (and its length) so that coincides with the other endpoint of . Note that the length of (and hence the length of ) can be chosen sufficiently small such that no new crossings are introduced in the drawing. Also, since is not involved in any other crossing, we do not change the angle of any other crossings. With the same strategy all chords of can be modified to have two bends and to cross at right angles. Concerning the outer face, since it is drawn as a regular gon, it is immediate to see that we can draw all its chords with two bends and rectilinear, as in Fig. 16. ∎
Theorem 7.
Every optimal plane graph has a polyline drawing that fully preserves its topology and that has one of the following properties:
5 Open Problems
Theorem 3 proves a lower bound of on the curve complexity of polyline drawings that partially preserve the topology and that do not have a connected skeleton. It may be worth understanding whether this bound is tight.
Theorem 7 proves that for optimal plane graphs a crossing angle resolution arbitrarily close to can be achieved with curve complexity one, while optimal crossing angle of is achieved at the expenses of curve complexity two. Can optimal crossing angle resolution and curve complexity one be simultaneously achieved? A positive answer to this question is known if the planar skeleton of the graph is a dodecahedron [5].
Finally, a natural research direction suggested by the research in this paper is to extend the study of the curve complexity of drawings that fully preserve the topology to other families of beyondplanar topological graphs. For example, it would be interesting to understand whether Theorem 7 can be extended to nonoptimal 2plane graphs.
Acknowledgements
We wish to thank Stephen Wismath for useful discussions about the topics of this research.
References
 [1] Bernardo M. Ábrego, Oswin Aichholzer, Silvia FernándezMerchant, Thomas Hackl, Jürgen Pammer, Alexander Pilz, Pedro Ramos, Gelasio Salazar, and Birgit Vogtenhuber. All good drawings of small complete graphs. In EuroCG 2015, pages 57–60, 2015.
 [2] Oswin Aichholzer, Thomas Hackl, Alexander Pilz, Gelasio Salazar, and Birgit Vogtenhuber. Deciding monotonicity of good drawings of the complete graph. In EGC 2015, pages 33–36, 2015.
 [3] David W. Barnette. 2connected spanning subgraphs of planar 3connected graphs. J. Combin. Theory Ser. B, 61(2):210 – 216, 1994.
 [4] Michael A. Bekos, Michael Kaufmann, and Fabrizio Montecchiani. Guest editors’ foreword and overview. J. Graph Algorithms Appl., 22(1):1–10, 2018.
 [5] Michael A. Bekos, Michael Kaufmann, and Chrysanthi N. Raftopoulou. On optimal 2 and 3planar graphs. In SOCG 2017, volume 77 of LIPIcs, pages 16:1–16:16. LZI, 2017.
 [6] Steven Chaplick, Fabian Lipp, Alexander Wolff, and Johannes Zink. 1bend RAC drawings of NICplanar graphs in quadratic area. In GD 2018. Springer, To appear.
 [7] Norishige Chiba, Kazunori Onoguchi, and Takao Nishizeki. Drawing plane graphs nicely. Acta Inform., 22(2):187–201, 1985.
 [8] Walter Didimo, Giuseppe Liotta, and Fabrizio Montecchiani. A survey on graph drawing beyond planarity. CoRR, abs/1804.07257, 2018.
 [9] Stephane Durocher and Debajyoti Mondal. Relating graph thickness to planar layers and bend complexity. In ICALP 2016, volume 55 of LIPIcs, pages 10:1–10:13. LZI, 2016.
 [10] Peter Eades, SeokHee Hong, Giuseppe Liotta, Naoki Katoh, and SheungHung Poon. Straightline drawability of a planar graph plus an edge. In WADS 2015, pages 301–313. Springer, 2015.
 [11] David Eppstein, Mereke van Garderen, Bettina Speckmann, and Torsten Ueckerdt. Convexarc drawings of pseudolines. CoRR, abs/1601.06865, 2016.
 [12] István Fáry. On straight line representations of planar graphs. Acta Univ. Szeged. Sect. Sci. Math., 11:229–233, 1948.
 [13] Jan Kratochvíl, Anna Lubiw, and Jaroslav Nešetřil. Noncrossing subgraphs in topological layouts. SIAM J. Discrete Math., 4(2):223–244, 1991.
 [14] Jan Kynčl. Simple realizability of complete abstract topological graphs in P. Discrete Comput. Geom., 45(3):383–399, 2011.
 [15] Jan Kynčl. Enumeration of simple complete topological graphs. European Journal of Combinatorics, 30(7):1676 – 1685, 2009.
 [16] Sherman K. Stein. Convex maps. Proc. Am. Math. Soc., 2(3):464–466, 1951.
 [17] Klaus Wagner. Bemerkungen zum Vierfarbenproblem. Jahresber. Dtsch. Math. Ver., 46:26–32, 1936.
Comments
There are no comments yet.