Next: Orthogonal Representations ( OrthogonalRepresentation Up: Compaction Previous: Longest Path-Based One-dim. Compaction Contents Index

Flow-Based One-dimensional Compaction ( FlowCompaction )

Baseclasses

$\begin{picture}(8,4) \thicklines \put(0,3){\framebox (5.5,1){\bf AGDModule}} ... ...r(0,-1){1}} \put(2.5,0){\framebox (6,1){\bf FlowCompaction}}\end{picture}$

Definition

The class FlowCompaction represents the one-dimensional compaction module based on minimu-cost flow computations in the so called constraint graphs [KM98a].

#include < AGD/FlowCompaction.h >

Creation

FlowCompaction C creates an instance C of type FlowCompaction.

Operations

Standard Interface

double C.call(GridLayout& L) Performs a visibility-based compaction on the layout. The compaction is realized by an alternating sequence of minimum-cost flow computations in the constraint graphs for x and y-direction

int C.call(const OrthogonalRepresentation& H, GridLayout& L)

Performs a visibility-based compaction on the constraint graphs defined by the shape of the drawing. To do this, H must be equivalent to a complete shape description. The result is an drawing with minimum total edge length for the given H

Next: Orthogonal Representations ( OrthogonalRepresentation Up: Compaction Previous: Longest Path-Based One-dim. Compaction Contents Index

double	C.call(GridLayout& L)	Performs a visibility-based compaction on the layout. The compaction is realized by an alternating sequence of minimum-cost flow computations in the constraint graphs for x and y-direction
int	C.call(const OrthogonalRepresentation& H, GridLayout& L)
		Performs a visibility-based compaction on the constraint graphs defined by the shape of the drawing. To do this, H must be equivalent to a complete shape description. The result is an drawing with minimum total edge length for the given H