Planar drawing algorithms


Functions

TNode abstractMixedGraph::LMCOrderedPartition (TArc *cLeft, TArc *cRight, TNode *vRight) throw (ERRejected)
void abstractMixedGraph::Layout_ConvexDrawing (TArc aBasis=NoArc, TFloat spacing=0.0) throw (ERRejected)
void abstractMixedGraph::Layout_StraightLineDrawing (TArc aBasis=NoArc, TFloat spacing=0.0) throw (ERRejected)

Function Documentation

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

Convex grid drawing of triconnected planar graphs.

All nodes are placed in an integer grid, and all edges are displayed by straight lines without crossings.

Parameters:
aBasis The arc which is drawn in the bottom line
spacing The coordinate-wise minimum number of grid lines between two nodes

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

Straight line grid drawing of planar graphs.

All edges are displayed by straight lines without crossings. If the force-directed post optimization is disabled, all nodes are placed in an integer grid.

Parameters:
aBasis The arc which is drawn in the bottom line
spacing The minimum node distance

TNode LMCOrderedPartition (  TArc *  cLeft,
TArc *  cRight,
TNode *  vRight
)  throw (ERRejected) [inherited]
 

Partition the node set of a triconnected planar graph so that it can be drawn efficiently.

Returns:
The number of generated components
Parameters:
cLeft[] When drawing the components bottom up, the leftmost contact arc
cRight[] When drawing the components bottom up, the rightmost contact arc
vRight[] The right-hand node in the same component, NoNode for the rightmost node
This method is a prerequisite for several planar graph drawing methods:
  • (Convex) straight line embedding
  • 1-bent orthogonal drawing with high-degree nodes
  • Polyline drawings with ports and 3 bends per edge