Summary

• Page properties (3 modified, 0 added, 0 removed)

Details

Page properties

Title

...	...	@@ -1,1 +1,1 @@
1		-[Pragmatics] Ctrl + F for Diagrams
	1	+[Pragmatics] Visual Editing of the Model Railway DSL

Author

...	...	@@ -1,1 +1,1 @@
1		-XWiki.als
	1	+XWiki.nre

Content

...	...	@@ -1,23 +1,8 @@
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
	1	+
2	2
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.
4		-
5		-A much simpler solution would be to just have a search function inside a diagram.
6		-
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		-
9		-~1. Search in diagram
10		-
11		-2. Search in text and map text occurence in diagram
12		-
13		-3. Traditional good layout to improve readability
14		-
15		-4. More ideas you might have!!
16		-
17	17	= Goals =
18	18
19		-* Implement search strategies for diagrams
20		-* Evaluate the different strategies using standard graph tasks for general graphs or human made graph (on the example of SCCharts)
	5	+*
21	21
22	22	= Scope =
23	23
...	...	@@ -25,8 +25,7 @@
25	25
26	26	= Related Work/Literature =
27	27
28		-* TODO graph tasks
29		-* 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.
	13	+*
30	30
31	31	= Involved Languages/Technologies =
32	32
...	...	@@ -36,6 +36,4 @@
36	36
37	37	= Supervised by =
38	38
39		-Sören Domrös
40		-
41		-sdo@informatik.uni-kiel.de
	23	+