Sciweavers

Share
GD
2004
Springer

Simultaneous Embedding of Planar Graphs with Few Bends

9 years 5 months ago
Simultaneous Embedding of Planar Graphs with Few Bends
We present an O(n) time algorithm for simultaneous embedding of pairs of planar graphs on the O(n2 )×O(n2 ) 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(n2 ) grid with at most one bend per tree-edge and no bends along path edges.
Cesim Erten, Stephen G. Kobourov
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Where GD
Authors Cesim Erten, Stephen G. Kobourov
Comments (0)
books