Really straight graph drawings

Vida Dujmović, Matthew Suderman, David R. Wood

    Research output: Contribution to journalConference articleResearchpeer-review

    13 Citations (Scopus)

    Abstract

    We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every 3-connected plane graph on n vertices has a plane drawing with at most 5n/2 segments and at most 2n slopes, and that every cubic 3-connected plane graph has a plane drawing with three slopes (and three bends on the outerface). Drawings of non-planar graphs with few slopes are also considered. For example, it is proved that graphs of bounded degree and bounded treewidth have drawings with script O sign(log n) slopes.

    Original languageEnglish
    Pages (from-to)122-132
    Number of pages11
    JournalLecture Notes in Computer Science
    Volume3383
    Publication statusPublished - 1 Dec 2004
    Event12th International Symposium on Graph Drawing, GD 2004 - New York, United States of America
    Duration: 29 Sep 20042 Oct 2004

    Cite this

    Dujmović, V., Suderman, M., & Wood, D. R. (2004). Really straight graph drawings. Lecture Notes in Computer Science, 3383, 122-132.