Simultaneous graph embedding with bends and circular arcs

Justin Cappos, Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov

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

2 Scopus citations

Abstract

We consider the problem of simultaneous embedding of planar graphs. We demonstrate how to simultaneously embed a path and an n-level planar graph and how to use radial embeddings for curvilinear simultaneous embeddings of a path and an outerplanar graph. We also show how to use star-shaped levels to find 2-bends per path edge simultaneous embeddings of a path and an outerplanar graph. All embedding algorithms run in O(n) time.

Original languageEnglish (US)
Title of host publicationGraph Drawing - 14th International Symposium, GD 2006, Revised Papers
PublisherSpringer-Verlag
Pages95-107
Number of pages13
ISBN (Print)9783540709039
DOIs
StatePublished - 2007
Event14th International Symposium on Graph Drawing, GD 2006 - Karlsruhe, Germany
Duration: Sep 18 2006Sep 19 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4372 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other14th International Symposium on Graph Drawing, GD 2006
CountryGermany
CityKarlsruhe
Period9/18/069/19/06

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Simultaneous graph embedding with bends and circular arcs'. Together they form a unique fingerprint.

Cite this