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

    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
    Pages95-107
    Number of pages13
    Volume4372 LNCS
    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)03029743
    ISSN (Electronic)16113349

    Other

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

    Fingerprint

    Graph Embedding
    Stars
    Arc of a curve
    Outerplanar Graph
    Path
    Planar graph
    Star
    Demonstrate

    ASJC Scopus subject areas

    • Computer Science(all)
    • Biochemistry, Genetics and Molecular Biology(all)
    • Theoretical Computer Science

    Cite this

    Cappos, J., Estrella-Balderrama, A., Fowler, J. J., & Kobourov, S. G. (2007). Simultaneous graph embedding with bends and circular arcs. In Graph Drawing - 14th International Symposium, GD 2006, Revised Papers (Vol. 4372 LNCS, pp. 95-107). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4372 LNCS).

    Simultaneous graph embedding with bends and circular arcs. / Cappos, Justin; Estrella-Balderrama, Alejandro; Fowler, J. Joseph; Kobourov, Stephen G.

    Graph Drawing - 14th International Symposium, GD 2006, Revised Papers. Vol. 4372 LNCS 2007. p. 95-107 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4372 LNCS).

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

    Cappos, J, Estrella-Balderrama, A, Fowler, JJ & Kobourov, SG 2007, Simultaneous graph embedding with bends and circular arcs. in Graph Drawing - 14th International Symposium, GD 2006, Revised Papers. vol. 4372 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4372 LNCS, pp. 95-107, 14th International Symposium on Graph Drawing, GD 2006, Karlsruhe, Germany, 9/18/06.
    Cappos J, Estrella-Balderrama A, Fowler JJ, Kobourov SG. Simultaneous graph embedding with bends and circular arcs. In Graph Drawing - 14th International Symposium, GD 2006, Revised Papers. Vol. 4372 LNCS. 2007. p. 95-107. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    Cappos, Justin ; Estrella-Balderrama, Alejandro ; Fowler, J. Joseph ; Kobourov, Stephen G. / Simultaneous graph embedding with bends and circular arcs. Graph Drawing - 14th International Symposium, GD 2006, Revised Papers. Vol. 4372 LNCS 2007. pp. 95-107 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{e1ca62d5701a45e6a56f73c58457724a,
    title = "Simultaneous graph embedding with bends and circular arcs",
    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.",
    author = "Justin Cappos and Alejandro Estrella-Balderrama and Fowler, {J. Joseph} and Kobourov, {Stephen G.}",
    year = "2007",
    language = "English (US)",
    isbn = "9783540709039",
    volume = "4372 LNCS",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    pages = "95--107",
    booktitle = "Graph Drawing - 14th International Symposium, GD 2006, Revised Papers",

    }

    TY - GEN

    T1 - Simultaneous graph embedding with bends and circular arcs

    AU - Cappos, Justin

    AU - Estrella-Balderrama, Alejandro

    AU - Fowler, J. Joseph

    AU - Kobourov, Stephen G.

    PY - 2007

    Y1 - 2007

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

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

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

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

    M3 - Conference contribution

    AN - SCOPUS:38149123497

    SN - 9783540709039

    VL - 4372 LNCS

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 95

    EP - 107

    BT - Graph Drawing - 14th International Symposium, GD 2006, Revised Papers

    ER -