Last modified by Soeren Domroes on 2024/05/24 07:41
From version 3.1
edited by Soeren Domroes
on 2022/09/26 06:31
on 2022/09/26 06:31
Change comment:
There is no comment for this version
To version 12.1
edited by Soeren Domroes
on 2024/02/06 11:08
on 2024/02/06 11:08
Change comment:
There is no comment for this version
Summary
-
Page properties (3 modified, 0 added, 0 removed)
-
Attachments (0 modified, 3 added, 0 removed)
-
Objects (1 modified, 0 added, 0 removed)
Details
- Page properties
-
- Title
-
... ... @@ -1,1 +1,1 @@ 1 -N odePlacementwithFlexibleNodeSizeandPortPosition1 +New Crossing Minimization strategies for ELK and their use for SCCharts - Parent
-
... ... @@ -1,0 +1,1 @@ 1 +Theses.Topics for Student Theses.WebHome - Content
-
... ... @@ -1,3 +1,32 @@ 1 +There exist many one-sided crossing minimization strategies such as the Barycenter heuristic [1], the median heursitic [2], as well as sifting [3]. 1 1 3 +The Eclipse Layout Kernel currently supports only the Barycenter heuristic, as well as the greedy switch heuristic [4]. 2 2 3 -{{view-file att--filename="jette-stpa-oyes.svg" height="400"/}} 5 +Part of this thesis should be to implement, new crossing minimization strategies and compare them based on the SCCharts language and its models. 6 + 7 += Goals = 8 + 9 +* Implement already existing crossing minimization strategies in ELK 10 +* Evaluate their use for a SCCharts 11 + 12 += Scope = 13 + 14 +Master's (Bachelor's) Thesis 15 + 16 += Related Work/Literature = 17 + 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. 22 + 23 += Involved Languages/Technologies = 24 + 25 +* Java 26 +* ELK 27 + 28 += Supervised By = 29 + 30 +Sören Domrös 31 + 32 +sdo@ifi
- jette-stpa-oyes-bad.png
-
- Author
-
... ... @@ -1,0 +1,1 @@ 1 +XWiki.sdo - Size
-
... ... @@ -1,0 +1,1 @@ 1 +319.0 KB - Content
- jette-stpa-oyes.png
-
- Author
-
... ... @@ -1,0 +1,1 @@ 1 +XWiki.sdo - Size
-
... ... @@ -1,0 +1,1 @@ 1 +211.6 KB - Content
- jette-stpa-oyes.svg
-
- Author
-
... ... @@ -1,0 +1,1 @@ 1 +XWiki.sdo - Size
-
... ... @@ -1,0 +1,1 @@ 1 +74.7 KB - Content
- Confluence.Code.ConfluencePageClass[0]
-
- Id
-
... ... @@ -1,1 +1,1 @@ 1 -1361839 021 +136183893 - URL
-
... ... @@ -1,1 +1,1 @@ 1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/1361839 02/Node Placement with Flexible Node Size and Port Position1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/136183893/Node Placement with Flexible Node Size and Port Position