Drawing Outer-Planar Graphs in O(n log n) Area

Biedl, Therese (2002) Drawing Outer-Planar Graphs in O(n log n) Area. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002 , pp. 54-65(Official URL: http://dx.doi.org/10.1007/3-540-36151-0_6).

Full text not available from this repository.

Abstract

In this paper, we study drawings of outer-planar graphs in various models. We show that O(n log n) area can be achieved for such drawings if edges are allowed to have bends or if vertices may be represented by boxes. The question of straight-line grid-drawings of outer-planar graphs in o(n²) area remains open.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-36151-0_6
Classifications: G Algorithms and Complexity > G.070 Area / Edge Length
M Methods > M.600 Planar
G Algorithms and Complexity > G.210 Bends
P Styles > P.540 Planar
URI: http://gdea.informatik.uni-koeln.de/id/eprint/269

Actions (login required)

View Item View Item