Summary

• Page properties (3 modified, 0 added, 0 removed)

Details

Page properties

Title

...	...	@@ -1,1 +1,1 @@
1		-Node Placement with Flexible Node Size and Port Position
	1	+New Crossing Minimization strategies for ELK and their use for SCCharts

Author

...	...	@@ -1,1 +1,1 @@
1		-XWiki.stu230980
	1	+XWiki.sdo

Content

...	...	@@ -1,19 +1,13 @@
	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
2		-The classic Sugiyama graph drawing 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.
	3	+The Eclipse Layout Kernel currently supports only the Barycenter heuristic, as well as the greedy switch heuristic [4].
3	3
4		-[[image:attach:jette-stpa-oyes-bad.png]]
	5	+Part of this thesis should be to implement, new crossing minimization strategies and compare them based on the SCCharts language and its models.
5	5
6		-[[image:attach:jette-stpa-oyes.png]]
7		-
8		-Figure showing the current layout without flexible node size and the existing ONO (obviously not optimal) parts of a layout with flexible node size
9		-
10	10	= Goals =
11	11
12		-* Improve the existing Network Simplex node placement strategy with flexible node size by:\\
13		-** centering edges on their nodes if it does not compromise the quality of the layout, if necessary by increasing node sizes even more
14		-** minimize the size of the drawing if possible
15		-* (optional) Explore options that need configuration depending on the context.
16		-** alignment of edges, ...
	9	+* Implement already existing crossing minimization strategies in ELK
	10	+* Evaluate their use for a SCCharts
17	17
18	18	= Scope =
19	19
...	...	@@ -21,15 +21,15 @@
21	21
22	22	= Related Work/Literature =
23	23
24		-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.
25	25
26		-Ulf Rüegg, //Sugiyama Layouts for Prescribed Drawing Areas //([[KCSS>>url:https://www.uni-kiel.de/journals/receive/jportal_jparticle_00000341||shape="rect" class="internal-link"]] 2018/1), Chapter 4.1: Network Simplex Approach
27		-
28	28	= Involved Languages/Technologies =
29	29
30	30	* Java
31	31	* ELK
32		-** [[https:~~/~~/github.com/eclipse/elk/issues/853>>url:https://github.com/eclipse/elk/issues/853||shape="rect"]] (corresponding ticket in [[ELK>>url:https://www.eclipse.org/elk/||shape="rect"]])
33	33
34	34	= Supervised By =
35	35
...	...	@@ -36,4 +36,3 @@
36	36	Sören Domrös
37	37
38	38	sdo@ifi
39		-