Weak Dominance Drawings for Directed Acyclic Graphs
The dominance drawing method has many important aesthetic properties, including small number of bends, good vertex placement, and symmetry display . Furthermore, it encapsulates the aspect of characterizing the transitive closure of the digraph by means of a geometric dominance relation among the vertices. A dominance drawing Γ of a planar st-graph G is a drawing, such that for any two vertices u and v there is a directed path from u to v in G if and only if X(u) ≤ X(v) and Y(u) ≤ Y(v) in Γ . Here we study weak dominance drawings where for any two vertices u and v if there is a directed path from u to v in G then X(u) ≤ X(v) and Y(u) ≤ Y(v) in Γ.