<
From version < 18.1 >
edited by msp
on 2013/11/01 11:08
To version < 19.1 >
edited by cds
on 2013/11/07 09:12
>
Change comment: There is no comment for this version

Summary

Details

Page properties
Author
... ... @@ -1,1 +1,1 @@
1 -XWiki.msp
1 +XWiki.cds
Content
... ... @@ -6,8 +6,6 @@
6 6  
7 7  * **Add Support for Self Loops for Polyline / Spline Layouts
8 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 11  * **Implement Greedy Switch Heuristic for Crossing Minimization**
12 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 13  * **Layering Algorithms**
Confluence.Code.ConfluencePageClass[0]
Id
... ... @@ -1,1 +1,1 @@
1 -8651047
1 +8651049
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/8651049/Topics for Student Theses