Here's a selection of possible bachelor and master topics. If you're interested in one of them, don't hesitate to contact us! We'll sit down, have tea, and talk about what we great things we could do together.
On this Page
|Table of Contents|
- Implement Greedy Switch Heuristic for Crossing Minimization
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.
Jira server KIELER JIRA columns key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution serverId 2851bd34-0bf1-3f02-ab12-7d77ccab0fae key KIPRA-891
- Layering Algorithms
Implement an alternative algorithm for the layer assignment problem used in the layer-based approach to graph layout.
- Tight Packing of Connected Components
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.
Jira server KIELER JIRA columns key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution maximumIssues 20 jqlQuery key in (KIPRA-1262,KIPRA-1031) serverId 2851bd34-0bf1-3f02-ab12-7d77ccab0fae
- Integrate KIML with JGraph
Provide automatic layout through KIML for the JGraph diagram library and develop a simple JGraph-based graph editor to test the integration with.
Jira showSummary true server KIELER JIRA columns key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution serverId 2851bd34-0bf1-3f02-ab12-7d77ccab0fae key KIPRA-1214
- Improved Edge Label Placement
Our layout algorithm already supports the placement of edge labels. However, there's still room for improvement...
- Layering Algorithms
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.
- Node Placement
Develop a new node placement algorithm that finds a good balance between keeping edges straight and keeping the drawing from getting too big.
- Compound Graph Layout
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.
- Force Based Drawing with Port Constraints
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 on the model library of Ptolemy.
- Combining Forces and Layers
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.
- Diagram Description Language
Developing the concepts and implementation of a diagram description language based on Klighd, with SyncCharts as application example.