# Page History

## Key

• This line was removed.
• Formatting was changed.

...

• 1 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 key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution 2851bd34-0bf1-3f02-ab12-7d77ccab0fae KIPRA-1262
Jira
server KIELER JIRA key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution 2851bd34-0bf1-3f02-ab12-7d77ccab0fae KIPRA-1031

• 2 Heuristics for the Compact Layering Problem (Bachelor, Master)
Usually the layer assignment problem of the layer-based approach seeks to let as many edges as possible point into the same direction. Refraining from doing so sometimes allows more compact drawings, which so far has been evaluated using optimization problems. The task is to find and evaluate appropriate heuristics.
• 2 Evaluate Impact of Reversing Edges on Humans (Master)
Reversing edges during the layer assignment problem as suggested by the previous topic may have a negative impact on the readability of diagram. User-studies should be carefully planned and conducted to answer two questions: which edges are naturally reversed by humans and does reversing too many edges worsen comprehensibility?
• 2 Layering Algorithms (Bachelor, Master)
Implement an alternative algorithm for the layer assignment problem used in the layer-based approach to graph layout. The focus of the algorithm could be the consideration of the number of edge crossings, a given aspect ratio, or overall compactness.
• 2 Node Placement With a Focus on Compactness (Master)
Node placement algorithms often try to draw as many edges as straight lines as possible. However, that usually results in less compact diagrams. The focus of this topic would be to devise or adapt a node placement algorithm that tries to strike a balance between straightness and compactness.

...

• 2 Interactive Constraint Creation and Application in Automatic Layout (Bachelor/Master)
Evaluate options how to create constraints on the layout like "Node x should be placed at position y" and how to implement this in the current layout algorithms. Assess how such constraints can be persisted within the model.
• 3 Force Based Drawing with Port Constraints (Master)
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.
• 3 Combining Forces and Layers (Master)
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.

...