...
- Tight Packing of Connected Components (Bachelor, Master)
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 serverId 2851bd34-0bf1-3f02-ab12-7d77ccab0fae key KIPRA-1262 Jira server KIELER JIRA columns key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution serverId 2851bd34-0bf1-3f02-ab12-7d77ccab0fae key KIPRA-1031
...
- Orthogonal "Edge Bundling" (Bachelor, Master)
Implement and evaluate strategies for orthogonal edge bundling within our layer-based layout algorithm. - A Simple Edge Router (Bachelor)
Often, people want their nodes to stay in the same place, but have the edges routed somehow. We currently don't have any layout algorithm that can do so. In this assignment, you would implement a simple edge router to solve this. - Improved Spline Edge Routing (Master)
Our layer-based layout algorithm is capable to route edges as splines. Evaluate the results using state machine diagrams, identify possible improvements and develop solutions to address these. - Improve and Assess KLay Layered's JUnit Test Environment (Bachelor, Master)
We maintain a variety of JUnit tests to assure our layout algorithm works properly. The environment to execute these tests grew over time and requires a face-lift. The task is to evaluate existing testing frameworks of other projects, find a clean and efficient way to specify and maintain our tests, and update the current implementation.
...