Straight-line Drawings of Outerplanar Graphs in O(dn log n) Area

We show an algorithm for constructing O(dn log n) area outerplanar straight-line drawings of n-vertex outerplanar graphs with degree d. Also, we settle in the negative a conjecture [1] on the area requirement of outerplanar graphs by showing that snowflake graphs admit linear area drawings.

• Type: Conference
• Year: 2007
• Where: CCCG
• Authors: Fabrizio Frati
• Keywords: CCCG 2007, Computational Geometry, N-vertex Outerplanar Graphs, Outerplanar Graphs, Outerplanar Straight-line Drawings