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

...	...	@@ -4,8 +4,8 @@
4	4
5	5	== Graph Layout ==
6	6
7		-* (% style="line-height: 1.4285715;" %)**Implement Greedy Switch Heuristic for Crossing Minimization**
8		-* 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.
	7	+* (% style="line-height: 1.4285715;" %)**Implement Greedy Switch Heuristic for Crossing Minimization**(%%)
	8	+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.
9	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-891"}}KIPRA-891{{/jira}}Layering Algorithms**
10	10	Implement an alternative algorithm for the layer assignment problem used in the layer-based approach to graph layout.
11	11	* **Integrate KIML with JGraph**
...	...	@@ -44,8 +44,10 @@
44	44
45	45	* **Layering Algorithms**
46	46	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.
47		-* (% style="line-height: 1.4285715;" %)**Compound Graph Layout**
48		-* 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.
	47	+* **Node Placement**
	48	+Develop a new node placement algorithm that finds a good balance between keeping edges straight and keeping the drawing from getting too big.
	49	+* (% style="line-height: 1.4285715;" %)**Compound Graph Layout**(%%)
	50	+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.
49	49	* **Force Based Drawing with Port Constraints**
50	50	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"]].
51	51	* **Combining Forces and Layers

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-9470600
	1	+9471572

URL

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