Last modified by Soeren Domroes on 2024/05/24 07:41
From version 5.1
edited by Soeren Domroes
on 2022/09/26 07:17
on 2022/09/26 07:17
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,45 +1,32 @@ 1 -{{layout}} 2 -{{layout-section ac:type="single"}} 3 -{{layout-cell}} 4 -The Sugiyama algorithm consists of 5 phases: cycle breaking, layer assignment, crossing minimization, node placement and edge routing. Node placement sets the x-coordinates of nodes (in a downward layout) and creates alignment between nodes, improves edge straightness, or balances nodes based on their incoming edges. Node sizes can also be used to eliminate edge bends by increasing the size of nodes, as seen below, which makes the drawing easier to read, edges easier to follow and therefore easier to understand. 5 -{{/layout-cell}} 6 -{{/layout-section}} 1 +There exist many one-sided crossing minimization strategies such as the Barycenter heuristic [1], the median heursitic [2], as well as sifting [3]. 7 7 8 -{{layout-section ac:type="two_left_sidebar"}} 9 -{{layout-cell}} 10 -[[image:attach:jette-stpa-oyes-bad.png]] 11 -{{/layout-cell}} 3 +The Eclipse Layout Kernel currently supports only the Barycenter heuristic, as well as the greedy switch heuristic [4]. 12 12 13 -{{layout-cell}} 14 -[[image:attach:jette-stpa-oyes.png]] 15 -{{/layout-cell}} 16 -{{/layout-section}} 5 +Part of this thesis should be to implement, new crossing minimization strategies and compare them based on the SCCharts language and its models. 17 17 18 -{{layout-section ac:type="single"}} 19 -{{layout-cell}} 20 -Figure showing the current layout without flexible node size and the existing ONO (obviously not optimal) parts of a layout with flexible node size 21 - 22 22 = Goals = 23 23 24 -* Improve the existing node size flexible network simplex node placement strategy by:\\ 25 -** centering edges on their nodes if it does not compromise the quality of the layout (if necessary by increasing node sizes even more) 26 -** minimize the size of the drawing if possible 27 -* (optional) Explore options that need configuration depending on the context. 28 -** alignment of edges, ... 9 +* Implement already existing crossing minimization strategies in ELK 10 +* Evaluate their use for a SCCharts 29 29 30 30 = Scope = 31 31 32 -Bachelor Thesis 14 +Master's (Bachelor's) Thesis 33 33 34 34 = Related Work/Literature = 35 35 36 -Emden R. Gansner, Eleftherios Koutsofios, Stephen C. North, Kiem-Phong Vo, A technique for drawing directed graphs. Software Engineering 19(3), pp. 214-230, 1993. 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. 37 37 38 - UlfRüegg, //Sugiyama Layouts for PrescribedDrawingAreas//, Disputation: 26 June2018 ([[KCSS>>url:https://www.uni-kiel.de/journals/receive/jportal_jparticle_00000341||shape="rect" class="internal-link"]] 2018/1) (in Chapter 4.1 Network SimplexApproach)23 += Involved Languages/Technologies = 39 39 25 +* Java 26 +* ELK 27 + 40 40 = Supervised By = 41 41 42 42 Sören Domrös 43 -{{/layout-cell}} 44 -{{/layout-section}} 45 -{{/layout}} 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 061 +136183893 - URL
-
... ... @@ -1,1 +1,1 @@ 1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/1361839 06/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