Wiki source code of [Pragmatics] Ctrl + F for Diagrams
Last modified by Niklas Rentz on 2024/08/05 12:45
Hide last authors
| author | version | line-number | content |
|---|---|---|---|
 |
15.1 | 1 | A common task for evaluating the quality of a graph drawing algorithm is the time it takes to find a specific element (as well as tasks such as finding |
 |
14.1 | 2 | |
| |
15.1 | 3 | the fastest route between two nodes and others). The traditional approach would be to optimize graph aesthetic criteria (such as the scale measure or the edge crossings) to improve the readability of the graph. |
| |
14.1 | 4 | |
| |
15.1 | 5 | A much simpler solution would be to just have a search function inside a diagram. |
| |
14.1 | 6 | |
| |
15.1 | 7 | In our KIELER framework, one does not only have a diagram, but always the text it is synthesized from, which leaves multiple ways to implement a search function for diagrams. |
| 8 | |||
| |
18.1 | 9 | 1. Search in diagram |
| 10 | 1. Search in text and map text occurrence in diagram | ||
| 11 | 1. Find ways to sensibly highlight and navigate to searched elements in the diagram | ||
| 12 | 1. Traditional good layout to improve readability | ||
| 13 | 1. More ideas you might have!! | ||
| |
15.1 | 14 | |
| |
18.1 | 15 | Furthermore, the models behind diagrams might also contain tags with further information. The search function implemented by this thesis might also include a way to not only search for texts occurring on screen in the diagram, but also to query for different tags and navigate and highlight the diagram. |
| |
15.1 | 16 | |
| |
6.1 | 17 | = Goals = |
| 18 | |||
| |
15.1 | 19 | * Implement search strategies for diagrams |
| |
18.1 | 20 | * Find good visual representations for highlighting searched elements |
| |
15.1 | 21 | * Evaluate the different strategies using standard graph tasks for general graphs or human made graph (on the example of SCCharts) |
| |
6.1 | 22 | |
| |
5.1 | 23 | = Scope = |
| 24 | |||
| |
13.9 | 25 | Master's/Bachelor's Thesis |
| |
5.1 | 26 | |
| |
1.1 | 27 | = Related Work/Literature = |
| 28 | |||
| |
15.1 | 29 | * TODO graph tasks |
| 30 | * K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man and Cybernetics, 11(2):109–125, February 1981. | ||
| |
18.1 | 31 | * Maximilian Kasperowski and Niklas Rentz and Sören Domrös and Reinhard von Hanxleden. //KIELER: A Text-First Framework for Automatic Diagramming of Complex Systems.// In Diagrammatic Representation and Inference, 14th International Conference, DIAGRAMS ’24, 2024. To be published. (ask us for a preliminary version) |
| |
1.1 | 32 | |
| |
6.1 | 33 | = Involved Languages/Technologies = |
| 34 | |||
| |
13.9 | 35 | * Java / Xtend in SCCharts Synthesis |
| 36 | * Typescript in klighd-vscode | ||
| |
15.1 | 37 | * Sprotty |
| |
6.1 | 38 | |
| |
4.1 | 39 | = Supervised by = |
| |
3.1 | 40 | |
| |
18.1 | 41 | Sören Domrös [[sdo@informatik.uni-kiel.de>>mailto:sdo@informatik.uni-kiel.de]] |
| |
6.1 | 42 | |
| |
18.1 | 43 | Niklas Rentz [[nre@informatik.uni-kiel.de>>mailto:nre@informatik.uni-kiel.de]] |