Summary

• Page properties (2 modified, 0 added, 0 removed)
• Objects (1 modified, 0 added, 0 removed)
  • Confluence.Code.ConfluencePageClass[0]

Details

Page properties

Author

...	...	@@ -1,1 +1,1 @@
1		-XWiki.msp
	1	+XWiki.uru

Content

...	...	@@ -1,13 +1,14 @@
1		-{{panel borderStyle="dashed" title="Project Overview"}}
	1	+{{panel title="Project Overview" borderStyle="dashed"}}
2	2	Responsible:
3	3
4		-* {{mention reference="XWiki.msp" style="FULL_NAME" anchor="XWiki-msp-zbNer"/}}
5		-* {{mention reference="XWiki.cds" style="FULL_NAME" anchor="XWiki-cds-STJCW"/}}
	4	+* {{mention reference="XWiki.msp" style="FULL_NAME" anchor="XWiki-msp-haFjT"/}}
	5	+* {{mention reference="XWiki.cds" style="FULL_NAME" anchor="XWiki-cds-EGDzd"/}}
6	6
7	7	Related Publications:
8	8
9	9	* Miro Spönemann, Hauke Fuhrmann, Reinhard von Hanxleden, and Petra Mutzel. Port constraints in hierarchical layout of data flow diagrams. In //Proceedings of the 17th International Symposium on Graph Drawing// (GD’09), volume 5849 of LNCS, pages 135–146, Springer, 2010. The original publication is available at [[link.springer.com>>url:http://link.springer.com/||shape="rect"]]. ([[pdf>>url:http://rtsys.informatik.uni-kiel.de/%7Ebiblio/downloads/papers/gd09.pdf||shape="rect"]] / [[bib>>url:http://rtsys.informatik.uni-kiel.de/%7Ebiblio/cgi-bin/bibcgi.cgi?key=SpoenemannFvH+09||shape="rect"]])
10	10	* Lars Kristian Klauske, Christoph Daniel Schulze, Miro Spönemann, and Reinhard von Hanxleden. Improved layout for data flow diagrams with port constraints. In //Proceedings of the 7th International Conference on Diagrammatic Representation and Inference// (DIAGRAMS’12), volume 7352 of LNAI, pages 65–79, Springer, 2012. The original publication is available at [[link.springer.com>>url:http://link.springer.com/||shape="rect"]]. ([[pdf>>url:http://rtsys.informatik.uni-kiel.de/%7Ebiblio/downloads/papers/diagrams12b.pdf||shape="rect"]] / [[bib>>url:http://rtsys.informatik.uni-kiel.de/%7Ebiblio/cgi-bin/bibcgi.cgi?key=KlauskeSS+12||shape="rect"]])
	11	+* Christoph Daniel Schulze, Miro Spönemann, and Reinhard von Hanxleden. Drawing layered graphs with port constraints. //Journal of Visual Languages and Computing, Special Issue on on Diagram Aesthetics and Layout//, 25(2):89–106, 2014. The original publication is available at [[www.sciencedirect.com>>url:http://www.sciencedirect.com/||shape="rect"]]. ([[pdf>>url:http://rtsys.informatik.uni-kiel.de/~~biblio/downloads/papers/jvlc13.pdf||shape="rect"]] / [[bib>>url:http://rtsys.informatik.uni-kiel.de/~~biblio/cgi-bin/bibcgi.cgi?key=SchulzeSvH14||shape="rect"]])
11	11
12	12	Related Theses:
13	13
...	...	@@ -26,6 +26,10 @@
26	26
27	27	{{toc maxLevel="2"/}}
28	28
	30	+[[doc:Downloads - KIELER Layout Algorithms]]
	31	+
	32	+{{excerpt-include/}}
	33	+
29	29	= Architecture =
30	30
31	31	To get an idea of how KLay Layered is structured, take a look at the diagram below. The algorithm basically consists of four components: layout phases, intermediate processors, a connected components processor, and an interface to the outside world. Let's briefly look at what each component does before delving into the gritty details.

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-9470034
	1	+9471540

URL

...	...	@@ -1,1 +1,1 @@
1		-https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/9470034/KLay Layered
	1	+https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/9471540/KLay Layered