Summary

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

Details

Page properties

Content

...	...	@@ -28,8 +28,14 @@
28	28
29	29	* **1 Tight Packing of Connected Components** (Bachelor, Master)
30	30	Different connected components of a graph are often laid out separately and combined again afterwards. This combination step often produces too much whitespace. Research relevant 2D packing literature and implement a better solution.
31		-\\
	31	+{{jira id="KIELER JIRA" columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" key="KIPRA-1262"}}KIPRA-1262{{/jira}}\\
32	32
	33	+{{jira id="KIELER JIRA" columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" key="KIPRA-1031"}}
	34	+KIPRA-1031
	35	+{{/jira}}
	36	+
	37	+
	38	+
33	33	* **2 Heuristics for the Compact Layering Problem** (Bachelor, Master)
34	34	Usually the layer assignment problem of the layer-based approach seeks to let as many edges as possible point into the same direction. Refraining from doing so sometimes allows more compact drawings, which so far has been evaluated using optimization problems. The task is to find and evaluate appropriate heuristics.
35	35	* **2 Evaluate Impact of Reversing Edges on Humans** (Master)
...	...	@@ -41,8 +41,8 @@
41	41
42	42
43	43
44		-* **2 Interactive Constraint Creation and Application in Automatic Layout **(Bachelor, Master)
45		-Evaluate options how to create constraints on the layout like "Node x should be placed at position y" and how to implement this in the current layout algorithms. Assess how such constraints can be persisted within the model.
	50	+* **2 Interactive Constraint Creation and Application in Automatic Layout **(Bachelor/Master)
	51	+Evaluate options how to create constraints on the layout like "Node x should be placed at position y" and how to implement this in the current layout algorithms. Assess how such constraints can be persisted within the model.\\
46	46	* **3 Force Based Drawing with Port Constraints** (Master)
47	47	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"]].
48	48	* **3 Combining Forces and Layers** (Master)**
...	...	@@ -50,7 +50,7 @@
50	50
51	51
52	52
53		-* **1 A (Simple) Edge Router** (Bachelor, Master)
	59	+* **1 A Simple Edge Router** (Bachelor)
54	54	Often, people want their nodes to stay in the same place, but have the edges routed somehow. We currently don't have any layout algorithm that can do so. In this assignment, you would implement a simple edge router to solve this.
55	55	* **1 Improved Spline Edge Routing **(Master)
56	56	Our layer-based layout algorithm is capable to route edges as splines. Evaluate the results using state machine diagrams, identify possible improvements and develop solutions to address these.

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-20152358
	1	+20152354

URL

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