Planar and Poly-Arc Lombardi Drawings

Christian Duncan, David Eppstein, Michael T. Goodrich, Stephen Kobourov, Maarten Löffler

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Abstract

    In Lombardi drawings of graphs, edges are represented as circular arcs and the edges incident on vertices have perfect angular resolution. However, not every graph has a Lombardi drawing and not every planar graph has a planar Lombardi drawing. We introduce k-Lombardi drawings, in which each edge may be drawn with k circular arcs; we show that every graph has a smooth 2-Lombardi drawing and every planar graph has a smooth planar 3-Lombardi drawing. We also investigate related topics connecting planarity and Lombardi drawings.
    Original languageEnglish
    Title of host publicationProc. 19th Symposium on Graph Drawing
    Pages308-319
    Number of pages12
    Publication statusPublished - 2011

    Publication series

    NameLNCS
    Volume7034

    Keywords

    • CG, GRAPH, GD

    Fingerprint

    Dive into the research topics of 'Planar and Poly-Arc Lombardi Drawings'. Together they form a unique fingerprint.

    Cite this