Simultaneous embedding of planar graphs with few bends

Cesim Erten, Stephen G Kobourov

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Citations (Scopus)

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)
Title of host publicationLecture Notes in Computer Science
EditorsJ. Pach
Pages195-205
Number of pages11
Volume3383
StatePublished - 2004
Event12th International Symposium on Graph Drawing, GD 2004 - New York, NY, United States
Duration: Sep 29 2004Oct 2 2004

Other

Other12th International Symposium on Graph Drawing, GD 2004
CountryUnited States
CityNew York, NY
Period9/29/0410/2/04

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Erten, C., & Kobourov, S. G. (2004). Simultaneous embedding of planar graphs with few bends. In J. Pach (Ed.), Lecture Notes in Computer Science (Vol. 3383, pp. 195-205)

Simultaneous embedding of planar graphs with few bends. / Erten, Cesim; Kobourov, Stephen G.

Lecture Notes in Computer Science. ed. / J. Pach. Vol. 3383 2004. p. 195-205.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Erten, C & Kobourov, SG 2004, Simultaneous embedding of planar graphs with few bends. in J Pach (ed.), Lecture Notes in Computer Science. vol. 3383, pp. 195-205, 12th International Symposium on Graph Drawing, GD 2004, New York, NY, United States, 9/29/04.
Erten C, Kobourov SG. Simultaneous embedding of planar graphs with few bends. In Pach J, editor, Lecture Notes in Computer Science. Vol. 3383. 2004. p. 195-205
Erten, Cesim ; Kobourov, Stephen G. / Simultaneous embedding of planar graphs with few bends. Lecture Notes in Computer Science. editor / J. Pach. Vol. 3383 2004. pp. 195-205
@inproceedings{630f487720c34bafac78bf88d87db65d,
title = "Simultaneous embedding of planar graphs with few bends",
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.",
author = "Cesim Erten and Kobourov, {Stephen G}",
year = "2004",
language = "English (US)",
volume = "3383",
pages = "195--205",
editor = "J. Pach",
booktitle = "Lecture Notes in Computer Science",

}

TY - GEN

T1 - Simultaneous embedding of planar graphs with few bends

AU - Erten, Cesim

AU - Kobourov, Stephen G

PY - 2004

Y1 - 2004

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

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

UR - http://www.scopus.com/inward/record.url?scp=24144437166&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=24144437166&partnerID=8YFLogxK

M3 - Conference contribution

VL - 3383

SP - 195

EP - 205

BT - Lecture Notes in Computer Science

A2 - Pach, J.

ER -