Straight-line drawings of outerplanar graphs in O(dnlogn) area

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