Summary

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

Details

Page properties

Author

...	...	@@ -1,1 +1,1 @@
1		-XWiki.stu230980
	1	+XWiki.sdo

Content

...	...	@@ -1,10 +1,22 @@
1		-
	1	+{{layout}}
	2	+{{layout-section ac:type="single"}}
	3	+{{layout-cell}}
2	2	The classic Sugiyama graph drawing algorithm consists of 5 phases: cycle breaking, layer assignment, crossing minimization, node placement and edge routing. Node placement sets the x-coordinates of nodes (in a downward layout) and creates alignment between nodes, improves edge straightness, or balances nodes based on their incoming edges. Node sizes can also be used to eliminate edge bends by increasing the size of nodes, as seen below, which makes the drawing easier to read, edges easier to follow and therefore easier to understand.
	5	+{{/layout-cell}}
	6	+{{/layout-section}}
3	3
	8	+{{layout-section ac:type="two_left_sidebar"}}
	9	+{{layout-cell}}
4	4	[[image:attach:jette-stpa-oyes-bad.png]]
	11	+{{/layout-cell}}
5	5
	13	+{{layout-cell}}
6	6	[[image:attach:jette-stpa-oyes.png]]
	15	+{{/layout-cell}}
	16	+{{/layout-section}}
7	7
	18	+{{layout-section ac:type="single"}}
	19	+{{layout-cell}}
8	8	Figure showing the current layout without flexible node size and the existing ONO (obviously not optimal) parts of a layout with flexible node size
9	9
10	10	= Goals =
...	...	@@ -36,4 +36,6 @@
36	36	Sören Domrös
37	37
38	38	sdo@ifi
39		-
	51	+{{/layout-cell}}
	52	+{{/layout-section}}
	53	+{{/layout}}