Next: Flow-Based One-dimensional Compaction ( Up: Compaction Previous: Compaction Modules ( CompactionModule Contents Index

Longest Path-Based One-dim. Compaction ( LongestPathCompaction )

Baseclasses

$\begin{picture}(8,4) \thicklines \put(0,3){\framebox (5.5,1){\bf AGDModule}} ... ...{1}} \put(1,0){\framebox (7.5,1){\bf LongestPathCompaction}}\end{picture}$

Definition

The class LongestPathCompaction represents the one-dimensional compaction module based on longest path computations in the so called constraint graphs [KM98a].

#include < AGD/LongestPathCompaction.h >

Creation

LongestPathCompaction C creates an instance C of type LongestPathCompaction.

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 longest path 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.

Next: Flow-Based One-dimensional Compaction ( Up: Compaction Previous: Compaction Modules ( CompactionModule Contents Index

double	C.call(GridLayout& L)	Performs a visibility-based compaction on the layout. The compaction is realized by an alternating sequence of longest path 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.