Summary

• Page properties (2 modified, 0 added, 0 removed)
• Objects (1 modified, 0 added, 0 removed)
  • Confluence.Code.ConfluencePageClass[0]

Details

Page properties

Author

...	...	@@ -1,1 +1,1 @@
1		-XWiki.uru
	1	+XWiki.msp

Content

...	...	@@ -4,9 +4,7 @@
4	4
5	5	== Graph Layout ==
6	6
7		-* **Add Support for Self Loops for Polyline / Spline Layouts
8		-**Self loops, that is, edges connecting a node with itself, need to be properly routed. This is already implemented for orthogonal edge routing, but is still an open problem for spline and polyline edge routing.
9		-* **{{jira columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" id="KIELER JIRA" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" key="KIPRA-1073"}}KIPRA-1073{{/jira}}Implement Greedy Switch Heuristic for Crossing Minimization**
	7	+* (% style="line-height: 1.4285715;" %)**Implement Greedy Switch Heuristic for Crossing Minimization**(%%)
10	10	The order of nodes in a layer determines the number of crossings and is computed during the crossing minimization step. The results can usually be further improved by switching the order of nodes around, which we currently lack proper algorithms for.
11	11	* **{{jira columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" id="KIELER JIRA" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" key="KIPRA-891"}}KIPRA-891{{/jira}}Layering Algorithms**
12	12	Implement an alternative algorithm for the layer assignment problem used in the layer-based approach to graph layout.
...	...	@@ -46,9 +46,7 @@
46	46
47	47	* **Layering Algorithms**
48	48	Develop an alternative algorithm for the layer assignment problem used in the layer-based approach to graph layout. The algorithm shall be extended to consider the number of edge crossings and an optimal aspect ratio.
49		-* **Spline Layout**
50		-Develop a proper spline routing for KLay Layered. Part of this would be implementing self-loops with splines. The expected end result is that KLay Layered can well be used to layout state charts.
51		-* **Compound Graph Layout**
	47	+* (% style="line-height: 1.4285715;" %)**Compound Graph Layout**(%%)
52	52	Design and implement new concepts for computing layer-based layouts of compound graphs. The main focus shall be on //maintainability//: ensuring that the implementation can be kept working over the years.
53	53	* **Force Based Drawing with Port Constraints**
54	54	Develop methods for integrating port constraints in force-based drawing approaches. The resulting node placement shall be evaluated using an edge router such as [[libavoid>>url:http://www.adaptagrams.org/||shape="rect"]] on the model library of [[Ptolemy>>url:http://ptolemy.eecs.berkeley.edu/||shape="rect"]].

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-9470598
	1	+9471219

URL

...	...	@@ -1,1 +1,1 @@
1		-https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/9470598/Topics for Student Theses
	1	+https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/9471219/Topics for Student Theses