There exist many one-sided crossing minimization strategies such as the Barycenter heuristic [1], the median heuristic [2], as well as sifting [3].

The Eclipse Layout Kernel currently supports only the Barycenter heuristic, as well as the greedy switch heuristic [4].

Part of this thesis should be to implement, new crossing minimization strategies and compare them based on the SCCharts language and its models.

Goals

• Implement already existing crossing minimization strategies in ELK
• Evaluate their use for a SCCharts

Scope

Master's (Bachelor's) Thesis

Related Work/Literature

1. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man and Cybernetics, 11(2):109–125, February 1981.
2. P. Eades and S. Whitesides. Drawing graphs in two layers. Theoretical Computer Science, 131:361–374, 1994
3. Matuszewski, Christian, Robby Schönfeld, and Paul Molitor. "Using sifting for k-layer straightline crossing minimization." Graph Drawing: 7th International Symposium, GD’99 Štiřín Castle, Czech Republic September 15–19, 1999 Proceedings 7. Springer Berlin Heidelberg, 1999.
4. P. Eades and D. Kelly. Heuristics for reducing crossings in 2-layered networks. Ars Combin., 21.A:89–98, 1986.

Involved Languages/Technologies

• Java
• ELK

Supervised By

Sören Domrös

sdo@ifi