Quasi-Upward planarity (extended abstract)

Bertolazzi, Paola and Di Battista, Giuseppe and Didimo, Walter (1998) Quasi-Upward planarity (extended abstract). In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998 , pp. 15-29(Official URL: http://dx.doi.org/10.1007/3-540-37623-2_2).

Full text not available from this repository.

Abstract

In this paper we introduce the quasi-upward planar drawing convention and give a polynomial time algorithm for computing a quasi-upward planar drawing with a minimum number of bends within a given planar embedding. Further, we study the problem of computing quasi-upward planar drawings with a minimum number of bends of digraphs considering all the possible planar embeddings. The paper contains also experimental results about proposed techniques.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-37623-2_2
Classifications: P Styles > P.840 Upward
G Algorithms and Complexity > G.490 Embeddings
G Algorithms and Complexity > G.999 Others
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/204

Actions (login required)

View Item View Item