Rectilinear drawings of graphs
Carsten Thomassen · Journal of Graph Theory · 1988
Abstract We consider graphs drawn in the plane such that every edge crosses at most one other edge. We characterize, in terms of two forbidden sub‐configurations, which of these graphs are equivalent to drawings such that all edges are straight line segments. As a consequence we obtain a complete characterization of the pairs of dual graphs that can be represented as geometric dual graphs such that all edges except one are straight line segments.