This program calculates the movements for the concentrating mapping
of c*c clusters to d*d clusters used in Theorem 6.3 in
"Optimal Deterministic Sorting and Routing on Grids and Tori with
Diagonals"[KNRR96a] of
Kunde,
Niedermeier ,
Reinhardt and
Rossmanith .
After choosing h and calling the Startposition,
You can either perform complete stages or You can perform
the movements from one point selcted by the mouse including all
its mirror positions.
The source.
The triangle-distribution for All-to-all mapping
on the Torus.
Last modified: 24-Apr-97 by
Klaus Reinhardt