Wiki source code of [Layout] New Crossing Minimization strategies for ELK and their use for SCCharts
Last modified by Soeren Domroes on 2024/05/24 07:41
Hide last authors
author | version | line-number | content |
---|---|---|---|
![]() |
14.1 | 1 | There exist many one-sided crossing minimization strategies such as the Barycenter heuristic [1], the median heuristic [2], as well as sifting [3]. |
![]() |
11.1 | 2 | |
![]() |
12.1 | 3 | The Eclipse Layout Kernel currently supports only the Barycenter heuristic, as well as the greedy switch heuristic [4]. |
![]() |
3.1 | 4 | |
![]() |
12.1 | 5 | Part of this thesis should be to implement, new crossing minimization strategies and compare them based on the SCCharts language and its models. |
![]() |
3.1 | 6 | |
![]() |
4.1 | 7 | = Goals = |
8 | |||
![]() |
12.1 | 9 | * Implement already existing crossing minimization strategies in ELK |
10 | * Evaluate their use for a SCCharts | ||
![]() |
4.1 | 11 | |
12 | = Scope = | ||
13 | |||
![]() |
8.1 | 14 | Master's (Bachelor's) Thesis |
![]() |
4.1 | 15 | |
16 | = Related Work/Literature = | ||
17 | |||
![]() |
12.1 | 18 | 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. |
19 | 1. P. Eades and S. Whitesides. Drawing graphs in two layers. Theoretical Computer Science, 131:361–374, 1994 | ||
20 | 1. 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. | ||
21 | 1. P. Eades and D. Kelly. Heuristics for reducing crossings in 2-layered networks. Ars Combin., 21.A:89–98, 1986. | ||
![]() |
4.1 | 22 | |
![]() |
7.1 | 23 | = Involved Languages/Technologies = |
![]() |
6.1 | 24 | |
![]() |
7.1 | 25 | * Java |
26 | * ELK | ||
27 | |||
![]() |
4.1 | 28 | = Supervised By = |
29 | |||
30 | Sören Domrös | ||
![]() |
7.1 | 31 | |
32 | sdo@ifi |