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, Montréal, Canada , pp. 15-29 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_2).
Full text not available from this repository.
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.
Repository Staff Only: item control page