### 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 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.

Original language | English (US) |
---|---|

Pages (from-to) | 195-205 |

Number of pages | 11 |

Journal | LECTURE NOTES IN COMPUTER SCIENCE |

Volume | 3383 |

State | Published - Dec 1 2004 |

Event | 12th International Symposium on Graph Drawing, GD 2004 - New York, NY, United States Duration: Sep 29 2004 → Oct 2 2004 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Simultaneous embedding of planar graphs with few bends'. Together they form a unique fingerprint.

## Cite this

Erten, C., & Kobourov, S. G. (2004). Simultaneous embedding of planar graphs with few bends.

*LECTURE NOTES IN COMPUTER SCIENCE*,*3383*, 195-205.