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.msp
	1	+XWiki.cds

Content

...	...	@@ -5,15 +5,13 @@
5	5	== Diagram Layout ==
6	6
7	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. (See ticket [[KIELER-2136>>url:http://rtsys.informatik.uni-kiel.de/jira/browse/KIELER-2136||shape="rect"]].)
9		-* **Heuristics for Side Aware Edge Label Placement**
10		-Think about and implement heuristic algorithms for solving the edge aware edge label placement problem for placing edge labels in data flow diagrams.
11		-* **Implement Greedy Switch Heuristic for Crossing Minimization**
12		-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. (See ticket [[KIELER-1871>>url:http://rtsys.informatik.uni-kiel.de/jira/browse/KIELER-1871||shape="rect"]])
13		-* **Layering Algorithms**
	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**
	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	+* **{{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**
14	14	Implement an alternative algorithm for the layer assignment problem used in the layer-based approach to graph layout.
15		-* **Node Placement Algorithms**
16		-Implement alternative algorithms for node placement to minimize the number of bend points produced.
	13	+* **Integrate KIML with JGraph**
	14	+Provide automatic layout through KIML for the JGraph diagram library and develop a simple JGraph-based graph editor to test the integration with.
17	17
18	18	== Modeling Pragmatics ==
19	19

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-8651047
	1	+8651105

URL

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