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.als
	1	+XWiki.uru

Content

...	...	@@ -26,39 +26,40 @@
26	26
27	27	//» Dienste.// Algorithmen und Meta Layout müssen den Anwendern zugänglich gemacht werden, damit ein Nutzen daraus entsteht. Dazu müssen wir verschiedenste graphische Frameworks mit vorhandenen Layout-Bibliotheken integrieren und eine Reihe von Werkzeugen entwickeln, mit denen die Verfügbarkeit unserer Lösungen gesteigert wird. Hierzu gehört z.B. die Unterstützung von Standard-Graphenformaten sowie ein Web-Service für automatisches Layout.
28	28
29		-* **1 Tight Packing of Connected Components** (Bachelor, Master)
	29	+* **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	\\
32	32
33		-* **2 Heuristics for the Compact Layering Problem** (Bachelor, Master)
	33	+* **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		-* **2 Evaluate Impact of Reversing Edges on Humans** (Master)
	35	+* **Evaluate Impact of Reversing Edges on Humans** (Master)
36	36	Reversing edges during the layer assignment problem as suggested by the previous topic may have a negative impact on the readability of diagram. User-studies should be carefully planned and conducted to answer two questions: which edges are naturally reversed by humans and does reversing too many edges worsen comprehensibility?
37		-* **2 Layering Algorithms** (Bachelor, Master)
	37	+* **Layering Algorithms** (Bachelor, Master)
38	38	Implement an alternative algorithm for the layer assignment problem used in the layer-based approach to graph layout. The focus of the algorithm could be the consideration of the number of edge crossings, a given aspect ratio, or overall compactness.
39		-* **2 Node Placement With a Focus on Compactness** (Master)
	39	+* **Node Placement With a Focus on Compactness** (Master)
40	40	Node placement algorithms often try to draw as many edges as straight lines as possible. However, that usually results in less compact diagrams. The focus of this topic would be to devise or adapt a node placement algorithm that tries to strike a balance between straightness and compactness.
41	41
42	42
43	43
44		-* **2 Interactive Constraint Creation and Application in Automatic Layout **(Bachelor, Master)
	44	+* **Interactive Constraint Creation and Application in Automatic Layout **(Bachelor, Master)
45	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.
46		-* **3 Force Based Drawing with Port Constraints** (Master)
	46	+* **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		-* **3 Combining Forces and Layers** (Master)**
	48	+* **Combining Forces and Layers** (Master)**
49	49	**Design and implement a layout algorithm that combines the force-based and the layer-based approaches. The first three phases of the layer-based approach shall be replaced by a node distribution computed with a force-based approach.
50	50
51	51
52	52
53		-* **1 A (Simple) Edge Router** (Bachelor, Master)
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		-* **1 Improved Spline Edge Routing **(Master)
	53	+* **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.
57		-* **1 Improve and Assess KLay Layered's JUnit Test Environment **(Bachelor, Master)
58		-We maintain a variety of JUnit tests to assure our layout algorithm works properly. The environment to execute these tests grew over time and requires a face-lift. The task is to evaluate existing testing frameworks of other projects, find a clean and efficient way to specify and maintain our tests, and update the current implementation.
59		-* **3 Orthogonal "Edge Bundling"** (Bachelor, Master)
	55	+* **Orthogonal "Edge Bundling"** (Bachelor, Master)
60	60	Implement and evaluate strategies for orthogonal edge bundling within our layer-based layout algorithm.
61	61	\\
	58	+* **Force-directed Methods for State Machine Layout** (Master)
	59	+We currently use layer-based methods to layout SCCharts, a state machine dialect. The goal of this topic is to evaluate and implement force-directed methods to lay out SCCharts. Hard requirements are a proper placement of edge labels, proper routing of edges, and being able to specify the relative positioning of certain nodes to each other.
	60	+* **Routing of Self-Loops** (Master)
	61	+Self-loops are an integral part of many diagram types, for instance, of state diagrams and dataflow diagrams. Properly routing self-loops is not as easy as one may think. The task of this topic is to evaluate and implement different strategies to route self-loops for three edge routing styles: polyline, orthogonal, and splines. Labels of self loops are to be considered as well.
	62	+\\
62	62
63	63	= Modeling Pragmatics =
64	64
...	...	@@ -155,3 +155,12 @@
155	155	\\
156	156	* **Developing a domain specific language (DSL) for model railway control** (Bachelor/Master)
157	157	We maintain a model railway installation as a demonstrator for our work and as a student teaching tool. Especially for demonstations to non-technical visitors we would like to have a simple language to create controllers for the railway.
	159	+
	160	+
	161	+
	162	+(% style="display: none;" %)
	163	+(((
	164	+408
	165	+)))
	166	+
	167	+

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-23068931
	1	+25952324

URL

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