Small area drawings of outerplanar graphs

Authors:
Giuseppe Di Battista;Fabrizio Frati
Affiliations:
Dipartimento di Informatica e Automazione, Università di Roma Tre;Dipartimento di Informatica e Automazione, Università di Roma Tre
Venue:
GD'05 Proceedings of the 13th international conference on Graph Drawing
Year:
2005

Citing 7
Cited 6

On the Angular Resolution of Planar Graphs

SIAM Journal on Discrete Mathematics
A linear-time algorithm for drawing a planar graph on a grid

Information Processing Letters
Embedding planar graphs on the grid

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
On Embedding an Outer-Planar Graph in a Point Set

GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Drawing Outer-Planar Graphs in O(n log n) Area

GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Straight-Line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio

GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Area-efficient graph layouts

SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science

A Lower Bound on the Area Requirements of Series-Parallel Graphs

Graph-Theoretic Concepts in Computer Science
Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract)

WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
On minimum area planar upward drawings of directed trees and other families of directed acyclic graphs

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Four-connected spanning subgraphs of doughnut graphs

WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Small drawings of series-parallel graphs and other subclasses of planar graphs

GD'09 Proceedings of the 17th international conference on Graph Drawing
Straight-line drawings of outerplanar graphs in O(dnlogn) area

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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(n1.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.