Skip to Content

Changes for page Available Topics

Last modified by Maximilian Kasperowski on 2026/03/09 09:06
From version 29.1
edited by msp
on 2014/05/05 11:05
Change comment: There is no comment for this version
To version 31.1
edited by uru
on 2014/07/16 17:41
Change comment: There is no comment for this version

Summary

Details

Page properties
Author
... ... @@ -1,1 +1,1 @@
1 -XWiki.msp
1 +XWiki.uru
Content
... ... @@ -12,8 +12,6 @@
12 12  Provide automatic layout through KIML for the JGraph diagram library and develop a simple JGraph-based graph editor to test the integration with.
13 13  * **{{jira showSummary="true" columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" id="KIELER JIRA" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" key="KIPRA-1214"}}KIPRA-1214{{/jira}}Improved Edge Label Placement**
14 14  Our layout algorithm already supports the placement of edge labels. However, there's still room for improvement...
15 -* **Implement a [[KlayJS>>doc:JavaScript (KLayJS)]] adapter for D3.js**
16 -The [[D3.js>>url:http://d3js.org/||shape="rect"]] library is a well-known and widely-used Javascript library for SVG-based visualizations and already comes with [[force-based graph layout >>url:http://bl.ocks.org/mbostock/4062045||shape="rect"]]algorithms. Implement an adapter that allows to use D3 with KlayJS.
17 17  
18 18  == Modeling Pragmatics ==
19 19  
... ... @@ -44,6 +44,8 @@
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.
45 +* **Node Placement**
46 +Develop a new node placement algorithm that finds a good balance between keeping edges straight and keeping the drawing from getting too big.
47 47  * (% style="line-height: 1.4285715;" %)**Compound Graph Layout**(%%)
48 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.
49 49  * **Force Based Drawing with Port Constraints**
Confluence.Code.ConfluencePageClass[0]
Id
... ... @@ -1,1 +1,1 @@
1 -9471219
1 +9471600
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/9471219/Topics for Student Theses
1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/9471600/Topics for Student Theses