We show three linear-time algorithms for constructing planar straight-line grid drawings of outerplanar graphs. The first and the second algorithm are for balanced outerplanar graphs. Both require linear area. The drawings produced by the first algorithm are not outerplanar while those produced by the second algorithm are. On the other hand, the first algorithm constructs drawings with better angular resolution. The third algorithm constructs outerplanar drawings of general outerplanar graphs with O(n 1.48) area. Further, we study the interplay between the area requirements of the drawings of an outerplanar graph and the area requirements of a special class of drawings of its dual tree.
KeywordsPlanar Graph Binary Tree Dual Graph Outerplanar Graph Black Vertex
Unable to display preview. Download preview PDF.
- 3.Brandenburg, F.J., Eppstein, D., Goodrich, M.T., Kobourov, S.G., Liotta, G., Mutzel, P.: Selected open problems in graph drawing. In: Liotta, G. (ed.) Graph Drawing (GD ’03). Lecture Notes in Computer Science, vol. 2912, pp. 515–539. Springer, Berlin (2003) Google Scholar
- 8.Dolev, D., Leighton, F.T., Trickey, H.: Planar embedding of planar graphs. Advances in Computing Research, vol. 2: VLSI Theory (1984) Google Scholar
- 13.Schnyder, W.: Embedding planar graphs on the grid, In: ACM-SIAM Sympos. Discr. Alg. (SODA ’90), pp. 138–148 (1990) Google Scholar