Dominance drawing

The edges of a dominance drawing may be drawn either as straight line segments, or, in some cases, as polygonal chains.

The resulting drawing lies within an n × n integer grid, and displays many of the symmetries of the underlying topological embedding.

The (rotated) dominance drawing of a transitively reduced directed acyclic graph may be used as a Hasse diagram of the corresponding partial order.

[4] Given a dominance drawing of a directed acyclic graph D1 = (V, E1), inverting the interpretation of one axis results in a new relation one could call coreachability.

The pairs {≤1, ≤2} of partial orders on a shared ground set that permit such simultaneous representation by a single drawing—interpreted in terms of reachability and coreachability—are called codominant.