A note on optimal area algorithms for upward drawings of binary trees
Computational Geometry: Theory and Applications
Triangulating planar graphs while minimizing the maximum degree
Information and Computation
Embedding planar graphs on the grid
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Drawing Outer-Planar Graphs in O(n log n) Area
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
On linear area embedding of planar graphs
On linear area embedding of planar graphs
Area-efficient planar straight-line drawings of outerplanar graphs
Discrete Applied Mathematics
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Small Area Drawings of Outerplanar Graphs
Algorithmica
Straight-line drawings of general trees with linear area and arbitrary aspect ratio
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
A note on minimum-area straight-line drawings of planar graphs
GD'07 Proceedings of the 15th international conference on Graph drawing
Small area drawings of outerplanar graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
| Hi-index | 0.00 |
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.