Planar orthogonal drawing

Functions
void	abstractMixedGraph::Layout_VisibilityRepresentation (TMethOrthogonal method=ORTHO_VISIBILITY_TRIM, TFloat spacing=0.0) throw (ERRejected)
void	abstractMixedGraph::Layout_StaircaseDrawing (TArc aBasis=NoArc, TFloat spacing=0.0) throw (ERRejected)
void	abstractMixedGraph::Layout_StaircaseTriconnected (TArc aBasis=NoArc, TFloat spacing=0.0) throw (ERRejected)

---

Function Documentation

void Layout_StaircaseDrawing (  TArc  aBasis = NoArc, TFloat  spacing = 0.0 )  throw (ERRejected) [inherited]

1-Bent orthogonal grid drawing of planar graphs with high degree nodes All nodes are placed in a coarse integer grid and drawn with equal size. All edges are displayed by orthogonal open polygons in a fine grid without crossings. Parameters: aBasis  The arc which is routed outermost on the left hand and the bottom side spacing  The minimum node distance

void Layout_StaircaseTriconnected (  TArc  aBasis = NoArc, TFloat  spacing = 0.0 )  throw (ERRejected) [inherited]

1-Bent orthogonal grid drawing of triconnected planar graphs with high degree nodes All nodes are placed in a coarse integer grid and drawn with equal size. All edges are displayed by orthogonal open polygons in a fine grid without crossings. The graph must be simple and triconnected. Parameters: aBasis  The arc which is routed outermost on the left hand and the bottom side spacing  The minimum node distance

void Layout_VisibilityRepresentation (  TMethOrthogonal  method = ORTHO_VISIBILITY_TRIM, TFloat  spacing = 0.0 )  throw (ERRejected) [inherited]

Draw a planar graph in the visibility representation model. Parameters: method  Either ORTHO_VISIBILITY_TRIM, ORTHO_VISIBILITY_RAW or ORTHO_VISIBILITY_GIOTTO spacing  The minimum distance between two nodes / parallel edge segments This methods draws planar graphs such that all nodes are horizontal line segments, and all edges are vertical line segments. If ORTHO_VISIBILITY_TRIM is specified, the length of the node segments is just as necessary to cover the adjacent edges. If ORTHO_VISIBILITY_RAW is specified, the lengths of the horizontal node segments is as provided by the core algorithm (sometimes overshooting at the right-hand side). If ORTHO_VISIBILITY_GIOTTO is specified, actually no visibility representation results, but the node segments are shrunk such that edges can enter a node at its left or right hand side. In the special case of 3-planar graphs, one obtains small nodes.