Small Area Drawings of Outerplanar Graphs

Di Battista, Giuseppe and Frati, Fabrizio (2006) Small Area Drawings of Outerplanar Graphs. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005 , pp. 89-100(Official URL: http://dx.doi.org/10.1007/11618058_9).

Full text not available from this repository.

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

Item Type: Conference Paper
Additional Information: 10.1007/11618058_9
Classifications: M Methods > M.600 Planar
G Algorithms and Complexity > G.070 Area / Edge Length
P Styles > P.720 Straight-line
P Styles > P.540 Planar
URI: http://gdea.informatik.uni-koeln.de/id/eprint/683

Actions (login required)

View Item View Item