Simultaneous embedding of planar graphs with few bends

Cesim Erten, Stephen G. Kobourov

Research output: Contribution to journalConference article

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 languageEnglish (US)
Pages (from-to)195-205
Number of pages11
JournalLECTURE NOTES IN COMPUTER SCIENCE
Volume3383
StatePublished - Dec 1 2004
Event12th International Symposium on Graph Drawing, GD 2004 - New York, NY, United States
Duration: Sep 29 2004Oct 2 2004

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this