Area-Efficient Drawings of Outerplanar Graphs

Garg, Ashim and Rusu, Adrian (2004) Area-Efficient Drawings of Outerplanar Graphs. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003 , pp. 129-134(Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_12).

Full text not available from this repository.

Abstract

We show that an outerplanar graph G with n vertices and degree d admits a planar straight-line grid drawing with area O(dn^{1.48}) in O(n) time. This implies that if d =o(n^{0.52}), then G can be drawn in this fashion in o(n^2) area.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-540-24595-7_12
Classifications: P Styles > P.720 Straight-line
G Algorithms and Complexity > G.070 Area / Edge Length
P Styles > P.540 Planar
URI: http://gdea.informatik.uni-koeln.de/id/eprint/439

Actions (login required)

View Item View Item