In this paper we introduce the quasi-upward planar drawing convention and give a polynomial time algorithm for computing a quasiupward planar drawing with the minimum number of bends within a given planar embedding. Further, we study the problem of computing quasi-upward planar drawings with the minimum number of bends of digraphs considering all the possible planar embeddings. The paper contains also experimental results about the proposed techniques.
Quasi-Upward Planarity
DIDIMO, WALTER
1998
Abstract
In this paper we introduce the quasi-upward planar drawing convention and give a polynomial time algorithm for computing a quasiupward planar drawing with the minimum number of bends within a given planar embedding. Further, we study the problem of computing quasi-upward planar drawings with the minimum number of bends of digraphs considering all the possible planar embeddings. The paper contains also experimental results about the proposed techniques.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.