Article ID Journal Published Year Pages File Type
10327196 Computational Geometry 2012 10 Pages PDF
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Straight-line drawings of outerplanar graphs in O(dnlogn) area
Authors
,