Simultaneous Embedding of Planar Graphs with Few Bends
Cesim Erten, Stephen Kobourov · Journal of Graph Algorithms and Applications · 2005
Abstract. We present an O(n) time algorithm for simultaneous embedding of pairs of planar graphs on the O(n 2)×O(n 2) grid, with at most three bends per edge, where n is the number of vertices. For the case when the input graphs are are both trees, only one bend per edge is required. We also describe an O(n) time algorithm for simultaneous embedding with fixed-edges for tree-path pairs on the O(n) × O(n 2) grid with at most one bend per tree-edge and no bends along path edges. 1